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:T755,#include "testlib.h" #include using namespace std; /* Generator for "인구 이동" Produces one small but varied test case: - N in [2,7] - 1 ≤ L ≤ R ≤ 100 - A[r][c] in [0,100] - Adds some outliers or uniform patches based on a hyperparameter */ int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Grid size int N = rnd.next(2, 7); // Choose L and R int L = rnd.next(1, 50); int R = rnd.next(L, 100); // Hyperparameter: probability of creating an "outlier" cell double outlier_prob = rnd.next(0.0, 0.3); // Hyperparameter: probability of uniform blocks double block_prob = rnd.next(0.0, 0.5); // Prepare grid vector> A(N, vector(N)); // Optionally fill one random block with similar values if (rnd.next() < block_prob) { // block size 2×2 or 3×3 if fits int bs = min(N, rnd.next(2, 3)); int br = rnd.next(0, N - bs); int bc = rnd.next(0, N - bs); int base = rnd.next(0, 100); for (int i = 0; i < bs; i++) { for (int j = 0; j < bs; j++) { A[br + i][bc + j] = base + rnd.next(-5, 5); A[br + i][bc + j] = max(0, min(100, A[br + i][bc + j])); } } } // Fill the rest for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (A[i][j] == 0 && rnd.next() < outlier_prob) {

코드 #2336