| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 143652 | HIR180 | 장난감 기차 (IOI17_train) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<int>edge[5005],redge[5005];
int cnt[5005];
bool used[5005];
bool solve_one(vector<int>a,int V,vector<int>u,vector<int>v){
/* int cntt = 0;
rep(i,r.size()) cntt += r[i];
if(cntt != 1) return vector<int>();
int V;
rep(i,r.size()) if(r[i]) V = i;
//cout << V << endl;*/
rep(i,5005){
edge[i].clear();
redge[i].clear();
cnt[i] = used[i] = 0;
}
rep(i,u.size()){
edge[u[i]].pb(v[i]);
redge[v[i]].pb(u[i]);
cnt[u[i]]++;
}
queue<int>que; used[V] = 1;
rep(i,redge[V].size()){
int to = redge[V][i]; //cout << to << endl;
if(a[to] == 1) que.push(to);
else{
cnt[to]--;
if(cnt[to] == 0) que.push(to);
}
}
bool ok = 0;
while(!que.empty()){
int q = que.front(); que.pop(); //cout << q << endl;
if(q == V) ok = 1;
if(used[q]) continue; used[q] = 1;
rep(i,redge[q].size()){
int to = redge[q][i];
if(a[to] == 1) que.push(to);
else{
cnt[to]--;
if(cnt[to] == 0) que.push(to);
}
}
}
return ok;
/*if(!ok){
vector<int>ret; rep(i,a.size()) ret.pb(0);
return ret;
}
else{
vector<int>ret; rep(i,a.size()) if(!used[i]) ret.pb(0);else ret.pb(1);
return ret;
}*/
}
bool have[5005];
vector<int>who_wins(vector<int>a,vector<int>r,vector<int>u,vector<int>v){
rep(i,r.size()){
if(r[i] == 1){
have[i] = 1;
}
}
queue<int>A_win;
rep(i,r.size()){
if(!have[i]) continue;
vector<int>U,V;
rep(j,u.size()){
if(u[j] != i && have[u[j]]) continue;
if(v[j] != i && have[v[j]]) continue;
U.pb(u[j]);
V.pb(v[j]);
}
bool flag = solve_one(a,i,U,V);
if(flag) A_win.push(i);
}
rep(i,5005){
edge[i].clear();
redge[i].clear();
cnt[i] = used[i] = 0;
}
rep(i,u.size()){
edge[u[i]].pb(v[i]);
redge[v[i]].pb(u[i]);
cnt[u[i]]++;
}
while(!A_win.empty()){
int q = A_win.front(); A_win.pop();
if(used[q]) continue; used[q] = 1;
rep(i,redge[q].size()){
int to = redge[q][i];
if(a[to] == 1) A_win.push(to);
else{
cnt[to]--;
if(cnt[to] == 0) A_win.push(to);
}
}
}
vector<int>ret; rep(i,a.size()) if(!used[i]) ret.pb(0);else ret.pb(1);
return ret;
}
int main(){
vector<int>a,r,u,v;
int n,m;
cin>>n>>m;
rep(i,n) {int x;cin>>x;a.pb(x);}
rep(i,n) {int x;cin>>x;r.pb(x);}
rep(i,m) {int x,y;cin>>x>>y;u.pb(x);v.pb(y);}
auto A = who_wins(a,r,u,v);
rep(i,n) cout << A[i] << endl;
}