# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125654 | tuannm | Grapevine (NOI22_grapevine) | C++20 | 1868 ms | 84172 KiB |
#include<bits/stdc++.h>
#define ii pair<int, int>
#define ll pair<long long, long long>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int mod[2] = {1000000007, 998244353};
const int N = 1e5 + 1;
const string NAME = "";
int n, q;
vector<ii> adj[N];
int lg[2 * N], euler[19][2 * N], tin[N], tout[N], EulerTourTraversal;
void DFS_EulerTour(int u = 1, int p = 0){
tin[u] = ++EulerTourTraversal;
euler[0][EulerTourTraversal] = u;
for(auto [v, w] : adj[u]){
if(v == p)
continue;
DFS_EulerTour(v, u);
euler[0][++EulerTourTraversal] = u;
}
tout[u] = EulerTourTraversal;
}
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... |