Submission #409795

#TimeUsernameProblemLanguageResultExecution timeMemory
409795dreezyToy Train (IOI17_train)C++17
0 / 100
8 ms716 KiB
#include <bits/stdc++.h> using namespace std; vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u , vector<int> v){ int n = a.size(); int m = u.size(); vector<int > w(n); vector<int> iscycle(n, 0); for(int i =0; i< m; i++){ if(u[i] == v[i]){ iscycle[i] = true; } } for(int i =0; i< n; i++){ int winner = 0; int energy = n; int curstation = i; while(curstation < n){ if(a[i] && iscycle[i] && r[i]){//arezou owns winner = 1; break; } else if(!a[i] && iscycle[i] && !r[i] ){ winner = 0; break; } if(energy == 0){ winner = 0; break; } energy--; curstation++; } for(i = i; i<= min(curstation, n-1); i++){ w[i] = winner; } } return w; }
#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...