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:T650,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of zones and queries int N = rnd.next(1, 20); int Q = rnd.next(1, 30); // Initial attractions vector A(N); int initType = rnd.next(0, 2); if (initType == 0) { // all zeros fill(A.begin(), A.end(), 0); } else if (initType == 1) { // all ones fill(A.begin(), A.end(), 1); } else { // random with bias for (int i = 0; i < N; i++) { A[i] = (rnd.next() < 0.3 ? 1 : 0); } } // Output N, Q and initial A println(N, Q); println(A); // Ensure at least one type-3 query vector qtype(Q, 0); int k3 = rnd.next(1, min(5, Q)); vector idx(Q); for (int i = 0; i < Q; i++) idx[i] = i; shuffle(idx.begin(), idx.end()); for (int i = 0; i < k3; i++) { qtype[idx[i]] = 3; } for (int qi = 0; qi < Q; qi++) { if (qtype[qi] == 3) { println(3); } else { // choose type 1 or 2 if (rnd.next(1, 2) == 1) { int i = rnd.next(1, N); println(1, i); } else { int x; if (rnd.next(0, 1) == 0) { // small move x = rnd.next(1, max(1, N * 3)); } else {

코드 #6374