# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856237 | mbfibat | Dynamic Diameter (CEOI19_diameter) | C++17 | 116 ms | 35528 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 = 2e5 + 11;
typedef pair<int, int> ii;
int n, q, w;
int a[N];
int cost[N];
ii E[N];
vector<int> adj[N], pos[N];
int top = 0;
void dfs(int u, int id_edge, int p = 0) {
for (int id : adj[u]) {
int x = E[id].first, y = E[id].second;
if (x == u) swap(x, y);
if (x == p) continue;
a[++top] = cost[id];
pos[id].push_back(top);
dfs(x, id, u);
}
if (p) {
a[++top] = -cost[id_edge];
pos[id_edge].push_back(top);
}
}
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... |