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:T757,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small size int N = rnd.next(1, 10); // Choose tree shape: 0=chain, 1=star, 2=random int treeType = rnd.next(0, 2); vector> edges; if (treeType == 0) { // Chain 1-2-3-...-N for (int i = 2; i <= N; ++i) { edges.emplace_back(i-1, i); } } else if (treeType == 1) { // Star centered at c int c = rnd.next(1, N); for (int i = 1; i <= N; ++i) { if (i != c) edges.emplace_back(c, i); } } else { // Random tree by linking i to a random previous node for (int i = 2; i <= N; ++i) { int p = rnd.next(1, i-1); edges.emplace_back(p, i); } } // Shuffle edges for randomness shuffle(edges.begin(), edges.end()); // Compute degrees to find leaves vector deg(N+1, 0); for (auto &e : edges) { deg[e.first]++; deg[e.second]++; } vector leaves; for (int i = 1; i <= N; ++i) { if (deg[i] <= 1) leaves.push_back(i); } if (leaves.empty()) leaves.push_back(1); // fallback for N=0? but N>=1 // Choose starting node S: sometimes a leaf, sometimes any int S; if (rnd.next() < 0.5) { S = rnd.any(leaves); } else { S = rnd.next(1, N); }

코드 #4989