# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
86782 | inom | Birthday gift (IZhO18_treearray) | C++14 | 1442 ms | 242552 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>
#define pb push_back
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma warning(disable : 4996)
const int N = 2 * 1e5 + 10;
int n, m, q;
int node[N];
vector<int> verr[N];
int l = 1, timer = 1;
int tin[N], tout[N];
int up[N][20];
set<int> lca[N], pos[N];
void dfs(int x, int pr = 1) {
tin[x] = timer; timer++;
up[x][0] = pr;
for (int i = 1; i <= l; i++) {
up[x][i] = up[up[x][i - 1]][i - 1];
}
for (auto i: verr[x]) {
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... |