# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428640 | vanic | Toy Train (IOI17_train) | C++14 | 0 ms | 0 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 <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn=5005;
int n, m;
vector < int > ms[maxn];
int charge[maxn];
bool tko[maxn];
bool bio[maxn];
vector < int > sol;
vector < int > put;
int poc;
int dfs(int x){
if(x==poc){
return 1;
}
if(bio[x]){
return sol[x];
}
bio[x]=1;
put.push_back(x);
for(int i=0; i<ms[x].size(); i++){
sol[x]|=dfs(ms[x][i]);
}
put.pop_back();
sad[x]=0;
}
vector < int > who_wins(vector < int > a, vector < int > r, vector < int > u, vector < int > v) {
n=a.size();
m=u.size();
for(int i=0; i<n; i++){
tko[i]=a[i];
charge[i]=r[i];
}
for(int i=0; i<m; i++){
ms[u[i]].push_back(v[i]);
}
sol.resize(n, 0);
for(int i=0; i<n; i++){
if(charge[i]){
poc=i;
dfs(i);
}
}
bool p=1;
while(p){
p=0;
for(int i=0; i<n; i++){
if(sol[i]){
continue;
}
for(int j=0; j<ms[i].size(); j++){
if(sol[ms[i][j]]){
sol[i]=1;
p=1;
break;
}
}
}
}
return sol;
}