# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747023 | danikoynov | Toy Train (IOI17_train) | C++14 | 1398 ms | 1404 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;
typedef long long ll;
const int maxn = 5010;
int n, m, a[maxn], r[maxn], cycle[maxn], nxt[maxn];
vector < int > g[maxn];
int tf, used[maxn];
void dfs(int v)
{
used[v] = 1;
for (int u : g[v])
{
if (!used[u])
{
dfs(u);
if (cycle[u])
cycle[v] = 1;
}
else
{
if (used[u] == 1)
{
cycle[v] = 1;
}
}
}
used[v] = 2;
}
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 ++)
a[i] = A[i];
for (int i = 0; i < n; i ++)
r[i] = R[i];
for (int i = 0; i < m; i ++)
{
g[U[i]].push_back(V[i]);
}
vector < int > res(n);
for (int i = 0; i < n; i ++)
{
for (int j = 0; j < n; j ++)
used[j] = 0, cycle[j] = 0;
dfs(i);
for (int j = 0; j < n; j ++)
if (cycle[j] && r[j])
res[i] = 1;
}
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... |