# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422737 | schse | Toy Train (IOI17_train) | C++17 | 10 ms | 1368 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"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
struct node
{
vector<int> edges;
bool been;
bool charging = false;
bool owner;
bool winningpos = false;
};
vector<node> g;
bool rec(int n)
{
auto &[edges,
been,
charging,
owner,
winningpos] = g[n];
if (been)
return winningpos;
been = true;
if (edges.size() == 0)
return winningpos = charging;
return winningpos = rec(edges[0]);
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v)
{
std::vector<int> res(a.size());
g.resize(a.size());
for (int i = 0; i < a.size(); i++)
{
g[i].owner = a[i];
g[i].charging = r[i];
}
for (int i = 0; i < u.size(); i++)
{
if (g[u[i]].owner && g[u[i]].charging && u[i] == v[i])
g[v[i]].winningpos = true,
g[v[i]].been = true;
else if (!g[u[i]].owner && !g[u[i]].charging && u[i] == v[i])
g[v[i]].winningpos = false,
g[v[i]].been = true;
else if (u[i] == v[i])
{
}
else
g[u[i]].edges.push_back(v[i]);
}
for (int i = 0; i < (int)a.size(); i++)
res[i] = rec(i);
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... |