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:T637,#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of vertices int N = rnd.next(1, 10); // Build a random functional graph: each vertex has at most one outgoing edge vector out(N+1, 0); int edgesCount = rnd.next(0, N); vector nodes(N); iota(nodes.begin(), nodes.end(), 1); shuffle(nodes.begin(), nodes.end()); vector withEdge(nodes.begin(), nodes.begin() + edgesCount); for (int u : withEdge) { int v = rnd.next(1, N); if (v == u && N > 1) { v = (u % N) + 1; } out[u] = v; } // Number of queries int Q = rnd.next(1, 20); double p_removal = rnd.next(); // probability to pick a removal query // Maintain list of vertices whose outgoing edge can still be removed vector rem_nodes = withEdge; // Output the graph println(N); for (int i = 1; i <= N; i++) { printf("%d%c", out[i], i == N ? '\n' : ' '); } // Output queries println(Q); for (int i = 0; i < Q; i++) { bool doRemove = !rem_nodes.empty() && rnd.next() < p_removal; if (doRemove) { int idx = rnd.next(0, (int)rem_nodes.size() - 1); int u = rem_nodes[idx]; println(2, u); // remove the edge rem_nodes.erase(rem_no

코드 #3219