# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
246435 | alrad | Putovanje (COCI20_putovanje) | C++17 | 139 ms | 26712 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 all(x) x.begin(), x.end()
const int N = 2e5 + 2;
const int LOG = 19;
int L = 1 , timer = 0;
int tin[N] , tout[N] , c[N] , d[N];
int up[N][LOG] , cnt[N] , p[N] , dp[N];
vector<vector<pair<int , int> > > g(N , vector<pair<int , int> >());
void dfs1(int v , int p = 1) {
tin[v] = ++timer;
up[v][0] = p;
for (int i = 1; i <= L; i++) {
up[v][i] = up[up[v][i - 1]][i - 1];
}
for (auto e : g[v]) {
int to = e.first;
int pos = e.second;
if (to != p) {
dfs1(to , v);
}
}
tout[v] = ++timer;
}
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... |