# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037633 | thinknoexit | 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 "train.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
namespace Arezou {
const int N = 5050;
vector<int> adj[N], rev[N];
bool ans[N], vis1[N], vis2[N];
int n, m;
void dfs1(int v) {
for (auto& x : adj[v]) {
if (!vis1[x]) vis1[x] = 1, dfs1(x);
}
}
void dfs2(int v) {
for (auto& x : rev[v]) {
if (!vis2[x]) vis2[x] = 1, dfs2(x);
}
}
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 < m;i++) {
adj[_U[i]].push_back(_V[i]);
rev[_V[i]].push_back(_U[i]);
}
for (int i = 0;i < n;i++) {
if (!r[i]) continue;
memset(vis1, 0, sizeof vis1);
memset(vis2, 0, sizeof vis2);