# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
822928 | mindiyak | Toy Train (IOI17_train) | C++14 | 2065 ms | 262144 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"
using namespace std;
vector<vector<int>> paths(1e4,vector<int> ());
vector<int> chargers;
// vector<int> cost(1e4,-1);
int loop = 0;
int n;
void dfs(int pos,int start,int coins,int charging){
if(loop==1)return;
if(chargers[pos] == 1){
charging = 1;
coins = n;
}
if(pos==start and charging==1){loop = 1;}
coins--;
if(coins <= 0)return;
for(int a:paths[pos]){
dfs(a,start,coins,charging);
}
}
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
n=a.size();
chargers = a;
for (int i = 0; i < u.size(); i++){
paths[u[i]].push_back(v[i]);
}
vector<int> ans(n,-1);
for (int i = 0; i < u.size(); i++){
loop = 0;
dfs(i,i,n,chargers[i]);
ans[i] = loop;
}
return ans;
}
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... |