# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227685 | AaronNaidu | Toy Train (IOI17_train) | C++14 | 2093 ms | 1408 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 <bits/stdc++.h>
using namespace std;
vector<int> a, r, f;
vector<int> graph[5000];
vector<bool> visited;
bool cycleTime(int node, int orig) {
if (r[node])
{
return true;
}
if (node == orig)
{
return false;
}
return cycleTime(f[node], orig);
}
bool doesAWin(int x) {
if (visited[x])
{
return cycleTime(f[x], x);
}
visited[x] = true;
bool toRet;
if (a[x])
{
toRet = false;
for (auto i : graph[x])
{
f[x] = i;
toRet = toRet or doesAWin(i);
f[x] = -1;
}
}
else
{
toRet = true;
for (auto i : graph[x])
{
f[x] = i;
toRet = toRet and doesAWin(i);
f[x] = -1;
}
}
visited[x] = false;
return toRet;
}
vector<int> who_wins(vector<int> la, vector<int> lr, vector<int> lu, vector<int> lv) {
a = la;
r = lr;
for (int i = 0; i < lu.size(); i++)
{
graph[lu[i]].push_back(lv[i]);
}
for (int i = 0; i < a.size(); i++)
{
f.push_back(-1);
visited.push_back(false);
}
vector<int> toRet;
for (int i = 0; i < a.size(); i++)
{
toRet.push_back(doesAWin(i));
}
return toRet;
}
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... |