# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823088 | mindiyak | 장난감 기차 (IOI17_train) | C++14 | 4 ms | 1364 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>
using namespace std;
vector<vector<int>> paths(1e4,vector<int> ());
vector<int> chargers;
vector<int> looped(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();
if(N==1){
return {r[0]};
}
for(int i=0;i<r.size();i++){if(r[i]==1){chargers.push_back(i);}}
for (int i = 0; i < u.size(); i++){
if(u[i] == v[i])looped[i]=1;
else paths[u[i]].push_back(v[i]);
}
vector<int> ans(N,0);
for(int i=0;i<N;i++){
if(r[i]=1){
if(a[i]==1 and looped[i])ans[i]=1;
if(a[i]==0 and looped[i] and paths[i].size() == 0)ans[i]=1;
}
if(i!=N-1 and r[i+1]==1 and paths[i].size()>0){
if(a[i+1]==1 and looped[i+1])ans[i]=1;
if(a[i+1]==0 and looped[i+1] and paths[i+1].size() == 0)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... |