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:T7f2,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose small-to-medium N int N = rnd.next(2, 15); vector P(N+1); // Hyper-parameter: tree shape int shape = rnd.next(0, 3); if (shape == 0) { // Chain for (int i = 2; i <= N; i++) P[i] = i-1; } else if (shape == 1) { // Star for (int i = 2; i <= N; i++) P[i] = 1; } else if (shape == 2) { // Balanced-like for (int i = 2; i <= N; i++) P[i] = i/2; } else { // Random tree for (int i = 2; i <= N; i++) P[i] = rnd.next(1, i-1); } // Compute depths vector depth(N+1); depth[1] = 0; for (int i = 2; i <= N; i++) { depth[i] = depth[P[i]] + 1; } // Hyper-parameter: weight assignment int wtype = rnd.next(0, 3); vector A(N+1); if (wtype == 0) { // Random permutation vector vals(N); for (int i = 0; i < N; i++) vals[i] = i+1; shuffle(vals.begin(), vals.end()); for (int i = 1; i <= N; i++) A[i] = vals[i-1]; } else if (wtype == 1) { // Ascending by index for (int i = 1; i <= N; i++) A[i] = i; } else if (wtype == 2) { // Descending by index for (int i = 1; i <= N; i++) A[i] = N - i + 1; } else { // Increasing along depth vect

코드 #6383