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:T6ee,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small grid dimensions int R = rnd.next(1, 5); int C = rnd.next(2, 10); int T = R * C; int maxBroken = min(T, 10); // Decide how many broken cells, ensure at least 2 for one horizontal tile // Bias broken count with wnext: t = -1 (favor small), 0 (uniform), 1 (favor large) vector ts = {-1, 0, 1}; int t = rnd.any(ts); // rnd.wnext(hi, t) gives in [0, hi-1], so hi = maxBroken-1 yields [0, maxBroken-2] int brokenBase = rnd.wnext(maxBroken - 1, t); int brokenCount = brokenBase + 2; if (brokenCount > maxBroken) brokenCount = maxBroken; // We must embed a horizontal chain of length >=2 int chainLenMax = min(C, brokenCount); int chainLen = rnd.next(2, chainLenMax); set> broken; // Place the guaranteed horizontal chain int row0 = rnd.next(1, R); int startC = rnd.next(1, C - chainLen + 1); for (int i = 0; i < chainLen; i++) { broken.insert({row0, startC + i}); } // Add extra broken cells randomly while ((int)broken.size() < brokenCount) { int rr = rnd.next(1, R); int cc = rnd.next(1, C); broken.insert({rr, cc}); } // Build undamaged cells (the input lists undamaged) vector> und; for (int i = 1; i <= R;

코드 #4475