# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434258 | Monchito | Toy Train (IOI17_train) | C++14 | 2076 ms | 1356 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 <algorithm>
using namespace std;
const int MAXN = 5e3;
int n, m;
int G[MAXN];
bool vis[MAXN];
void DFS(int u, int& ret, vector<int>& r) {
vis[u] = true;
if(G[u] == u) {
ret = (r[u]==1)? 1 : 0;
return;
}
DFS(G[u], ret, r);
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
n = (int)a.size();
m = (int)u.size();
vector<vector<int>> graph(n);
vector<pair<int,int>> edges(m);
for(int i=0; i<m; i++)
edges[i] = make_pair(u[i], v[i]);
sort(edges.begin(), edges.end());
for(int i=0; i<m; i++)
graph[edges[i].first].push_back(edges[i].second);
for(int i=0; i<n; i++) {
if((int)graph[i].size() == 1) { G[i] = graph[i][0]; continue; }
if(a[i] == 1)
(r[i]==1)? G[i] = graph[i][0] : G[i] = graph[i][1];
else
(r[i]==1)? G[i] = graph[i][1] : G[i] = graph[i][0];
}
int current;
vector<int> ans(n);
for(int i=0; i<n; i++) {
if(!vis[i]) {
DFS(i, current, r);
}
ans[i] = current;
}
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... |