# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
781009 | Josia | Stations (IOI20_stations) | C++17 | 749 ms | 824 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> pre;
vector<int> post;
vector<vector<int>> graph;
vector<int> depth;
int tim;
void dfs(int v, int d) {
if (pre[v] != -1) return;
pre[v] = tim++;
depth[v] = d;
for (int i: graph[v]) {
dfs(i, d+1);
}
post[v] = tim++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
tim = 0;
pre.assign(n, -1);
post.assign(n, -1);
depth.assign(n, -1);
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... |