# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398950 | 2021-05-04T22:51:40 Z | shrimb | Cop and Robber (BOI14_coprobber) | C++17 | 163 ms | 262148 KB |
#include "coprobber.h" #include "bits/stdc++.h" using namespace std; vector<int> adj[501]; int cur = 0, nig; int start(int N, bool A[MAX_N][MAX_N]) { for (int i = 0 ; i < N ; i++) { for (int j = 0 ; j < N ; j++) { if (A[i][j]) adj[i].push_back(j); } } return 0; } bool check (int c, int p) { bool res = 0; for (int i : adj[c]) { if (i == nig) return 1; res |= check(i, c); } return res; } int nextMove(int R) { nig = R; for (int i : adj[cur]) { if (i == R || check(i, cur)) return cur = i; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Runtime error | 158 ms | 262148 KB | Execution killed with signal 9 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 163 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Runtime error | 145 ms | 262148 KB | Execution killed with signal 9 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Runtime error | 158 ms | 262148 KB | Execution killed with signal 9 |
4 | Halted | 0 ms | 0 KB | - |