19:I[10086,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"AdSenseInsert"] 1a:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"CodeViewer"] 1b:T668,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]){ registerGen(argc, argv, 1); // We choose T = 2 test cases for a small, easily verifiable input. int T = rnd.next(1, 2); println(T); for (int tc = 0; tc < T; tc++){ int N = rnd.next(2, 8); vector times(N); for (int i = 0; i < N; i++){ times[i] = rnd.next(0, 100); } vector perm; for (int i = 1; i <= N; i++){ perm.push_back(i); } shuffle(perm.begin(), perm.end()); // Generate a DAG of dependency rules: // For each pair (perm[i], perm[j]) with i < j, add an edge with probability p. double p = rnd.next(0.01, 0.99); vector> edges; for (int i = 0; i < N; i++){ for (int j = i + 1; j < N; j++){ if(rnd.next() < p){ edges.push_back({perm[i], perm[j]}); } } } // Ensure there is at least one dependency if possible. if (edges.empty()){ edges.push_back({perm[0], perm[1]}); } int K = edges.size(); println(N, K); // Output building times. println(times)

코드 #1718