# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794390 | firewater | Toy Train (IOI17_train) | C++14 | 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<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include <cassert>
#define ll long long
#define MX 20230
using namespace std;
int n,m,a[MX],c[MX],h[MX],H[MX];
struct rec
{
int to,nx;
}e[MX],E[MX];
void addl(int x,int y)
{
e[++tot].to=y;
e[tot].nx=h[x];
h[x]=tot;
return;
}
void addll(int x,int y)
{
E[tot].to=y;
E[tot].nx=H[x];
H[x]=tot;
return;
}
void dfs1(int x)
{
for(int i=h[x];i;i=e[i].nx){
int y=e[i].to;
if(p[y])continue;
dfs1(y);
}
ls.push_back(i);
return;
}
void dfs2(int x,int p)
{
fr[x]=p;
for(int i=H[x];i;i=E[i].nx){
int y=E[i].to;
if(fr[y])continue;
dfs2(y,p);
}
return;
}
void dfs3(int x)
{
cc[fr[x]]=1;
for(int i=H[x];i;i=E[i].nx){
int y=E[i].to;
if(cc[fr[y]])continue;
dfs3(y);
}
return;
}
std::vector<int> who_wins(std::vector<int> A, std::vector<int> C, std::vector<int> U, std::vector<int> V) {
std::vector<int> ans(A.size());
n=A.size();
m=U.size();
for(int i=1;i<=n;++i){
a[i]=A[i-1];
c[i]=C[i-1];
}
for(int i=0;i<m;++i){
addl(U[i]+1,V[i]+1);
addll(V[i]+1,U[i]+1);
}
for(int i=1;i<=n;++i)
p[i]=0;
for(int i=1;i<=n;++i)
if(!p[i])
dfs1(i);
reverse(ls.begin(),ls.end());
for(int i=0;i<ls.size();++i)
if(!fr[ls[i]])
dfs2(ls[i],++w);
for(int i=1;i<=n;++i)
if(c[i])
cc[fr[i]]=1;
for(int i=1;i<=n;++i)
if(cc[fr[i]])
dfs3(i);
for(int i=1;i<=n;+=i)
ans[i-1]=cc[fr[i]];
return ans;
}