# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422325 | timmyfeng | Toy Train (IOI17_train) | C++17 | 0 ms | 0 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;
const int N = 5000;
vector<int> to[N], from[N], a;
bool win[N], visited[N];
int degree[N], n, m;
void bfs() {
queue<int> que;
for (int i = 0; i < n; ++i) {
degree[i] = 0;
if (visited[i]) {
que.push(i);
}
}
while (!que.empty()) {
int u = que.front();
que.pop();
for (auto c : from[u]) {
if (!visited[c]) {
if (a[c] == 1 || ++degree[c] == (int) to[c].size()) {
visited[c] = true;
que.push(c);
}
}
}
}
}