# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823219 | mindiyak | Toy Train (IOI17_train) | C++14 | 2057 ms | 724 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"
#include <queue>
#include <iostream>
using namespace std;
vector<int> chargers;
vector<int> looped(1e4,0);
vector<int> can_move(1e4,0);
int N;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
N=a.size();
for (int i = 0; i < u.size(); i++){
if(u[i] == v[i])looped[u[i]]=1;
if(u[i]+1 == v[i])can_move[u[i]]=1;
}
vector<int> ans(N,0);
ans[N-1] = r[N-1] && looped[N-1];
for(int i=N-2;i>=0;i--){
if(r[i] && looped[i]){
if(a[i])ans[i]=1;
else{if(!can_move[i])ans[i]=1;}
}
if(can_move[i] and ans[i] == 0){
int pos = i+1;
int can = 0;
while(pos < N){
if(can == 1)break;
if(r[pos] && looped[pos]){
if(a[i])can = 1;
else{if(!can_move[i])can=1;}
}
}
if(can)ans[i] = 1;
}
}
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... |