# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
425922 |
2021-06-13T12:24:14 Z |
Hazem |
Toy Train (IOI17_train) |
C++14 |
|
1555 ms |
1460 KB |
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3+10;
vector<int>adj[N],R,A;
unordered_set<int>st;
int cnt[N];
int n,m;
bool vis[N],ispar[N];
bool dfs(int i,int pre){
if(vis[i])
return 0;
ispar[i] = 1;vis[i] = 1;
cnt[i] = cnt[pre]+R[i];
bool ret = 0;
for(auto x:adj[i]){
ret |= dfs(x,i);
if(!ispar[x])
continue;
if(cnt[i]-cnt[x]+R[x]==0)ret = 1;
}
ispar[i] = 0;
return ret;
}
vector<int>ans,cmp;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
n = a.size(),m = u.size();
A = a;R = r;
for(int i=0;i<m;i++)
adj[u[i]].push_back(v[i]);
for(int i=0;i<n;i++){
ans.push_back(dfs(i,n+1));
memset(vis,0,sizeof(vis));
memset(cnt,0,sizeof(cnt));
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
269 ms |
1244 KB |
3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
224 ms |
1460 KB |
3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1133 ms |
1292 KB |
3rd lines differ - on the 1st token, expected: '1', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1555 ms |
1396 KB |
3rd lines differ - on the 2nd token, expected: '0', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
269 ms |
1244 KB |
3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |