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:T770,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of islands int n = rnd.next(1, 10); vector> edges; // Hyper-parameters double p_out = rnd.next(); // probability of an outgoing zip-line bool modeCycle = rnd.next() < 0.5; // whether to force a large cycle auto pickTarget = [&](int v) { // pick w in [0, n-1], w != v int w; do { w = rnd.next(0, n-1); } while (w == v); return w; }; if (modeCycle && n >= 2) { // Create one cycle of random size between 2 and n int k = rnd.next(2, n); vector ord(n); iota(ord.begin(), ord.end(), 0); shuffle(ord.begin(), ord.end()); vector inCycle(n, false); for (int i = 0; i < k; i++) { inCycle[ord[i]] = true; } // Build the cycle edges for (int i = 0; i < k; i++) { int u = ord[i]; int v = ord[(i + 1) % k]; edges.emplace_back(u, v); } // Attach the remaining vertices randomly for (int v = 0; v < n; v++) { if (inCycle[v]) continue; if (rnd.next() < p_out) { edges.emplace_back(v, pickTarget(v)); } } } else { // Pure random mapping: each vert

코드 #5226