# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841727 | hoanghq2004 | Dynamic Diameter (CEOI19_diameter) | C++17 | 247 ms | 51680 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;
const int N = 1e5 + 10;
int n, q;
vector <pair <int, long long>> g[N];
int a[N], in[N], out[N], ti, euler[N * 3];
long long d[N];
void dfs(int u, int p) {
in[u] = ++ti;
euler[ti] = u;
for (auto [v, w]: g[u]) {
if (v == p) continue;
d[v] = d[u] + w;
dfs(v, u);
euler[++ti] = u;
}
out[u] = ti;
}
struct node {
long long mx, mn;
long long uw, wv;
long long uwv;
long long lazy;
node operator + (const node& other) const {
node ret;
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... |