# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
822872 | mindiyak | Toy Train (IOI17_train) | C++14 | 5 ms | 1236 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 "train.h"
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();
vector<vector<int>> paths(n,vector<int> ());
for (int i = 0; i < u.size(); i++){
paths[u[i]].push_back(v[i]);
}
vector<int> ans(n,-1);
if(r[n-1] == 0)ans[n-1]=0;
for(int i=n-2;i>=0;i--){
int win = 1;
for(int j:paths[i]){
if(j==i){
if(r[i] != 1){
win = (a[i]==1) ? (win|0) : (win&0);
}
}else if(j==i+1){
win = (a[i]==1) ? (win|ans[i+1]) : (win&ans[i+1]);
}
}
ans[i] = win;
}
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... |