제출 #398900

#제출 시각아이디문제언어결과실행 시간메모리
398900shrimbCop and Robber (BOI14_coprobber)C++17
0 / 100
1 ms200 KiB
#include <iostream> using namespace std; #define MAX_N 500 int start(int N, bool A[MAX_N][MAX_N]) { return -1; } int nextMove(int R) { return R; } // // don't modify the main function // int main() { // int N; // cin >> N; // bool A[MAX_N][MAX_N]; // for (int i = 0; i < N; i++) { // for (int j = 0; j < N; j++) { // cin >> A[i][j]; // } // } // int P = start(N,A); // cout << P << endl; // int R; // cin >> R; // while (true) { // if (P == R) break; // P = nextMove(R); // cout << P << endl; // if (P == R) break; // cin >> R; // } // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...