# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037516 | 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;
const int N = 5050;
vector<int> adj[N];
int n, m;
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]);
}
vector<int> ans(n);
ans[n - 1] = r[n - 1];
for (int i = n - 2;i >= 0;i--) {
if (a[i] == 0) { // Borzou
bool ch = 0;
for (auto& x : adj[i]) {
if (x == i && !r[i]) ch = 1;
else if (!ans[x]) ch = 1;
}
ans[i] = ch ^ 1;
}
else { // Arezou
bool ch = 0;
for (auto& x : adj[i]) {
if (x == i && r[i]) ch = 1
else if (ans[x]) ch = 1;
}
ans[i] = ch;
}
}
return ans;
}