# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
922444 | SNP011 | Dynamic Diameter (CEOI19_diameter) | C++17 | 501 ms | 73308 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 long long
#define pii pair<long long, long long>
#define pb push_back
const int maxn = 4e5 + 5;
int h[maxn], dp[5][4 * maxn], lastans;
int lazy[4 * maxn], st[maxn], fn[maxn];
vector<pii> adj[maxn];
vector<int> discovery;
map<pii, int> we;
void dfs(int v, int par = 0) {
st[v] = discovery.size();
discovery.pb(h[v]);
for (auto[w, u]: adj[v]) {
if (u != par) {
h[u] = h[v] + w;
dfs(u, v);
discovery.pb(h[v]);
}
}
fn[v] = discovery.size() - 1;
}
void updateDP(int id, int L, int R) {
int mid = (R + L) >> 1;
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... |