제출 #671531

#제출 시각아이디문제언어결과실행 시간메모리
671531coding_snorlax장난감 기차 (IOI17_train)C++14
11 / 100
1300 ms1540 KiB
#include<bits/stdc++.h> #include "train.h" using namespace std; #define pb push_back int vis[5005]={0}; vector<int> answer; vector<int> G[5005]; int charge[5005]={0}; int flag=0; int flag2=0; void dfs(int node,int start){ vis[node]=1; if(charge[node]) flag=1; for(int i:G[node]){ if(i==start) flag2=1; if(!vis[i]) dfs(i,start); } } vector<int> who_wins(vector<int> a,vector<int> r,vector<int> u,vector<int> v){ for(int i=0;i<(int)r.size();i++){ charge[i]=r[i]; } for(int i=0;i<(int)u.size();i++){ G[u[i]].push_back(v[i]); } for(int i=0;i<(int)a.size();i++){ flag2=0; for(int j=0;j<(int)a.size();j++){ vis[j]=0; } if(charge[i]) dfs(i,i); if(!flag2) charge[i]=0; } for(int i=0;i<(int)a.size();i++){ flag=0; for(int j=0;j<(int)a.size();j++){ vis[j]=0; } dfs(i,0); if(flag) answer.pb(1); else answer.pb(0); } return answer; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...