#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 5;
vector<pair<pair<int , int> , int> > edge;
vector<pair<int , int> > g[N];
int level[N] , d , e , n , q , w , last;
void dfs(int ver , int par){
for(auto i : g[ver]){
int uu = i.first , ww = i.second;
if(uu == par) continue;
level[uu] = level[ver] + ww;
dfs(uu , ver);
}
}
void cal(){
for(int i = 1 ; i <= n ; i++) g[i].clear();
for(auto i : edge){
int U = i.first.first , V = i.first.second , W = i.second;
g[U].push_back({V , W});
g[V].push_back({U , W});
}
dfs(1 , 0);
int mx = 0 , vr = 1;
for(int i = 1 ; i <= n ; i++){
if(mx < level[i]){
mx = level[i];
vr = i;
}
}
level[vr] = 0;
dfs(vr , 0);
mx = 0;
for(int i = 1 ; i <= n ; i++)
mx = max(mx , level[i]);
cout << mx << '\n';
last = mx;
return;
}
void solve1(){
while(q--){
cin >> d >> e;
d = (d + last) % (n - 1);
e = (e + last) % w;
pair<pair<int , int> , int> p;
p = edge[d];
p.second = e;
swap(edge[d] , p);
cal();
}
}
int32_t main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> q >> w;
for(int i = 0 ; i < n - 1 ; i++){
int U , V , W;
cin >> U >> V >> W;
g[U].push_back({V , W});
g[V].push_back({U , W});
edge.push_back({{U , V} , W});
}
if(n <= 5000 && q <= 5000){
solve1();
return 0;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2680 KB |
Output is correct |
4 |
Correct |
2 ms |
2680 KB |
Output is correct |
5 |
Correct |
2 ms |
2676 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2676 KB |
Output is correct |
9 |
Correct |
2 ms |
2644 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
2 ms |
2644 KB |
Output is correct |
12 |
Correct |
2 ms |
2644 KB |
Output is correct |
13 |
Correct |
2 ms |
2644 KB |
Output is correct |
14 |
Correct |
2 ms |
2644 KB |
Output is correct |
15 |
Correct |
2 ms |
2644 KB |
Output is correct |
16 |
Correct |
2 ms |
2644 KB |
Output is correct |
17 |
Correct |
3 ms |
2644 KB |
Output is correct |
18 |
Correct |
3 ms |
2676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2680 KB |
Output is correct |
4 |
Correct |
2 ms |
2680 KB |
Output is correct |
5 |
Correct |
2 ms |
2676 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2676 KB |
Output is correct |
9 |
Correct |
2 ms |
2644 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
2 ms |
2644 KB |
Output is correct |
12 |
Correct |
2 ms |
2644 KB |
Output is correct |
13 |
Correct |
2 ms |
2644 KB |
Output is correct |
14 |
Correct |
2 ms |
2644 KB |
Output is correct |
15 |
Correct |
2 ms |
2644 KB |
Output is correct |
16 |
Correct |
2 ms |
2644 KB |
Output is correct |
17 |
Correct |
3 ms |
2644 KB |
Output is correct |
18 |
Correct |
3 ms |
2676 KB |
Output is correct |
19 |
Correct |
248 ms |
2800 KB |
Output is correct |
20 |
Correct |
243 ms |
2804 KB |
Output is correct |
21 |
Correct |
255 ms |
2828 KB |
Output is correct |
22 |
Correct |
250 ms |
2860 KB |
Output is correct |
23 |
Correct |
1588 ms |
3280 KB |
Output is correct |
24 |
Correct |
1770 ms |
3416 KB |
Output is correct |
25 |
Correct |
1717 ms |
3456 KB |
Output is correct |
26 |
Correct |
1661 ms |
3464 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
4 ms |
2644 KB |
Output is correct |
4 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
37 ms |
2772 KB |
Output is correct |
2 |
Incorrect |
2 ms |
2772 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
63 ms |
12436 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2680 KB |
Output is correct |
4 |
Correct |
2 ms |
2680 KB |
Output is correct |
5 |
Correct |
2 ms |
2676 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
2 ms |
2676 KB |
Output is correct |
9 |
Correct |
2 ms |
2644 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
2 ms |
2644 KB |
Output is correct |
12 |
Correct |
2 ms |
2644 KB |
Output is correct |
13 |
Correct |
2 ms |
2644 KB |
Output is correct |
14 |
Correct |
2 ms |
2644 KB |
Output is correct |
15 |
Correct |
2 ms |
2644 KB |
Output is correct |
16 |
Correct |
2 ms |
2644 KB |
Output is correct |
17 |
Correct |
3 ms |
2644 KB |
Output is correct |
18 |
Correct |
3 ms |
2676 KB |
Output is correct |
19 |
Correct |
248 ms |
2800 KB |
Output is correct |
20 |
Correct |
243 ms |
2804 KB |
Output is correct |
21 |
Correct |
255 ms |
2828 KB |
Output is correct |
22 |
Correct |
250 ms |
2860 KB |
Output is correct |
23 |
Correct |
1588 ms |
3280 KB |
Output is correct |
24 |
Correct |
1770 ms |
3416 KB |
Output is correct |
25 |
Correct |
1717 ms |
3456 KB |
Output is correct |
26 |
Correct |
1661 ms |
3464 KB |
Output is correct |
27 |
Correct |
2 ms |
2644 KB |
Output is correct |
28 |
Correct |
2 ms |
2644 KB |
Output is correct |
29 |
Correct |
4 ms |
2644 KB |
Output is correct |
30 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
31 |
Halted |
0 ms |
0 KB |
- |