//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <assert.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
void debug() {cout << endl;}
template<class T, class ... U> void debug(T a, U ... b) {cout << a << " ", debug(b...);};
template<class T> void pary(T l, T r) {
while (l != r) cout << *l << " ", l++;
cout << endl;
}
#define ll long long
#define maxn 200005
#define mod 1000000007
#define pii pair<ll, ll>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
vector<pii> adj[maxn];
pii ed[maxn];
int ord[maxn], lef[maxn], rig[maxn], pa[maxn], sub[maxn];
ll dep[maxn], wei[maxn];
int ti = 0;
void dfs(int n, int par) {
pa[n] = par;
ord[ti] = n;
lef[n] = ti++;
for (auto v:adj[n]) {
if (v.ff != par) {
dep[v.ff] = dep[n] + v.ss;
dfs(v.ff, n);
ord[ti++] = n;
}
}
rig[n] = ti;
}
const ll ninf = 1LL<<61;
struct segtree{
struct node{
ll mi, ma, la, ra, val;
node() {mi = 0, ma = 0, la = 0, ra = 0, val = 0;}
};
node seg[4 * maxn];
ll tag[4 * maxn];
void pull(int cur) {
ll tl = tag[cur * 2], tr = tag[cur * 2 + 1];
node le = seg[cur*2], ri = seg[cur*2+1];
seg[cur].mi = min(le.mi + tl, ri.mi + tr);
seg[cur].ma = max(le.ma + tl, ri.ma + tr);
seg[cur].la = max(max(le.la - tl, ri.la - tr), le.ma + tl - 2*(ri.mi + tr));
seg[cur].ra = max(max(le.ra - tl, ri.ra - tr), ri.ma + tr - 2*(le.mi + tl));
seg[cur].val = max(max(le.val, ri.val), max(le.la - tl + ri.ma + tr, le.ma + tl + ri.ra - tr));
}
void init(int cur, int l, int r) {
if (r <= l) return;
if (r - l == 1) {
seg[cur].mi = seg[cur].ma = dep[ord[l]];
seg[cur].la = seg[cur].ra = -dep[ord[l]];
return;
}
int mid = (l + r) / 2;
init(cur * 2, l, mid), init(cur * 2 + 1, mid, r);
pull(cur);
//debug(l, r, seg[cur].val);
}
void modify(int cur, int l, int r, int ql, int qr, ll val) {
if (r <= l || ql >= r || qr <= l) return;
if (ql <= l && qr >= r) {
tag[cur] += val;
return;
}
int mid = (l + r) / 2;
modify(cur * 2, l, mid, ql, qr, val);
modify(cur * 2 + 1, mid, r, ql, qr, val);
pull(cur);
//debug(l, r, seg[cur].val);
}
ll getval() {
return seg[1].val + tag[1];
}
} tree;
int main() {
io
ll n, q, W;
cin >> n >> q >> W;
for (int i = 0;i < n - 1;i++) {
int u, v;
ll w;
cin >> u >> v >> w;
ed[i] = {u, v};
wei[i] = w;
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
dfs(1, 0);
for (int i = 0;i < n - 1;i++) {
if (pa[ed[i].ff] == ed[i].ss) sub[i] = ed[i].ff;
else sub[i] = ed[i].ss;
}
//pary(ord, ord + ti);
//pary(dep + 1, dep + 1 + n);
tree.init(1, 0, ti);
ll prv = 0;
while (q--) {
ll d, e;
cin >> d >> e;
d = (d + prv) % (n - 1);
e = (e + prv) % W;
ll dif = e - wei[d];
tree.modify(1, 0, ti, lef[sub[d]], rig[sub[d]], dif);
wei[d] = e;
prv = tree.getval();
cout << prv << "\n";
}
}
/*
4 3 2000
1 2 100
2 3 1000
2 4 1000
2 1030
1 1020
1 890
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
36300 KB |
Output is correct |
2 |
Correct |
17 ms |
36284 KB |
Output is correct |
3 |
Correct |
18 ms |
36300 KB |
Output is correct |
4 |
Correct |
17 ms |
36300 KB |
Output is correct |
5 |
Correct |
17 ms |
36272 KB |
Output is correct |
6 |
Correct |
18 ms |
36340 KB |
Output is correct |
7 |
Correct |
17 ms |
36264 KB |
Output is correct |
8 |
Correct |
18 ms |
36380 KB |
Output is correct |
9 |
Correct |
17 ms |
36300 KB |
Output is correct |
10 |
Correct |
18 ms |
36300 KB |
Output is correct |
11 |
Correct |
17 ms |
36304 KB |
Output is correct |
12 |
Correct |
17 ms |
36380 KB |
Output is correct |
13 |
Correct |
17 ms |
36300 KB |
Output is correct |
14 |
Correct |
18 ms |
36268 KB |
Output is correct |
15 |
Correct |
18 ms |
36368 KB |
Output is correct |
16 |
Correct |
18 ms |
36324 KB |
Output is correct |
17 |
Correct |
17 ms |
36292 KB |
Output is correct |
18 |
Correct |
17 ms |
36300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
36300 KB |
Output is correct |
2 |
Correct |
17 ms |
36284 KB |
Output is correct |
3 |
Correct |
18 ms |
36300 KB |
Output is correct |
4 |
Correct |
17 ms |
36300 KB |
Output is correct |
5 |
Correct |
17 ms |
36272 KB |
Output is correct |
6 |
Correct |
18 ms |
36340 KB |
Output is correct |
7 |
Correct |
17 ms |
36264 KB |
Output is correct |
8 |
Correct |
18 ms |
36380 KB |
Output is correct |
9 |
Correct |
17 ms |
36300 KB |
Output is correct |
10 |
Correct |
18 ms |
36300 KB |
Output is correct |
11 |
Correct |
17 ms |
36304 KB |
Output is correct |
12 |
Correct |
17 ms |
36380 KB |
Output is correct |
13 |
Correct |
17 ms |
36300 KB |
Output is correct |
14 |
Correct |
18 ms |
36268 KB |
Output is correct |
15 |
Correct |
18 ms |
36368 KB |
Output is correct |
16 |
Correct |
18 ms |
36324 KB |
Output is correct |
17 |
Correct |
17 ms |
36292 KB |
Output is correct |
18 |
Correct |
17 ms |
36300 KB |
Output is correct |
19 |
Correct |
20 ms |
36528 KB |
Output is correct |
20 |
Correct |
20 ms |
36524 KB |
Output is correct |
21 |
Correct |
20 ms |
36492 KB |
Output is correct |
22 |
Correct |
22 ms |
36572 KB |
Output is correct |
23 |
Correct |
24 ms |
37196 KB |
Output is correct |
24 |
Correct |
24 ms |
37192 KB |
Output is correct |
25 |
Correct |
23 ms |
37164 KB |
Output is correct |
26 |
Correct |
24 ms |
37524 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
36300 KB |
Output is correct |
2 |
Correct |
17 ms |
36300 KB |
Output is correct |
3 |
Correct |
18 ms |
36300 KB |
Output is correct |
4 |
Correct |
24 ms |
36428 KB |
Output is correct |
5 |
Correct |
54 ms |
36776 KB |
Output is correct |
6 |
Correct |
17 ms |
36364 KB |
Output is correct |
7 |
Correct |
18 ms |
36392 KB |
Output is correct |
8 |
Correct |
18 ms |
36428 KB |
Output is correct |
9 |
Correct |
19 ms |
36460 KB |
Output is correct |
10 |
Correct |
27 ms |
36428 KB |
Output is correct |
11 |
Correct |
67 ms |
36848 KB |
Output is correct |
12 |
Correct |
19 ms |
36932 KB |
Output is correct |
13 |
Correct |
20 ms |
37084 KB |
Output is correct |
14 |
Correct |
20 ms |
37068 KB |
Output is correct |
15 |
Correct |
32 ms |
37140 KB |
Output is correct |
16 |
Correct |
78 ms |
37572 KB |
Output is correct |
17 |
Correct |
61 ms |
46544 KB |
Output is correct |
18 |
Correct |
61 ms |
46932 KB |
Output is correct |
19 |
Correct |
63 ms |
48808 KB |
Output is correct |
20 |
Correct |
82 ms |
49716 KB |
Output is correct |
21 |
Correct |
175 ms |
50224 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
36428 KB |
Output is correct |
2 |
Correct |
23 ms |
36568 KB |
Output is correct |
3 |
Correct |
50 ms |
36744 KB |
Output is correct |
4 |
Correct |
80 ms |
37012 KB |
Output is correct |
5 |
Correct |
24 ms |
37848 KB |
Output is correct |
6 |
Correct |
30 ms |
37964 KB |
Output is correct |
7 |
Correct |
61 ms |
38176 KB |
Output is correct |
8 |
Correct |
109 ms |
38452 KB |
Output is correct |
9 |
Correct |
45 ms |
43628 KB |
Output is correct |
10 |
Correct |
53 ms |
43844 KB |
Output is correct |
11 |
Correct |
103 ms |
44124 KB |
Output is correct |
12 |
Correct |
156 ms |
44448 KB |
Output is correct |
13 |
Correct |
72 ms |
50240 KB |
Output is correct |
14 |
Correct |
79 ms |
51396 KB |
Output is correct |
15 |
Correct |
129 ms |
51788 KB |
Output is correct |
16 |
Correct |
192 ms |
51908 KB |
Output is correct |
17 |
Correct |
194 ms |
50980 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
238 ms |
52620 KB |
Output is correct |
2 |
Correct |
282 ms |
52640 KB |
Output is correct |
3 |
Correct |
271 ms |
52600 KB |
Output is correct |
4 |
Correct |
249 ms |
52840 KB |
Output is correct |
5 |
Correct |
232 ms |
52164 KB |
Output is correct |
6 |
Correct |
209 ms |
50260 KB |
Output is correct |
7 |
Correct |
264 ms |
55156 KB |
Output is correct |
8 |
Correct |
277 ms |
55124 KB |
Output is correct |
9 |
Correct |
263 ms |
55208 KB |
Output is correct |
10 |
Correct |
252 ms |
55036 KB |
Output is correct |
11 |
Correct |
269 ms |
54516 KB |
Output is correct |
12 |
Correct |
247 ms |
51956 KB |
Output is correct |
13 |
Correct |
307 ms |
58888 KB |
Output is correct |
14 |
Correct |
320 ms |
58888 KB |
Output is correct |
15 |
Correct |
310 ms |
58948 KB |
Output is correct |
16 |
Correct |
312 ms |
58784 KB |
Output is correct |
17 |
Correct |
320 ms |
57876 KB |
Output is correct |
18 |
Correct |
300 ms |
53396 KB |
Output is correct |
19 |
Correct |
293 ms |
58948 KB |
Output is correct |
20 |
Correct |
351 ms |
58876 KB |
Output is correct |
21 |
Correct |
307 ms |
58876 KB |
Output is correct |
22 |
Correct |
294 ms |
58748 KB |
Output is correct |
23 |
Correct |
284 ms |
57776 KB |
Output is correct |
24 |
Correct |
253 ms |
53384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
36300 KB |
Output is correct |
2 |
Correct |
17 ms |
36284 KB |
Output is correct |
3 |
Correct |
18 ms |
36300 KB |
Output is correct |
4 |
Correct |
17 ms |
36300 KB |
Output is correct |
5 |
Correct |
17 ms |
36272 KB |
Output is correct |
6 |
Correct |
18 ms |
36340 KB |
Output is correct |
7 |
Correct |
17 ms |
36264 KB |
Output is correct |
8 |
Correct |
18 ms |
36380 KB |
Output is correct |
9 |
Correct |
17 ms |
36300 KB |
Output is correct |
10 |
Correct |
18 ms |
36300 KB |
Output is correct |
11 |
Correct |
17 ms |
36304 KB |
Output is correct |
12 |
Correct |
17 ms |
36380 KB |
Output is correct |
13 |
Correct |
17 ms |
36300 KB |
Output is correct |
14 |
Correct |
18 ms |
36268 KB |
Output is correct |
15 |
Correct |
18 ms |
36368 KB |
Output is correct |
16 |
Correct |
18 ms |
36324 KB |
Output is correct |
17 |
Correct |
17 ms |
36292 KB |
Output is correct |
18 |
Correct |
17 ms |
36300 KB |
Output is correct |
19 |
Correct |
20 ms |
36528 KB |
Output is correct |
20 |
Correct |
20 ms |
36524 KB |
Output is correct |
21 |
Correct |
20 ms |
36492 KB |
Output is correct |
22 |
Correct |
22 ms |
36572 KB |
Output is correct |
23 |
Correct |
24 ms |
37196 KB |
Output is correct |
24 |
Correct |
24 ms |
37192 KB |
Output is correct |
25 |
Correct |
23 ms |
37164 KB |
Output is correct |
26 |
Correct |
24 ms |
37524 KB |
Output is correct |
27 |
Correct |
18 ms |
36300 KB |
Output is correct |
28 |
Correct |
17 ms |
36300 KB |
Output is correct |
29 |
Correct |
18 ms |
36300 KB |
Output is correct |
30 |
Correct |
24 ms |
36428 KB |
Output is correct |
31 |
Correct |
54 ms |
36776 KB |
Output is correct |
32 |
Correct |
17 ms |
36364 KB |
Output is correct |
33 |
Correct |
18 ms |
36392 KB |
Output is correct |
34 |
Correct |
18 ms |
36428 KB |
Output is correct |
35 |
Correct |
19 ms |
36460 KB |
Output is correct |
36 |
Correct |
27 ms |
36428 KB |
Output is correct |
37 |
Correct |
67 ms |
36848 KB |
Output is correct |
38 |
Correct |
19 ms |
36932 KB |
Output is correct |
39 |
Correct |
20 ms |
37084 KB |
Output is correct |
40 |
Correct |
20 ms |
37068 KB |
Output is correct |
41 |
Correct |
32 ms |
37140 KB |
Output is correct |
42 |
Correct |
78 ms |
37572 KB |
Output is correct |
43 |
Correct |
61 ms |
46544 KB |
Output is correct |
44 |
Correct |
61 ms |
46932 KB |
Output is correct |
45 |
Correct |
63 ms |
48808 KB |
Output is correct |
46 |
Correct |
82 ms |
49716 KB |
Output is correct |
47 |
Correct |
175 ms |
50224 KB |
Output is correct |
48 |
Correct |
18 ms |
36428 KB |
Output is correct |
49 |
Correct |
23 ms |
36568 KB |
Output is correct |
50 |
Correct |
50 ms |
36744 KB |
Output is correct |
51 |
Correct |
80 ms |
37012 KB |
Output is correct |
52 |
Correct |
24 ms |
37848 KB |
Output is correct |
53 |
Correct |
30 ms |
37964 KB |
Output is correct |
54 |
Correct |
61 ms |
38176 KB |
Output is correct |
55 |
Correct |
109 ms |
38452 KB |
Output is correct |
56 |
Correct |
45 ms |
43628 KB |
Output is correct |
57 |
Correct |
53 ms |
43844 KB |
Output is correct |
58 |
Correct |
103 ms |
44124 KB |
Output is correct |
59 |
Correct |
156 ms |
44448 KB |
Output is correct |
60 |
Correct |
72 ms |
50240 KB |
Output is correct |
61 |
Correct |
79 ms |
51396 KB |
Output is correct |
62 |
Correct |
129 ms |
51788 KB |
Output is correct |
63 |
Correct |
192 ms |
51908 KB |
Output is correct |
64 |
Correct |
194 ms |
50980 KB |
Output is correct |
65 |
Correct |
238 ms |
52620 KB |
Output is correct |
66 |
Correct |
282 ms |
52640 KB |
Output is correct |
67 |
Correct |
271 ms |
52600 KB |
Output is correct |
68 |
Correct |
249 ms |
52840 KB |
Output is correct |
69 |
Correct |
232 ms |
52164 KB |
Output is correct |
70 |
Correct |
209 ms |
50260 KB |
Output is correct |
71 |
Correct |
264 ms |
55156 KB |
Output is correct |
72 |
Correct |
277 ms |
55124 KB |
Output is correct |
73 |
Correct |
263 ms |
55208 KB |
Output is correct |
74 |
Correct |
252 ms |
55036 KB |
Output is correct |
75 |
Correct |
269 ms |
54516 KB |
Output is correct |
76 |
Correct |
247 ms |
51956 KB |
Output is correct |
77 |
Correct |
307 ms |
58888 KB |
Output is correct |
78 |
Correct |
320 ms |
58888 KB |
Output is correct |
79 |
Correct |
310 ms |
58948 KB |
Output is correct |
80 |
Correct |
312 ms |
58784 KB |
Output is correct |
81 |
Correct |
320 ms |
57876 KB |
Output is correct |
82 |
Correct |
300 ms |
53396 KB |
Output is correct |
83 |
Correct |
293 ms |
58948 KB |
Output is correct |
84 |
Correct |
351 ms |
58876 KB |
Output is correct |
85 |
Correct |
307 ms |
58876 KB |
Output is correct |
86 |
Correct |
294 ms |
58748 KB |
Output is correct |
87 |
Correct |
284 ms |
57776 KB |
Output is correct |
88 |
Correct |
253 ms |
53384 KB |
Output is correct |
89 |
Correct |
236 ms |
55776 KB |
Output is correct |
90 |
Correct |
255 ms |
56160 KB |
Output is correct |
91 |
Correct |
257 ms |
57420 KB |
Output is correct |
92 |
Correct |
261 ms |
57568 KB |
Output is correct |
93 |
Correct |
279 ms |
59772 KB |
Output is correct |
94 |
Correct |
269 ms |
58944 KB |
Output is correct |
95 |
Correct |
289 ms |
60404 KB |
Output is correct |
96 |
Correct |
286 ms |
59460 KB |
Output is correct |
97 |
Correct |
285 ms |
60320 KB |
Output is correct |
98 |
Correct |
287 ms |
62128 KB |
Output is correct |
99 |
Correct |
294 ms |
60052 KB |
Output is correct |
100 |
Correct |
285 ms |
60052 KB |
Output is correct |