| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1334865 | veham | 장난감 기차 (IOI17_train) | C++20 | 3 ms | 836 KiB |
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
vi who_wins(vi a, vi r, vi u, vi v) {
vi S(a.size(),0);
vi G0(a.size(),0),G1 = G0;
for(int i = 0;i < u.size();i++) (u[i] == v[i] ? G0 : G1)[u[i]] = 1;
for(int i = a.size()-1;i>=0;i--){
S[i] = !a[i];
if(G0[i]) S[i] = r[i];
if(G1[i]){
if(a[i]) S[i] = max(S[i],S[i+1]);
else S[i] = min(S[i],S[i+1]);
}
}
return S;
}
| # | 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... | ||||
