# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1069876 | new_acc | Toy Train (IOI17_train) | C++14 | 10 ms | 6300 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>
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
const int N=1e5+10;
int t[N],t2[N],n,m,il[N];
vi graf[N],graf2[N];
bool byl[N];
vi who_wins(vi a,vi r,vi u,vi v) {
n=a.size(),m=u.size();
vi res(n,1);
for(int i=1;i<=n;i++) t[i]=a[i-1],t2[i]=r[i-1];
for(int i=1;i<=m;i++){
graf[u[i-1]+1].push_back(v[i-1]+1);
graf2[v[i-1]+1].push_back(u[i-1]+1);
}
for(int i=1;i<=n;i++) il[i]=graf[i].size();
vi curr;
for(int i=1;i<=n;i++){
if(t2[i]) curr.push_back(i),byl[i]=1;
}
for(int i=0;i<curr.size();i++){
int x=curr[i];
for(auto u:graf2[x]){
if(t[u]){
if(!byl[u]) curr.push_back(u);
byl[u]=1;
}else{
il[u]--;
if(il[u]==0 and !byl[u]){
byl[u]=1;
curr.push_back(u);
}
}
}
}
curr.clear();
for(int i=1;i<=n;i++){
if(!byl[i]){
curr.push_back(i);
res[i-1]=0;
}
il[i]=graf[i].size();
}
for(int i=0;i<curr.size();i++){
int x=curr[i];
for(auto u:graf2[x]){
if(!t[u]){
if(res[u-1]){
res[u-1]=0;
curr.push_back(u);
}
}else{
il[u]--;
if(il[u]==0 and !res[u-1]){
res[u-1]=0;
curr.push_back(u);
}
}
}
}
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... |