# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
357765 | parsabahrami | Railway (BOI17_railway) | C++17 | 166 ms | 28012 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.
// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
const int N = 1e5 + 10;
int tim, n, m, k, St[N], Ft[N], P[19][N], H[N], from[N], to[N], ps[N]; vector<int> adj[N], R;
void preDFS(int v, int p = -1) {
if (!~p) P[0][v] = v;
St[v] = tim++;
for (int i = 1; i < 19; i++) P[i][v] = P[i - 1][P[i - 1][v]];
for (int id : adj[v]) {
int u = from[id] ^ to[id] ^ v;
if (u != p) {
H[u] = H[v] + 1;
P[0][u] = v;
preDFS(u, v);
}
}
Ft[v] = tim;
}
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... |