#include "testlib.h" #include #include using namespace std; int N; vector> initial_pos; // Reads and checks an answer (either jury's or contestant's), simulates the moves, // ensures validity and that the end configuration has exactly one tank per row and column. // Returns the number of moves K. int readAns(InStream &stream) { // copy initial positions vector> pos = initial_pos; // occupancy grid vector> occ(N+1, vector(N+1, false)); for (int i = 0; i < N; i++) { int r = pos[i].first, c = pos[i].second; occ[r][c] = true; } // read K int K = stream.readInt(0, N * N, "K"); // simulate moves for (int step = 1; step <= K; step++) { int id = stream.readInt(1, N, format("move[%d].tank_id", step).c_str()); string ds = stream.readToken(format("move[%d].dir", step).c_str()); if (ds.size() != 1) { stream.quitf(_wa, "invalid direction token at move %d: '%s'", step, ds.c_str()); } char d = ds[0]; int dr = 0, dc = 0; if (d == 'L') dc = -1; else if (d == 'R') dc = +1; else if (d == 'U') dr = -1; else if (d == 'D') dr = +1; else { stream.quitf(_wa, "invalid direction at move %d: '%c'", step, d); } int oldr = pos[id-1].first; int oldc = pos[id-1].second; int newr = oldr + dr; int newc = oldc + dc; // check board bounds if (newr < 1 || newr > N || newc < 1 || newc > N) { stream.quitf(_wa, "move %d: tank %d moves out of board to (%d,%d)", step, id, newr, newc); } // check destination free if (occ[newr][newc]) { stream.quitf(_wa, "move %d: destination (%d,%d) is already occupied", step, newr, newc); } // apply move occ[oldr][oldc] = false; occ[newr][newc] = true; pos[id-1] = make_pair(newr, newc); } // check final configuration: exactly one tank per row and per column vector rowcnt(N+1, 0), colcnt(N+1, 0); for (int i = 0; i < N; i++) { int r = pos[i].first, c = pos[i].second; rowcnt[r]++; colcnt[c]++; } for (int i = 1; i <= N; i++) { if (rowcnt[i] == 0) { stream.quitf(_wa, "no tank in row %d after moves", i); } if (rowcnt[i] > 1) { stream.quitf(_wa, "multiple tanks in row %d after moves", i); } if (colcnt[i] == 0) { stream.quitf(_wa, "no tank in column %d after moves", i); } if (colcnt[i] > 1) { stream.quitf(_wa, "multiple tanks in column %d after moves", i); } } return K; } int main(int argc, char *argv[]) { registerTestlibCmd(argc, argv); // read test input N = inf.readInt(); initial_pos.resize(N); for (int i = 0; i < N; i++) { int r = inf.readInt(1, N); int c = inf.readInt(1, N); initial_pos[i] = make_pair(r, c); } // read and check jury and participant answers int jans = readAns(ans); int pans = readAns(ouf); // compare move counts: minimal is better if (pans > jans) { quitf(_wa, "jury has a better (smaller) move count: jury = %d, participant = %d", jans, pans); } else if (pans == jans) { quitf(_ok, "moves = %d", pans); } else { // participant found fewer moves than jury: unexpected quitf(_fail, "participant has better (smaller) move count than jury: jury = %d, participant = %d", jans, pans); } return 0; }

코드 #5781