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:T77c,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // grid size int n = rnd.next(2, 10); int m = rnd.next(2, 10); // block probability hyper-parameter: sometimes heavy, sometimes light double p; if (rnd.next(0, 1) == 0) { // favor fewer blocks p = rnd.wnext(101, -2) / 100.0; } else { // favor more blocks p = rnd.wnext(101, 2) / 100.0; } // choose target position: sometimes center, sometimes corner, otherwise random int tx, ty; int mode = rnd.next(0, 3); if (mode == 0) { // center-ish tx = n / 2; ty = m / 2; } else if (mode == 1) { // corner int c = rnd.next(0, 3); tx = (c & 1) ? n - 1 : 0; ty = (c & 2) ? m - 1 : 0; } else { // anywhere tx = rnd.next(0, n - 1); ty = rnd.next(0, m - 1); } // build grid vector> a(n, vector(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (i == tx && j == ty) { a[i][j] = 2; } else { a[i][j] = (rnd.next() < p ? 0 : 1); } } } // ensure at least one neighbor of target is reachable static int dirs[4][2] = {{1,0},{-1,0},{0,1},{0,-1}}; vector> neigh; bool anyReachable = false; for

코드 #6186