# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428587 | vanic | Toy Train (IOI17_train) | C++14 | 2089 ms | 1568 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 dfs(int x){
if(bio[x]){
bool p=0;
for(int i=0; i<n; i++){
if(put[i]==x){
p=1;
}
if(p){
if(charge[put[i]]){
return 1;
}
}
}
return 0;
}
put.push_back(x);
bio[x]=1;
for(int i=0; i<ms[x].size(); i++){
if(dfs(ms[x][i])==tko[x]){
bio[x]=0;
put.pop_back();
return tko[x];
}
}
bio[x]=0;
put.pop_back();
return !tko[x];
}
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++){
sol[i]=dfs(i);
}
return sol;
}
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... |