#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
using ll = long long;
const int maxn = 1e5 + 3;
vector<pair<int,int> > adj[maxn],edges;
vector<int> partOf[maxn];
vector<ll> seg[maxn],lazy[maxn];
bool isCent[maxn];
int subSz[maxn],centRoot,timer[maxn];
unordered_map<int,int> tin[maxn],tout[maxn],edgeRoot[maxn];
unordered_map<int,ll> costEdge[maxn];
ll tempResult[maxn];
priority_queue<pair<ll,int> > bestEdge[maxn],result;
ll cost[maxn];
void dfsSz(int u,int p){
subSz[u] = 1;
for(auto [v,w] : adj[u]){
if(v != p && !isCent[v]){
dfsSz(v,u);
subSz[u] += subSz[v];
}
}
}
int fnCent(int u,int p,int s){
for(auto [v,w] : adj[u]){
if(v != p && !isCent[v] && subSz[v] > s/2){
return fnCent(v,u,s);
}
}
return u;
}
void dfsTour(int c,int u,int p){
for(auto [v,w] : adj[u]){
if(v != p && !isCent[v]){
partOf[w].emplace_back(c);
tin[c][w] = timer[c]++;
dfsTour(c,v,u);
tout[c][w] = timer[c]++;
}
}
}
void dfsEdgeRoot(int c,int d,int u,int p){
for(auto [v,w] : adj[u]){
if(v != p && !isCent[v]){
edgeRoot[c][w] = d;
dfsEdgeRoot(c,d,v,u);
}
}
}
void dfsCent(int u,int p){
dfsSz(u,p);
int cent = fnCent(u,u,subSz[u]);
isCent[cent] = true;
if(p != -1){
centRoot = cent;
}
dfsTour(cent,cent,cent);
for(auto [v,w] : adj[cent]){
if(!isCent[v]){
bestEdge[cent].emplace(0,w);
edgeRoot[cent][w] = w;
dfsEdgeRoot(cent,w,v,cent);
}
}
seg[cent].resize(4*timer[cent]);
lazy[cent].resize(4*timer[cent]);
for(auto [v,w] : adj[cent]){
if(!isCent[v]){
dfsCent(v,cent);
}
}
}
// Segment Tree + Lazy Propagation
void push(int c,int i){
lazy[c][i<<1] += lazy[c][i];
seg[c][i<<1] += lazy[c][i];
lazy[c][i<<1|1] += lazy[c][i];
seg[c][i<<1|1] += lazy[c][i];
lazy[c][i] = 0;
}
void upd(int c,int i,int l,int r,int ul,int ur,ll v){
if(ul <= l && r <= ur){
seg[c][i] += v;
lazy[c][i] += v;
}else if(ul > r || ur < l){
return;
}else{
int m = (l+r)/2;
push(c,i);
upd(c,i<<1,l,m,ul,ur,v);
upd(c,i<<1|1,m+1,r,ul,ur,v);
seg[c][i] = max(seg[c][i<<1],seg[c][i<<1|1]);
}
}
ll qry(int c,int i,int l,int r,int ql,int qr){
if(ql <= l && r <= qr){
return seg[c][i];
}else if(ql > r || qr < l){
return 0;
}else{
int m = (l+r)/2;
push(c,i);
return max(qry(c,i<<1,l,m,ql,qr),qry(c,i<<1|1,m+1,r,ql,qr));
}
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,q;
ll w;
cin >> n >> q >> w;
for(int i=1;i<n;i++){
int u,v;
ll w;
cin >> u >> v >> w;
u--; v--;
adj[u].emplace_back(v,i);
adj[v].emplace_back(u,i);
edges.emplace_back(u,v);
cost[i] = w;
}
dfsCent(0,-1);
for(int i=1;i<n;i++){
for(int it : partOf[i]){
upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,cost[i]);
costEdge[it][edgeRoot[it][i]] = qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]);
bestEdge[it].emplace(costEdge[it][edgeRoot[it][i]],edgeRoot[it][i]);
}
}
for(int i=0;i<n;i++){
vector<pair<ll,int> > best;
while(!bestEdge[i].empty() && best.size() < 2){
auto [u,v] = bestEdge[i].top();
bestEdge[i].pop();
if(costEdge[i][v] == u && (best.empty() || best.back() != make_pair(u,v))){
best.emplace_back(u,v);
}
}
ll sum = 0;
for(auto it : best){
sum += it.first;
}
for(auto it : best){
bestEdge[i].emplace(it);
}
tempResult[i] = sum;
result.emplace(tempResult[i],i);
}
ll last = 0;
while(q--){
int i;
ll j;
cin >> i >> j;
i = (i+last)%(n-1)+1;
j = (j+last)%w;
ll df = j-cost[i];
for(int it : partOf[i]){
upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,df);
costEdge[it][edgeRoot[it][i]] = qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]);
bestEdge[it].emplace(costEdge[it][edgeRoot[it][i]],edgeRoot[it][i]);
vector<pair<ll,int> > best;
while(!bestEdge[it].empty() && best.size() < 2){
auto [u,v] = bestEdge[it].top();
bestEdge[it].pop();
if(costEdge[it][v] == u && (best.empty() || best.back() != make_pair(u,v))){
best.emplace_back(u,v);
}
}
ll sum = 0;
for(auto it2 : best){
sum += it2.first;
}
for(auto it2 : best){
bestEdge[it].emplace(it2);
}
tempResult[it] = sum;
result.emplace(tempResult[it],it);
}
cost[i] = j;
while(true){
auto [u,v] = result.top();
if(tempResult[v] == u){
break;
}
result.pop();
}
last = result.top().first;
cout << result.top().first << "\n";
}
}
Compilation message
diameter.cpp: In function 'void dfsSz(int, int)':
diameter.cpp:21:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
21 | for(auto [v,w] : adj[u]){
| ^
diameter.cpp: In function 'int fnCent(int, int, int)':
diameter.cpp:29:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
29 | for(auto [v,w] : adj[u]){
| ^
diameter.cpp: In function 'void dfsTour(int, int, int)':
diameter.cpp:37:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
37 | for(auto [v,w] : adj[u]){
| ^
diameter.cpp: In function 'void dfsEdgeRoot(int, int, int, int)':
diameter.cpp:47:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
47 | for(auto [v,w] : adj[u]){
| ^
diameter.cpp: In function 'void dfsCent(int, int)':
diameter.cpp:62:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
62 | for(auto [v,w] : adj[cent]){
| ^
diameter.cpp:71:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
71 | for(auto [v,w] : adj[cent]){
| ^
diameter.cpp: In function 'int32_t main()':
diameter.cpp:140:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
140 | auto [u,v] = bestEdge[i].top();
| ^
diameter.cpp:170:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
170 | auto [u,v] = bestEdge[it].top();
| ^
diameter.cpp:188:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
188 | auto [u,v] = result.top();
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
34772 KB |
Output is correct |
2 |
Correct |
18 ms |
34796 KB |
Output is correct |
3 |
Correct |
19 ms |
34688 KB |
Output is correct |
4 |
Correct |
18 ms |
34680 KB |
Output is correct |
5 |
Correct |
19 ms |
34680 KB |
Output is correct |
6 |
Correct |
21 ms |
34696 KB |
Output is correct |
7 |
Correct |
20 ms |
34772 KB |
Output is correct |
8 |
Correct |
20 ms |
34788 KB |
Output is correct |
9 |
Correct |
21 ms |
34772 KB |
Output is correct |
10 |
Correct |
19 ms |
34772 KB |
Output is correct |
11 |
Correct |
18 ms |
34844 KB |
Output is correct |
12 |
Correct |
19 ms |
34824 KB |
Output is correct |
13 |
Correct |
20 ms |
34836 KB |
Output is correct |
14 |
Correct |
20 ms |
34900 KB |
Output is correct |
15 |
Correct |
20 ms |
34816 KB |
Output is correct |
16 |
Correct |
19 ms |
34920 KB |
Output is correct |
17 |
Correct |
18 ms |
34900 KB |
Output is correct |
18 |
Correct |
20 ms |
34972 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
34772 KB |
Output is correct |
2 |
Correct |
18 ms |
34796 KB |
Output is correct |
3 |
Correct |
19 ms |
34688 KB |
Output is correct |
4 |
Correct |
18 ms |
34680 KB |
Output is correct |
5 |
Correct |
19 ms |
34680 KB |
Output is correct |
6 |
Correct |
21 ms |
34696 KB |
Output is correct |
7 |
Correct |
20 ms |
34772 KB |
Output is correct |
8 |
Correct |
20 ms |
34788 KB |
Output is correct |
9 |
Correct |
21 ms |
34772 KB |
Output is correct |
10 |
Correct |
19 ms |
34772 KB |
Output is correct |
11 |
Correct |
18 ms |
34844 KB |
Output is correct |
12 |
Correct |
19 ms |
34824 KB |
Output is correct |
13 |
Correct |
20 ms |
34836 KB |
Output is correct |
14 |
Correct |
20 ms |
34900 KB |
Output is correct |
15 |
Correct |
20 ms |
34816 KB |
Output is correct |
16 |
Correct |
19 ms |
34920 KB |
Output is correct |
17 |
Correct |
18 ms |
34900 KB |
Output is correct |
18 |
Correct |
20 ms |
34972 KB |
Output is correct |
19 |
Correct |
48 ms |
36784 KB |
Output is correct |
20 |
Correct |
56 ms |
36996 KB |
Output is correct |
21 |
Correct |
63 ms |
37284 KB |
Output is correct |
22 |
Correct |
63 ms |
37944 KB |
Output is correct |
23 |
Correct |
115 ms |
44660 KB |
Output is correct |
24 |
Correct |
150 ms |
47944 KB |
Output is correct |
25 |
Correct |
183 ms |
50384 KB |
Output is correct |
26 |
Correct |
219 ms |
52776 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
34772 KB |
Output is correct |
2 |
Correct |
20 ms |
34772 KB |
Output is correct |
3 |
Correct |
20 ms |
34832 KB |
Output is correct |
4 |
Correct |
44 ms |
34896 KB |
Output is correct |
5 |
Correct |
119 ms |
35492 KB |
Output is correct |
6 |
Correct |
18 ms |
34688 KB |
Output is correct |
7 |
Correct |
19 ms |
34900 KB |
Output is correct |
8 |
Correct |
19 ms |
35028 KB |
Output is correct |
9 |
Correct |
20 ms |
35064 KB |
Output is correct |
10 |
Correct |
39 ms |
35368 KB |
Output is correct |
11 |
Correct |
130 ms |
36396 KB |
Output is correct |
12 |
Correct |
27 ms |
37072 KB |
Output is correct |
13 |
Correct |
27 ms |
36980 KB |
Output is correct |
14 |
Correct |
28 ms |
37072 KB |
Output is correct |
15 |
Correct |
54 ms |
37472 KB |
Output is correct |
16 |
Correct |
185 ms |
38200 KB |
Output is correct |
17 |
Correct |
164 ms |
81948 KB |
Output is correct |
18 |
Correct |
159 ms |
81940 KB |
Output is correct |
19 |
Correct |
183 ms |
81896 KB |
Output is correct |
20 |
Correct |
289 ms |
82228 KB |
Output is correct |
21 |
Correct |
461 ms |
90340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
39 ms |
37144 KB |
Output is correct |
2 |
Correct |
67 ms |
37692 KB |
Output is correct |
3 |
Correct |
268 ms |
39324 KB |
Output is correct |
4 |
Correct |
496 ms |
41588 KB |
Output is correct |
5 |
Correct |
171 ms |
66932 KB |
Output is correct |
6 |
Correct |
263 ms |
67816 KB |
Output is correct |
7 |
Correct |
637 ms |
71524 KB |
Output is correct |
8 |
Correct |
1141 ms |
76592 KB |
Output is correct |
9 |
Correct |
910 ms |
226300 KB |
Output is correct |
10 |
Correct |
1110 ms |
227100 KB |
Output is correct |
11 |
Correct |
2021 ms |
230120 KB |
Output is correct |
12 |
Correct |
2484 ms |
234820 KB |
Output is correct |
13 |
Correct |
2086 ms |
444028 KB |
Output is correct |
14 |
Correct |
2366 ms |
445100 KB |
Output is correct |
15 |
Correct |
3672 ms |
449724 KB |
Output is correct |
16 |
Correct |
3867 ms |
450332 KB |
Output is correct |
17 |
Execution timed out |
5089 ms |
486748 KB |
Time limit exceeded |
18 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
5100 ms |
359024 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
34772 KB |
Output is correct |
2 |
Correct |
18 ms |
34796 KB |
Output is correct |
3 |
Correct |
19 ms |
34688 KB |
Output is correct |
4 |
Correct |
18 ms |
34680 KB |
Output is correct |
5 |
Correct |
19 ms |
34680 KB |
Output is correct |
6 |
Correct |
21 ms |
34696 KB |
Output is correct |
7 |
Correct |
20 ms |
34772 KB |
Output is correct |
8 |
Correct |
20 ms |
34788 KB |
Output is correct |
9 |
Correct |
21 ms |
34772 KB |
Output is correct |
10 |
Correct |
19 ms |
34772 KB |
Output is correct |
11 |
Correct |
18 ms |
34844 KB |
Output is correct |
12 |
Correct |
19 ms |
34824 KB |
Output is correct |
13 |
Correct |
20 ms |
34836 KB |
Output is correct |
14 |
Correct |
20 ms |
34900 KB |
Output is correct |
15 |
Correct |
20 ms |
34816 KB |
Output is correct |
16 |
Correct |
19 ms |
34920 KB |
Output is correct |
17 |
Correct |
18 ms |
34900 KB |
Output is correct |
18 |
Correct |
20 ms |
34972 KB |
Output is correct |
19 |
Correct |
48 ms |
36784 KB |
Output is correct |
20 |
Correct |
56 ms |
36996 KB |
Output is correct |
21 |
Correct |
63 ms |
37284 KB |
Output is correct |
22 |
Correct |
63 ms |
37944 KB |
Output is correct |
23 |
Correct |
115 ms |
44660 KB |
Output is correct |
24 |
Correct |
150 ms |
47944 KB |
Output is correct |
25 |
Correct |
183 ms |
50384 KB |
Output is correct |
26 |
Correct |
219 ms |
52776 KB |
Output is correct |
27 |
Correct |
21 ms |
34772 KB |
Output is correct |
28 |
Correct |
20 ms |
34772 KB |
Output is correct |
29 |
Correct |
20 ms |
34832 KB |
Output is correct |
30 |
Correct |
44 ms |
34896 KB |
Output is correct |
31 |
Correct |
119 ms |
35492 KB |
Output is correct |
32 |
Correct |
18 ms |
34688 KB |
Output is correct |
33 |
Correct |
19 ms |
34900 KB |
Output is correct |
34 |
Correct |
19 ms |
35028 KB |
Output is correct |
35 |
Correct |
20 ms |
35064 KB |
Output is correct |
36 |
Correct |
39 ms |
35368 KB |
Output is correct |
37 |
Correct |
130 ms |
36396 KB |
Output is correct |
38 |
Correct |
27 ms |
37072 KB |
Output is correct |
39 |
Correct |
27 ms |
36980 KB |
Output is correct |
40 |
Correct |
28 ms |
37072 KB |
Output is correct |
41 |
Correct |
54 ms |
37472 KB |
Output is correct |
42 |
Correct |
185 ms |
38200 KB |
Output is correct |
43 |
Correct |
164 ms |
81948 KB |
Output is correct |
44 |
Correct |
159 ms |
81940 KB |
Output is correct |
45 |
Correct |
183 ms |
81896 KB |
Output is correct |
46 |
Correct |
289 ms |
82228 KB |
Output is correct |
47 |
Correct |
461 ms |
90340 KB |
Output is correct |
48 |
Correct |
39 ms |
37144 KB |
Output is correct |
49 |
Correct |
67 ms |
37692 KB |
Output is correct |
50 |
Correct |
268 ms |
39324 KB |
Output is correct |
51 |
Correct |
496 ms |
41588 KB |
Output is correct |
52 |
Correct |
171 ms |
66932 KB |
Output is correct |
53 |
Correct |
263 ms |
67816 KB |
Output is correct |
54 |
Correct |
637 ms |
71524 KB |
Output is correct |
55 |
Correct |
1141 ms |
76592 KB |
Output is correct |
56 |
Correct |
910 ms |
226300 KB |
Output is correct |
57 |
Correct |
1110 ms |
227100 KB |
Output is correct |
58 |
Correct |
2021 ms |
230120 KB |
Output is correct |
59 |
Correct |
2484 ms |
234820 KB |
Output is correct |
60 |
Correct |
2086 ms |
444028 KB |
Output is correct |
61 |
Correct |
2366 ms |
445100 KB |
Output is correct |
62 |
Correct |
3672 ms |
449724 KB |
Output is correct |
63 |
Correct |
3867 ms |
450332 KB |
Output is correct |
64 |
Execution timed out |
5089 ms |
486748 KB |
Time limit exceeded |
65 |
Halted |
0 ms |
0 KB |
- |