# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641883 | piOOE | Toy Train (IOI17_train) | C++17 | 533 ms | 1652 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>
#include "train.h"
using namespace std;
constexpr int N = 5000;
vector<int> rev[N], g[N], a;
int n;
void bfs(vector<int> &used, int player) {
vector<int> degree(n);
queue<int> q;
for (int i = 0; i < n; ++i) {
if (used[i]) {
q.push(i);
}
}
while (!q.empty()) {
int v = q.front();
q.pop();
for (int to: rev[v]) {
if (!used[to] && (a[to] == player || ++degree[to] == g[to].size())) {
used[to] = true;
q.push(to);
}
}
}
}
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> A, std::vector<int> B) {
::a = a;
n = a.size();
for (int i = 0; i < A.size(); ++i) {
g[A[i]].push_back(B[i]);
rev[B[i]].push_back(A[i]);
}
bool found = true;
while (found) {
found = false;
vector<int> used = r;
bfs(used, 1);
for (int &i: used) {
i ^= 1;
}
bfs(used, 0);
for (int i = 0; i < n; ++i) {
if (r[i] == 1 && used[i]) {
r[i] = 0;
found = true;
}
}
}
vector<int> ans = r;
bfs(ans, 1);
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... |