# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
577171 | HIR180 | Toy Train (IOI17_train) | C++17 | 436 ms | 1700 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;
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
int n = a.size();
vector<int> res(n);
vector<vector<int>>edge(n), redge(n);
rep(i, u.size()){
edge[u[i]].pb(v[i]);
redge[v[i]].pb(u[i]);
}
while(1){
vector<int>zan(n), ok(n), in(n);
rep(i, n) ok[i] = edge[i].size();
queue<int>que;
vector<int>frst(n);
int idx = 0;
rep(i, n) if(r[i]){
que.push(i);
frst[i] = 1;
idx++;
}
while(!que.empty()){
int q = que.front(); que.pop();
idx--;
if(idx < 0 and in[q] and frst[q]) continue;
for(auto ot:redge[q]){
ok[ot] --;
if(!in[ot] and (!ok[ot] or a[ot])){
que.push(ot);
in[ot] = 1;
}
}
}
bool upd = 0;
rep(i, n){
if(r[i] and !in[i]){
r[i] = 0;
upd = 1;
}
}
if(!upd){
rep(i, n) res[i] = in[i];
return res;
}
}
}
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... |