# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
398867 | 2021-05-04T21:33:27 Z | almothana05 | 경찰관과 강도 (BOI14_coprobber) | C++14 | 3 ms | 4168 KB |
#include "coprobber.h" #include<iostream> #include<vector> using namespace std; int menge = 0 , jet = 0; vector<vector<bool> >num; vector<int>vis(1000000 , 0); int start(int N, bool A[MAX_N][MAX_N]) { for(int i = 0 ;i < N ; i++){ num.push_back(vector<bool>()); for(int j = 0 ; j < N ; j++){ num[i].push_back(A[i][j]); } } menge = N; return 0; } int nextMove(int R) { if(num[jet][R] == 1){ return R; } else{ for(int i = 0 ; i < menge ; i++){ if(vis[i] == 0 && num[jet][i] == 1){ vis[i] = 1; return i; } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4168 KB | Output is correct |
2 | Correct | 2 ms | 4168 KB | Output is correct |
3 | Incorrect | 3 ms | 4168 KB | nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4168 KB | nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4168 KB | Output is correct |
2 | Correct | 3 ms | 4168 KB | Output is correct |
3 | Incorrect | 3 ms | 4168 KB | nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4168 KB | Output is correct |
2 | Correct | 2 ms | 4168 KB | Output is correct |
3 | Incorrect | 3 ms | 4168 KB | nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one |
4 | Halted | 0 ms | 0 KB | - |