# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113021 | gs14004 | Toy Train (IOI17_train) | C++17 | 761 ms | 1536 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;
int n, m;
vector<int> gph[5005];
vector<int> proc;
vector<int> always(vector<int> &a, vector<int> &v, int winner){
vector<int> deg(n);
queue<int> que;
for(int i=0; i<n; i++){
if(proc[i]) continue;
for(auto &j : gph[i]){
if(!proc[j]) deg[j]++;
}
}
for(auto &i : v){
if(deg[i] > 0){
deg[i] = 0;
}
que.push(i);
}
vector<int> ret;
while(!que.empty()){
int x = que.front(); que.pop();
ret.push_back(x);
for(auto &i : gph[x]){
if(proc[i]) continue;
if(a[i] == winner && deg[i] > 0){
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... |