1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-8bf5a5fa194d2ba8.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-8bf5a5fa194d2ba8.js"],"CodeViewer"] 1c:T77a,#include #include #include #include "testlib.h" using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose small number of towns int N = rnd.next(2, 10); int X = rnd.next(1, N); // Prepare list of other towns vector others; for (int i = 1; i <= N; ++i) { if (i != X) others.push_back(i); } set> seen; vector, int>> edges; // Build in-tree to ensure each node can reach X vector procIn = {X}; shuffle(others.begin(), others.end()); for (int u : others) { int v = rnd.any(procIn); if (seen.insert({u, v}).second) { int w = rnd.next(1, 100); edges.push_back({{u, v}, w}); } procIn.push_back(u); } // Build out-tree to ensure X can reach each node vector procOut = {X}; vector order = others; shuffle(order.begin(), order.end()); for (int v : order) { int u = rnd.any(procOut); if (seen.insert({u, v}).second) { int w = rnd.next(1, 100); edges.push_back({{u, v}, w}); } procOut.push_back(v); } // Determine extra edges to add (cap total edges ≤20) int base = seen.size(); int maxTotal = N * (N - 1); int maxExtra = min(maxTotal -

코드 #2644