| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1218745 | mariza | Toy Train (IOI17_train) | C++20 | 3 ms | 840 KiB |
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=5000;
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
ll n=a.size(), m=u.size();
bool g[n][2]={};
for(ll i=0; i<m; i++){
if(u[i]==v[i]) g[u[i]][0]=1;
else g[u[i]][1]=1;
}
vector<int> ans(n,0);
for(ll i=n-1; i>=0; i--){
if(g[i][0] && g[i][1]){
if(a[i]){
if(r[i]) ans[i]=1;
else ans[i]=ans[i+1];
}
else{
if(r[i]) ans[i]=ans[i+1];
else ans[i]=0;
}
}
else if(g[i][0]){
if(r[i]) ans[i]=1;
else ans[i]=0;
}
else ans[i]=ans[i+1];
}
return ans;
}
| # | 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... | ||||
