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:T732,#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter for number of topics N (1..10), biased int tN = rnd.next(-1, 1); int N = rnd.wnext(10, tN) + 1; // Create a random topological order of topics 1..N vector order(N); iota(order.begin(), order.end(), 1); shuffle(order.begin(), order.end()); // Hyper-parameter for maximum base time Emax (1..100), biased int t_e = rnd.next(-1, 1); int Emax = rnd.wnext(100, t_e) + 1; // Assign base times e_i vector e(N+1); for (int u = 1; u <= N; u++) { e[u] = rnd.next(1, Emax); } // Hyper-parameter for dependency density bias int t_d = rnd.next(-1, 1); // Build dependencies respecting the topological order vector> deps(N+1); for (int idx = 0; idx < N; idx++) { int u = order[idx]; int prev = idx; // number of earlier nodes if (prev > 0) { // choose di in [0..prev], biased by t_d int di = rnd.wnext(prev + 1, t_d); // pick a random subset of size di from the earlier nodes vector cand(order.begin(), order.begin() + idx); shuffle(cand.begin(), cand.end()); deps[u].insert(deps[u].end(), cand.begin(), cand.begin() + di); // shuffle the chose

코드 #4583