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:T5bd,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameters for N and M bias int tN = rnd.next(-2, 2); int tM = rnd.next(-2, 2); int N = rnd.wnext(10, tN) + 1; // biases small or large depending on tN int M = rnd.wnext(10, tM) + 1; // biases small or large depending on tM // Prepare cards: exactly N*M A's and N*M B's int total = 2 * N * M; int half = N * M; vector cards; cards.reserve(total); for (int i = 0; i < half; i++) cards.push_back('A'); for (int i = 0; i < half; i++) cards.push_back('B'); shuffle(cards.begin(), cards.end()); // Assign to Alice and Bob vector alice(N, string(M, 'A')); vector bob(N, string(M, 'A')); for (int i = 0; i < N * M; i++) { alice[i / M][i % M] = cards[i]; bob[i / M][i % M] = cards[N * M + i]; } // Number of swap queries, small for hand-checkability int maxQ = min(20, total); int Q = rnd.next(1, maxQ); // Output println(N, M); for (int i = 0; i < N; i++) println(alice[i]); for (int i = 0; i < N; i++) println(bob[i]); println(Q); for (int i = 0; i < Q; i++) { int r1 = rnd.next(1, N); int c1 = rnd.next(1, M); int r2 = rnd.next(1, N); int c2 = rnd.next(1, M); println(r1, c1, r2, c2); } r

코드 #5356