# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
219585 | socho | Railway (BOI17_railway) | C++14 | 237 ms | 46952 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 "bits/stdc++.h"
using namespace std;
// #define int long long
int n, m, k;
const int MXN = 300005;
vector<int> adj[MXN];
int st_start[MXN];
int st_end[MXN];
int at = 0;
int adder[MXN];
void dfs_tr(int node, int last) {
st_start[node] = at;
at++;
for (int i=0; i<adj[node].size(); i++) {
int x = adj[node][i];
if (x == last) continue;
dfs_tr(x, node);
}
st_end[node] = at;
at++;
}
const int MXK = 20;
int depth[MXN];
int par[MXN][MXK];
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... |