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;
vector<vector<int>> graph;
vector<bool> own;
vector<bool> station;
vector<bool> vis;
void dfs(int v) {
assert(own[v]);
if (vis[v]) return;
vis[v] = 1;
for (int i: graph[v]) {
dfs(i);
}
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
int n = a.size();
graph.assign(n, vector<int>());
for (int i = 0; i<(int)u.size(); i++) {
graph[u[i]].push_back(v[i]);
}
own.resize(n);
station.resize(n);
for (int i = 0; i<n; i++) {
own[i] = a[i];
station[i] = r[i];
}
vector<int> res(n, 1);
for (int i = 0; i<n; i++) {
vis.assign(n, 0);
dfs(i);
for (int j = 0; j<n; j++) {
if (station[j] && vis[j]) res[i] = 0;
}
}
return res;
}
# | 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... |