Submission #1021426

#TimeUsernameProblemLanguageResultExecution timeMemory
1021426MarwenElarbiToy Train (IOI17_train)C++17
5 / 100
5 ms860 KiB
#include <bits/stdc++.h> #include "train.h" #include <cstdio> #include <vector> #include <cassert> using namespace std; std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v){ int n=a.size(); int m=u.size(); bool win[n]; bool to[n]; memset(to,0,sizeof to); memset(win,0,sizeof win); for (int i = 0; i < m; ++i) { if(u[i]==v[i]){ win[u[i]]=true; }else to[u[i]]=true; } vector<int> ans(n,0); for (int i = n-1; i >=0; --i) { //cout <<win[i]<<" "<<a[i]<<endl; if(r[i]&&a[i]&&win[i]) ans[i]=1; else if(!r[i]&&!a[i]&&win[i]) ans[i]=0; else if(!r[i]&&!to[i]) ans[i]=0; else if(r[i]&&!to[i]) ans[i]=1; else ans[i]=ans[i+1]; } 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...