# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
593302 | AlperenT | Toy Train (IOI17_train) | C++17 | 5 ms | 852 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "train.h"
using namespace std;
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v){
int n = a.size();
vector<bool> isself(n), isnext(n);
for(int i = 0; i < u.size(); i++){
if(u[i] == v[i]) isself[u[i]] = true;
else if(u[i] + 1 == v[i]) isnext[u[i]] = true;
}
vector<int> ans(n);
for(int i = n - 1; i >= 0; i--){
if(a[i]){
if(isself[i] && r[i]) ans[i] = true;
if(isnext[i] && ans[i + 1]) ans[i] = true;
}
else{
ans[i] = true;
if(isself[i] && !r[i]) ans[i] = false;
if(isnext[i] && !ans[i + 1]) ans[i] = false;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |