#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 , star = -1;
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();
}
}
void solve2(){
multiset<int , greater<int>> st;
for(auto i : edge)
st.insert(i.second);
while(q--){
cin >> d >> e;
d = (d + last) % (n - 1);
e = (e + last) % w;
st.erase(st.find(edge[d].second));
pair<pair<int , int> , int> p;
p = edge[d];
p.second = e;
swap(edge[d] , p);
st.insert(e);
last = *st.begin() + *next(st.begin());
cout << last << '\n';
}
}
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(g[U].size() == n - 1) star = U;
if(g[V].size() == n - 1) star = V;
}
if(n <= 5000 && q <= 5000){
solve1();
return 0;
}
if(star != -1){
solve2();
return 0;
}
return 0;
}
Compilation message
diameter.cpp: In function 'int32_t main()':
diameter.cpp:93:18: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
93 | if(g[U].size() == n - 1) star = U;
| ~~~~~~~~~~~~^~~~~~~~
diameter.cpp:94:18: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
94 | if(g[V].size() == n - 1) star = V;
| ~~~~~~~~~~~~^~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2644 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
2 ms |
2644 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 |
2644 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 |
3 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 |
3 ms |
2644 KB |
Output is correct |
17 |
Correct |
3 ms |
2644 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2644 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
2 ms |
2644 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 |
2644 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 |
3 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 |
3 ms |
2644 KB |
Output is correct |
17 |
Correct |
3 ms |
2644 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
19 |
Correct |
242 ms |
2764 KB |
Output is correct |
20 |
Correct |
248 ms |
2772 KB |
Output is correct |
21 |
Correct |
246 ms |
2780 KB |
Output is correct |
22 |
Correct |
261 ms |
2916 KB |
Output is correct |
23 |
Correct |
1663 ms |
3272 KB |
Output is correct |
24 |
Correct |
1758 ms |
3188 KB |
Output is correct |
25 |
Correct |
1753 ms |
3300 KB |
Output is correct |
26 |
Correct |
1712 ms |
3428 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
4 ms |
2692 KB |
Output is correct |
4 |
Correct |
8 ms |
2764 KB |
Output is correct |
5 |
Correct |
32 ms |
3796 KB |
Output is correct |
6 |
Correct |
2 ms |
2676 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
5 ms |
2644 KB |
Output is correct |
9 |
Correct |
39 ms |
2748 KB |
Output is correct |
10 |
Correct |
9 ms |
3028 KB |
Output is correct |
11 |
Correct |
38 ms |
4044 KB |
Output is correct |
12 |
Correct |
4 ms |
3284 KB |
Output is correct |
13 |
Correct |
4 ms |
3284 KB |
Output is correct |
14 |
Correct |
7 ms |
3336 KB |
Output is correct |
15 |
Correct |
19 ms |
3576 KB |
Output is correct |
16 |
Correct |
49 ms |
4740 KB |
Output is correct |
17 |
Correct |
56 ms |
15532 KB |
Output is correct |
18 |
Correct |
59 ms |
15532 KB |
Output is correct |
19 |
Correct |
64 ms |
15568 KB |
Output is correct |
20 |
Correct |
74 ms |
15928 KB |
Output is correct |
21 |
Correct |
146 ms |
17284 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
37 ms |
2764 KB |
Output is correct |
2 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
62 ms |
10212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2644 KB |
Output is correct |
4 |
Correct |
2 ms |
2644 KB |
Output is correct |
5 |
Correct |
2 ms |
2644 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 |
2644 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 |
3 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 |
3 ms |
2644 KB |
Output is correct |
17 |
Correct |
3 ms |
2644 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
19 |
Correct |
242 ms |
2764 KB |
Output is correct |
20 |
Correct |
248 ms |
2772 KB |
Output is correct |
21 |
Correct |
246 ms |
2780 KB |
Output is correct |
22 |
Correct |
261 ms |
2916 KB |
Output is correct |
23 |
Correct |
1663 ms |
3272 KB |
Output is correct |
24 |
Correct |
1758 ms |
3188 KB |
Output is correct |
25 |
Correct |
1753 ms |
3300 KB |
Output is correct |
26 |
Correct |
1712 ms |
3428 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 |
2692 KB |
Output is correct |
30 |
Correct |
8 ms |
2764 KB |
Output is correct |
31 |
Correct |
32 ms |
3796 KB |
Output is correct |
32 |
Correct |
2 ms |
2676 KB |
Output is correct |
33 |
Correct |
2 ms |
2644 KB |
Output is correct |
34 |
Correct |
5 ms |
2644 KB |
Output is correct |
35 |
Correct |
39 ms |
2748 KB |
Output is correct |
36 |
Correct |
9 ms |
3028 KB |
Output is correct |
37 |
Correct |
38 ms |
4044 KB |
Output is correct |
38 |
Correct |
4 ms |
3284 KB |
Output is correct |
39 |
Correct |
4 ms |
3284 KB |
Output is correct |
40 |
Correct |
7 ms |
3336 KB |
Output is correct |
41 |
Correct |
19 ms |
3576 KB |
Output is correct |
42 |
Correct |
49 ms |
4740 KB |
Output is correct |
43 |
Correct |
56 ms |
15532 KB |
Output is correct |
44 |
Correct |
59 ms |
15532 KB |
Output is correct |
45 |
Correct |
64 ms |
15568 KB |
Output is correct |
46 |
Correct |
74 ms |
15928 KB |
Output is correct |
47 |
Correct |
146 ms |
17284 KB |
Output is correct |
48 |
Correct |
37 ms |
2764 KB |
Output is correct |
49 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
50 |
Halted |
0 ms |
0 KB |
- |