# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398945 | shrimb | 경찰관과 강도 (BOI14_coprobber) | C++17 | 151 ms | 262148 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include"bits/stdc++.h"
using namespace std;
#define MAX_N 500
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;
}
}
// 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;
// }
// }
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |