| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1362117 | maya_s | 장난감 기차 (IOI17_train) | C++20 | 2 ms | 836 KiB |
#include "train.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
ll n = a.size(), m = u.size();
vector<bool> self_loop(n), next_connection(n);
for(ll i = 0; i < m; i++){
if(u[i] == v[i]) self_loop[u[i]] = 1;
else next_connection[u[i]] = 1;
}
vector<ll> ans(n); ans[n-1] = r[n-1];
for(ll i = n-2; i >= 0; i--) {
if(!self_loop[i]) {ans[i] = ans[i+1]; continue;}
if(a[i]) ans[i] = r[i] || (next_connection[i] && ans[i+1]);
}
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
