#include<bits/stdc++.h>
#include "coprobber.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
vector<int>adj[500];
vector<int>used(500),p(500);
int cur=0,f=0;
void dfs(int u){
used[u]=1;
for(auto v:adj[u]){
if(used[v]==0){
p[v]=u;
dfs(v);
}
}
}
int start(int N,bool a[500][500]){
int cnt=0;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(i==j) continue;
if(a[i][j]==true){
adj[i].pb(j);
cnt++;
}
}
}
dfs(0) ;
if(cnt!=2*(N-1)){
return -1;
}
return 0;
}
int nextMove(int r){
if(p[r]==cur){
return cur;
}
while(p[r]!=cur){
r=p[r];
}
return cur=r;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
29 ms |
1836 KB |
Output is correct |
5 |
Correct |
8 ms |
1052 KB |
Output is correct |
6 |
Correct |
29 ms |
1608 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Cop can catch the robber, but start() returned -1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Incorrect |
0 ms |
344 KB |
Cop can catch the robber, but start() returned -1 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
29 ms |
1836 KB |
Output is correct |
5 |
Correct |
8 ms |
1052 KB |
Output is correct |
6 |
Correct |
29 ms |
1608 KB |
Output is correct |
7 |
Incorrect |
0 ms |
344 KB |
Cop can catch the robber, but start() returned -1 |
8 |
Halted |
0 ms |
0 KB |
- |