Submission #1252576

#TimeUsernameProblemLanguageResultExecution timeMemory
1252576aren_danceToy Train (IOI17_train)C++20
0 / 100
156 ms1412 KiB
#include <bits/stdc++.h> #include "train.h" using namespace std; const int N=5001; vector<int> g[N]; bool vis[N]; bool f[N]; bool dfs(int node){ vis[node]=1; for(auto i:g[node]){ if(vis[i] && f[i]){ return 1; } if(!vis[i]){ if(dfs(i)){ return 1; } } } return 0; } vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) { int n=a.size(); int m=u.size(); for(int i=0;i<m;++i){ g[u[i]].push_back(v[i]); } for(int i=0;i<n;++i){ f[i]=r[i-1]; } if(a[0]){ vector<int> answ; for(int i=0;i<n;++i){ for(int j=0;j<n;++j){ vis[j]=0; } answ.push_back(dfs(i)); } return answ; } return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...