# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1157321 | PagodePaiva | Toy Train (IOI17_train) | C++20 | 1201 ms | 2408 KiB |
#include "train.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 5010;
vector <int> g[N];
int n;
int h[N], dp[N], tout[N];
bool on[N], typ[N], mark[N];
vector <int> backedge[N];
vector <int> dfs_tree[N];
vector <int> aux[N];
void dfs(int v, int p){
mark[v] = 1;
for(auto x : g[v]){
if(mark[x] and !tout[x]){
backedge[v].push_back(x);
continue;
}
else if(mark[x] and tout[x]){
aux[v].push_back(x);
continue;
}
dfs_tree[v].push_back(x);
h[x] = h[v]+1;
dp[x] = dp[v];
if(on[x]) dp[x] = x;
dfs(x, v);
# | 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... |