# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373734 | LucaDantas | Dynamic Diameter (CEOI19_diameter) | C++17 | 2105 ms | 12768 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;
constexpr int maxn = 1e5+10;
vector<pair<int,int>> g[maxn];
int n, q;
long long dist[maxn], cost[maxn], w;
void dfs(int u, int p) {
for(auto [v, id] : g[u]) {
if(v != p) {
dist[v] = dist[u] + cost[id];
dfs(v, u);
}
}
}
void brute() {
int last = 0;
while(q--) {
int d, e; scanf("%d %d", &d, &e);
d = (d + last) % (n - 1);
e = (e + last) % w;
cost[d] = e;
dist[1] = 0;
dfs(1, 0);
int x = max_element(dist+1, dist+n+1) - dist;
dist[x] = 0;
dfs(x, 0);
printf("%lld\n", *max_element(dist+1, dist+n+1));
last = *max_element(dist+1, dist+n+1);
}
exit(0);
}
void bst() {
multiset<long long, greater<long long>> st;
for(int i = 0; i < n-1; i++)
st.insert(cost[i]);
int last = 0;
while(q--) {
int d, e; scanf("%d %d", &d, &e);
d = (int)((d + last) % (n - 1));
e = (int)((e + last) % w);
st.erase(st.find(cost[d]));
cost[d] = e;
st.insert(e);
last = (int)(*st.begin() + (n>2?*next(st.begin()):0));
printf("%d\n", last);
}
exit(0);
}
int main() {
scanf("%d %d %lld", &n, &q, &w);
// printf("%d %d %lld\n", n, q, w);
if(w > 10000) assert(0);
for(int i = 0; i < n-1; i++) {
int a, b; long long c; scanf("%d %d %lld", &a, &b, &c);
// printf("%d %d %lld\n", a, b, c);
g[a].push_back({b, i});
g[b].push_back({a, i});
cost[i] = c;
}
if((int)g[1].size() == n-1) bst();
if(n <= 5000) brute();
}
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... |