# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
269528 | khsoo01 | Toy Train (IOI17_train) | C++11 | 443 ms | 1656 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<bits/stdc++.h>
using namespace std;
const int N = 5005;
int n, deg[N], cur[N];
vector<int> adj[N], rev[N];
bool z[N];
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
vector<int> res;
for(int i=0;i<(int)u.size();i++) {
adj[u[i]].push_back(v[i]);
rev[v[i]].push_back(u[i]);
deg[u[i]]++;
}
n = a.size();
for(int i=0;i<n;i++) {
z[i] = r[i];
}
while(true) {
queue<int> q;
res.clear();
for(int i=0;i<n;i++) {
cur[i] = 0;
res.push_back(z[i]);
if(z[i]) q.push(i);
}
while(!q.empty()) {
# | 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... |