Submission #884391

#TimeUsernameProblemLanguageResultExecution timeMemory
884391abcvuitunggioToy Train (IOI17_train)C++17
0 / 100
2053 ms1884 KiB
#include "train.h" #include <bits/stdc++.h> using namespace std; vector <int> ke[5001],ke2[5001],ke3[5001],d,A,R; int n,m,vis[5001],p[5001],sz[5001],ch[5001]; stack <int> st; queue <int> q; int f(int u){ if (A[u]){ if (ch[u]&&R[u]) return 1; return f(ke[u][0]); } if (ch[u]&&!R[u]) return 0; return f(ke[u][0]); } vector <int> who_wins(vector <int> a, vector <int> r, vector <int> u, vector <int> v){ A=a,R=r,n=a.size(),m=u.size(); for (int i=0;i<m;i++){ if (u[i]==v[i]) ch[u[i]]=1; ke3[v[i]].push_back(u[i]); ke[u[i]].push_back(v[i]); ke2[v[i]].push_back(u[i]); } for (int i=0;i<n;i++) d.push_back(f(i)); return d; }
#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...