# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134887 | amiratou | Toy Train (IOI17_train) | C++14 | 2062 ms | 26092 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> A,R;
int n;
vector<vector<int> > vec;
bool vis[5001][5002];
int dfs(int node,int e,int charge){
if(R[node])e=n,charge=1;
//cerr<<node<<" "<<e<<"\n";
if(!e)return 0;
//cerr<<vis[node][e]<<"\n";
if(vis[node][e])
return 1;
vis[node][e]=1;
for(auto child:vec[node]){
int ans=dfs(child,e-1,charge);
if(A[node]==ans)return ans;
}
return !A[node];
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
//cerr<<"\n----------\n";
A=a,R=r;
n=a.size();
vec.resize(a.size());
for (int i = 0; i < u.size(); ++i)
vec[u[i]].push_back(v[i]);
vector<int> res(n);
for (int i = 0; i < n; ++i){
memset(vis,0,sizeof vis);
res[i]=dfs(i,n,0);
//cerr<<"\n----------\n";
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |