# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116307 | nvmdava | Toy Train (IOI17_train) | C++17 | 828 ms | 1792 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;
vector<int> &a = *(new vector<int>), &r = *(new vector<int>), &u = *(new vector<int>), &v = *(new vector<int>);
int n, m;
vector<int> res, pos, to[5005], fr[5005];
bool in[5005], proc[5005];
int dem[5005];
queue<int> q;
void f(int st){
memset(in, 0, sizeof in);
memset(dem, 0, sizeof dem);
for(int i = 0; i < m; i++)
if(proc[u[i]] | proc[v[i]] == 0)
dem[u[i]]++;
while(!q.empty()){
int v = q.front();
q.pop();
if(in[v]) continue;
in[v] = 1;
for(int x : fr[v]){
if(proc[x]) continue;
dem[x]--;
if(in[x]) continue;
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... |