# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64839 | mohammad_kilani | Toy Train (IOI17_train) | C++17 | 407 ms | 1964 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 = 5010;
vector< int > res , a , g[N] , r , g2[N];
int n , vis[N] , vi = 0 , last , out[N];
bool have[N];
void make(int node){
for(int i=0;i<g2[node].size();i++){
if(res[g2[node][i]] != -1) continue;
out[g2[node][i]]--;
if(a[g2[node][i]] == a[node]){
if(res[node] == a[node]){
res[g2[node][i]] = a[node];
make(g2[node][i]);
}
else{
if(out[g2[node][i]] == 0){
res[g2[node][i]] = a[node] ^ 1;
make(g2[node][i]);
}
}
}
else{
if(res[node] == a[node]){
if(out[g2[node][i]] == 0){
res[g2[node][i]] = a[node];
make(g2[node][i]);
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... |