1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T764,#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small sizes for hand-checkability int N = rnd.next(2, 10); int M = rnd.next(1, 10); int K = rnd.next(1, N); // Hyper-parameters for diversity double overallDensity = rnd.next(0.0, 1.0); // chance to use weighted vs uniform int globalExp = rnd.next(-2, 2); // exponent for wnext double singleProb = rnd.next(0.0, 1.0); // chance for single-task employee bool enforceAll = rnd.next() < 0.3; // chance to have a "super" employee int superEmp = enforceAll ? rnd.next(1, N) : -1; // Prepare tasks 1..M vector baseTasks(M); iota(baseTasks.begin(), baseTasks.end(), 1); // Output header println(N, M, K); for (int i = 1; i <= N; i++) { // Determine this employee's task list vector avail = baseTasks; int d; if (enforceAll && i == superEmp) { // Super employee can do all tasks d = M; } else if (rnd.next() < singleProb * 0.3) { // Some employees can do exactly one random task d = 1; } else { // Mix uniform and weighted degree if (rnd.next() < overallDensity) { // weighted: more skewed distributions d = rnd.wnext

코드 #4569