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:T61c,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerTestlibCmd(argc, argv); // 입력 받기 int n = inf.readInt(1, 50, "n"); inf.readSpace(); int m = inf.readInt(1, 50, "m"); inf.readEoln(); // 초기 체스판 생성: (i + j) % 2 vector> board(n, vector(m)); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) board[i][j] = (i + j) % 2; // 참가자 출력 읽기 int k = ouf.readInt(0, n * m, "k"); ouf.readEoln(); for (int step = 0; step < k; ++step) { int r1 = ouf.readInt(1, n, "r1") - 1; ouf.readSpace(); int c1 = ouf.readInt(1, m, "c1") - 1; ouf.readSpace(); int r2 = ouf.readInt(1, n, "r2") - 1; ouf.readSpace(); int c2 = ouf.readInt(1, m, "c2") - 1; ouf.readEoln(); // 좌표 보정 int top = min(r1, r2), bottom = max(r1, r2); int left = min(c1, c2), right = max(c1, c2); // 반전 수행 for (int i = top; i <= bottom; ++i) for (int j = left; j <= right; ++j) board[i][j] ^= 1; // 색 반전 } // 모든 칸이 같은 색인지 확인 int color = board[0][0]; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (board[i][j] != color) quitf(_wa, "Not all cells are the same color af

코드 #6145