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:T75c,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of test cases int T = rnd.next(5, 10); println(T); for (int tc = 0; tc < T; tc++) { // Choose N small but diverse int N; if (rnd.next() < 0.5) N = rnd.next(1, 5); else N = rnd.next(6, 10); println(N); // Choose starting point a int a; if (N == 1) { a = 1; } else { double p = rnd.next(); if (p < 0.2) a = 1; else if (p < 0.4) a = N; else a = rnd.next(1, N); } println(a); // Generate the N-1 travel times if (N >= 2) { int mode = rnd.next(0, 2); vector t(N - 1); if (mode == 0) { // Mixed uniform: some small, some larger for (int i = 0; i < N - 1; i++) { if (rnd.next() < 0.3) t[i] = rnd.next(10, 20); else t[i] = rnd.next(1, 10); } } else if (mode == 1) { // Monotonic increasing int base = rnd.next(1, 5); int delta = rnd.next(1, 3); for (int i = 0; i < N - 1; i++) { int v = base + i * delta + rnd.next(0, 2); t[i] = min(20, max(1, v)); } } el

코드 #3534