#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define long unsigned long
#define pb push_back
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define lb lower_bound
#define ub upper_bound
#define sz(v) int((v).size())
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
const int N = 1e5+7;
set <pair <int, ll>> graph[N];
vector <pair <pii, ll>> edges;
ll df, vf;
int n, q;
ll w;
void find_furthest(int v, int p, ll dist = 0) {
if (dist > df) {
df = dist;
vf = v;
}
for (auto to : graph[v]) {
if (to.first == p) continue;
find_furthest(to.first, v, dist+to.second);
}
}
void subtask3() {
for (auto to : edges) {
if (to.first.first != 1) {
return;
}
}
set <pair <ll, int>, greater <pair <ll, int>>> st;
for (auto to : edges) {
st.insert(mp(to.second, to.first.second));
}
ll last = 0;
while (q--) {
ll d, e;
cin >> d >> e;
d = (d + last) % (n - 1);
e = (e + last) % w;
auto &c = edges[d].second;
auto b = edges[d].first.second;
st.erase(st.find(mp(c, b)));
c = e;
st.insert(mp(c, b));
ll ans = 0;
ll cnt = 0;
for (auto to : st) {
ans += to.first;
if (++cnt > 1) break;
}
cout << ans << endl;
last = ans;
}
exit(0);
}
void subtask4() {
vector <ll> ans_for(n+1);
vector <pll> mx_child(n+1), dist_child(n+1);
set <pair <ll, int>, greater <pair <ll, int>>> st;
for (auto to : edges) {
auto a = to.first.first;
auto b = to.first.second;
if (!(a*2 != b || a*2+1 != b)) {
return;
}
if (a*2 == b) dist_child[a].first = to.second;
else dist_child[a].second = to.second;
}
for (int i = 1; i <= n; i++) {
if (sz(graph[i]) == 1) {
int x = i;
while (x) {
if (x*2 <= n) mx_child[x].first = max(mx_child[x*2].first, mx_child[x*2].second)+dist_child[x].first;
if (x*2+1 <= n) mx_child[x].second = max(mx_child[x*2+1].first, mx_child[x*2+1].second)+dist_child[x].second;
x >>= 1;
}
}
}
for (int i = 1; i <= n; i++) {
st.insert(mp(mx_child[i].first+mx_child[i].second, i));
}
ll last = 0;
while (q--) {
ll d, e;
cin >> d >> e;
d = (d + last) % (n - 1);
e = (e + last) % w;
auto a = edges[d].first.first, b = edges[d].first.second;
int x = (b >> 1);
if (a*2 == b) dist_child[a].first = e;
else dist_child[a].second = e;
while (x) {
st.erase(st.find(mp(mx_child[x].first+mx_child[x].second, x)));
if (x*2 <= n) mx_child[x].first = max(mx_child[x*2].first, mx_child[x*2].second)+dist_child[x].first;
if (x*2+1 <= n) mx_child[x].second = max(mx_child[x*2+1].first, mx_child[x*2+1].second)+dist_child[x].second;
st.insert(mp(mx_child[x].first+mx_child[x].second, x));
x >>= 1;
}
cout << (*st.begin()).first << endl;
last = (*st.begin()).first;
}
exit(0);
}
void solve() {
cin >> n >> q >> w;
for (int i = 0; i < n-1; i++) {
int a, b;
ll c;
cin >> a >> b >> c;
if (a > b) swap(a, b);
edges.pb(mp(mp(a, b), c));
graph[a].insert(mp(b, c));
graph[b].insert(mp(a, c));
}
if (n <= 5000) {
ll last = 0;
while (q--) {
ll d, e;
cin >> d >> e;
d = (d + last) % (n - 1);
e = (e + last) % w;
auto a = edges[d].first.first, b = edges[d].first.second;
auto &c = edges[d].second;
graph[a].erase(graph[a].find(mp(b, c)));
graph[b].erase(graph[b].find(mp(a, c)));
c = e;
graph[a].insert(mp(b, c));
graph[b].insert(mp(a, c));
df = vf = 0;
find_furthest(1, 1);
df = 0;
find_furthest(vf, vf);
cout << df << endl;
last = df;
}
return;
}
subtask3();
subtask4();
}
int main() {
do_not_disturb
int t = 1;
//~ cin >> t;
while (t--) {
solve();
}
return 0;
}
/*
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
2 ms |
4948 KB |
Output is correct |
4 |
Correct |
3 ms |
4948 KB |
Output is correct |
5 |
Correct |
3 ms |
4948 KB |
Output is correct |
6 |
Correct |
3 ms |
4948 KB |
Output is correct |
7 |
Correct |
3 ms |
4948 KB |
Output is correct |
8 |
Correct |
3 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
4948 KB |
Output is correct |
10 |
Correct |
3 ms |
4948 KB |
Output is correct |
11 |
Correct |
3 ms |
4948 KB |
Output is correct |
12 |
Correct |
3 ms |
4948 KB |
Output is correct |
13 |
Correct |
3 ms |
4948 KB |
Output is correct |
14 |
Correct |
3 ms |
4948 KB |
Output is correct |
15 |
Correct |
5 ms |
4948 KB |
Output is correct |
16 |
Correct |
4 ms |
4948 KB |
Output is correct |
17 |
Correct |
3 ms |
4948 KB |
Output is correct |
18 |
Correct |
3 ms |
4948 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
2 ms |
4948 KB |
Output is correct |
4 |
Correct |
3 ms |
4948 KB |
Output is correct |
5 |
Correct |
3 ms |
4948 KB |
Output is correct |
6 |
Correct |
3 ms |
4948 KB |
Output is correct |
7 |
Correct |
3 ms |
4948 KB |
Output is correct |
8 |
Correct |
3 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
4948 KB |
Output is correct |
10 |
Correct |
3 ms |
4948 KB |
Output is correct |
11 |
Correct |
3 ms |
4948 KB |
Output is correct |
12 |
Correct |
3 ms |
4948 KB |
Output is correct |
13 |
Correct |
3 ms |
4948 KB |
Output is correct |
14 |
Correct |
3 ms |
4948 KB |
Output is correct |
15 |
Correct |
5 ms |
4948 KB |
Output is correct |
16 |
Correct |
4 ms |
4948 KB |
Output is correct |
17 |
Correct |
3 ms |
4948 KB |
Output is correct |
18 |
Correct |
3 ms |
4948 KB |
Output is correct |
19 |
Correct |
226 ms |
5416 KB |
Output is correct |
20 |
Correct |
241 ms |
5164 KB |
Output is correct |
21 |
Correct |
247 ms |
5296 KB |
Output is correct |
22 |
Correct |
297 ms |
5204 KB |
Output is correct |
23 |
Correct |
1628 ms |
5736 KB |
Output is correct |
24 |
Correct |
1801 ms |
5996 KB |
Output is correct |
25 |
Correct |
1890 ms |
5780 KB |
Output is correct |
26 |
Correct |
2334 ms |
5992 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
4 ms |
4948 KB |
Output is correct |
4 |
Correct |
20 ms |
5072 KB |
Output is correct |
5 |
Correct |
86 ms |
5380 KB |
Output is correct |
6 |
Correct |
3 ms |
4948 KB |
Output is correct |
7 |
Correct |
3 ms |
5076 KB |
Output is correct |
8 |
Correct |
6 ms |
5076 KB |
Output is correct |
9 |
Correct |
33 ms |
5092 KB |
Output is correct |
10 |
Correct |
299 ms |
5256 KB |
Output is correct |
11 |
Correct |
1468 ms |
5476 KB |
Output is correct |
12 |
Correct |
6 ms |
5972 KB |
Output is correct |
13 |
Correct |
9 ms |
5972 KB |
Output is correct |
14 |
Correct |
7 ms |
6020 KB |
Output is correct |
15 |
Correct |
15 ms |
6100 KB |
Output is correct |
16 |
Correct |
54 ms |
6496 KB |
Output is correct |
17 |
Correct |
90 ms |
25272 KB |
Output is correct |
18 |
Correct |
89 ms |
25356 KB |
Output is correct |
19 |
Correct |
90 ms |
25316 KB |
Output is correct |
20 |
Correct |
108 ms |
25396 KB |
Output is correct |
21 |
Correct |
200 ms |
26020 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
5168 KB |
Output is correct |
2 |
Correct |
267 ms |
5192 KB |
Output is correct |
3 |
Correct |
1326 ms |
5524 KB |
Output is correct |
4 |
Correct |
2690 ms |
5712 KB |
Output is correct |
5 |
Correct |
10 ms |
7376 KB |
Output is correct |
6 |
Correct |
25 ms |
7504 KB |
Output is correct |
7 |
Correct |
86 ms |
7756 KB |
Output is correct |
8 |
Correct |
154 ms |
8004 KB |
Output is correct |
9 |
Correct |
41 ms |
17096 KB |
Output is correct |
10 |
Correct |
57 ms |
17156 KB |
Output is correct |
11 |
Correct |
140 ms |
17456 KB |
Output is correct |
12 |
Correct |
253 ms |
17680 KB |
Output is correct |
13 |
Correct |
73 ms |
29240 KB |
Output is correct |
14 |
Correct |
91 ms |
29284 KB |
Output is correct |
15 |
Correct |
206 ms |
29696 KB |
Output is correct |
16 |
Correct |
334 ms |
29920 KB |
Output is correct |
17 |
Correct |
687 ms |
29784 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
655 ms |
30796 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
2 ms |
4948 KB |
Output is correct |
4 |
Correct |
3 ms |
4948 KB |
Output is correct |
5 |
Correct |
3 ms |
4948 KB |
Output is correct |
6 |
Correct |
3 ms |
4948 KB |
Output is correct |
7 |
Correct |
3 ms |
4948 KB |
Output is correct |
8 |
Correct |
3 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
4948 KB |
Output is correct |
10 |
Correct |
3 ms |
4948 KB |
Output is correct |
11 |
Correct |
3 ms |
4948 KB |
Output is correct |
12 |
Correct |
3 ms |
4948 KB |
Output is correct |
13 |
Correct |
3 ms |
4948 KB |
Output is correct |
14 |
Correct |
3 ms |
4948 KB |
Output is correct |
15 |
Correct |
5 ms |
4948 KB |
Output is correct |
16 |
Correct |
4 ms |
4948 KB |
Output is correct |
17 |
Correct |
3 ms |
4948 KB |
Output is correct |
18 |
Correct |
3 ms |
4948 KB |
Output is correct |
19 |
Correct |
226 ms |
5416 KB |
Output is correct |
20 |
Correct |
241 ms |
5164 KB |
Output is correct |
21 |
Correct |
247 ms |
5296 KB |
Output is correct |
22 |
Correct |
297 ms |
5204 KB |
Output is correct |
23 |
Correct |
1628 ms |
5736 KB |
Output is correct |
24 |
Correct |
1801 ms |
5996 KB |
Output is correct |
25 |
Correct |
1890 ms |
5780 KB |
Output is correct |
26 |
Correct |
2334 ms |
5992 KB |
Output is correct |
27 |
Correct |
3 ms |
4948 KB |
Output is correct |
28 |
Correct |
3 ms |
4948 KB |
Output is correct |
29 |
Correct |
4 ms |
4948 KB |
Output is correct |
30 |
Correct |
20 ms |
5072 KB |
Output is correct |
31 |
Correct |
86 ms |
5380 KB |
Output is correct |
32 |
Correct |
3 ms |
4948 KB |
Output is correct |
33 |
Correct |
3 ms |
5076 KB |
Output is correct |
34 |
Correct |
6 ms |
5076 KB |
Output is correct |
35 |
Correct |
33 ms |
5092 KB |
Output is correct |
36 |
Correct |
299 ms |
5256 KB |
Output is correct |
37 |
Correct |
1468 ms |
5476 KB |
Output is correct |
38 |
Correct |
6 ms |
5972 KB |
Output is correct |
39 |
Correct |
9 ms |
5972 KB |
Output is correct |
40 |
Correct |
7 ms |
6020 KB |
Output is correct |
41 |
Correct |
15 ms |
6100 KB |
Output is correct |
42 |
Correct |
54 ms |
6496 KB |
Output is correct |
43 |
Correct |
90 ms |
25272 KB |
Output is correct |
44 |
Correct |
89 ms |
25356 KB |
Output is correct |
45 |
Correct |
90 ms |
25316 KB |
Output is correct |
46 |
Correct |
108 ms |
25396 KB |
Output is correct |
47 |
Correct |
200 ms |
26020 KB |
Output is correct |
48 |
Correct |
29 ms |
5168 KB |
Output is correct |
49 |
Correct |
267 ms |
5192 KB |
Output is correct |
50 |
Correct |
1326 ms |
5524 KB |
Output is correct |
51 |
Correct |
2690 ms |
5712 KB |
Output is correct |
52 |
Correct |
10 ms |
7376 KB |
Output is correct |
53 |
Correct |
25 ms |
7504 KB |
Output is correct |
54 |
Correct |
86 ms |
7756 KB |
Output is correct |
55 |
Correct |
154 ms |
8004 KB |
Output is correct |
56 |
Correct |
41 ms |
17096 KB |
Output is correct |
57 |
Correct |
57 ms |
17156 KB |
Output is correct |
58 |
Correct |
140 ms |
17456 KB |
Output is correct |
59 |
Correct |
253 ms |
17680 KB |
Output is correct |
60 |
Correct |
73 ms |
29240 KB |
Output is correct |
61 |
Correct |
91 ms |
29284 KB |
Output is correct |
62 |
Correct |
206 ms |
29696 KB |
Output is correct |
63 |
Correct |
334 ms |
29920 KB |
Output is correct |
64 |
Correct |
687 ms |
29784 KB |
Output is correct |
65 |
Incorrect |
655 ms |
30796 KB |
Output isn't correct |
66 |
Halted |
0 ms |
0 KB |
- |