Submission #296078

#TimeUsernameProblemLanguageResultExecution timeMemory
296078DovranToy Train (IOI17_train)C++11
0 / 100
8 ms1536 KiB
#include <bits/stdc++.h> #include "train.h" #define N 20009 #define pii pair <int, int> #define ff first #define ss second #define sz() size() #define pb push_back #define ll long long using namespace std; bool v[N]; vector<int>ans; std::vector<int> who_wins(std::vector<int>o, std::vector<int>p, std::vector<int>u, std::vector<int>v){ int n=o.sz(); int m=u.sz(); vector<int>e[N]; int c[N]; for(int i=0; i<m; i++){ e[u[i]].pb(v[i]); if(u[i]==v[i]) c[u[i]]=1; } for(int i=0; i<n; i++){ if(p[i] and o[i] and c[i]) v[i]=1; if(v[i]) ans.pb(1); else ans.pb(0); } return ans; }
#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...