# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
691782 | piOOE | Prize (CEOI22_prize) | C++17 | 2905 ms | 660124 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 int64_t
void massert(bool f) {
while (!f) {
cout << "hell nah" << endl;
}
}
struct Tree {
vector<int> tin, tout, par;
vector<vector<int>> jump;
int logn;
void init(vector<vector<int>> adj, int root) {
int n = adj.size();
tin.resize(n), tout.resize(n), par.assign(n, -1);
int T = 0;
function<void(int)> dfs = [&](int v) {
tin[v] = T++;
for (int to : adj[v]) {
massert(par[to] == -1);
par[to] = v;
dfs(to);
}
tout[v] = T;
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... |