#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<pair<int, ll>>> adj;
vector<pair<int, int>> pa;
vector<pair<int, ll>> dist;
bool isStar = false;
multiset<ll> s;
void init(int n, int q, ll l, vector<int> u, vector<int> v, vector<ll> w) {
pa.resize(n-1);
adj.resize(n);
s.insert(0);
for(int i = 0; i < n-1; i++) {
u[i]--; v[i]--;
pa[i] = {u[i], v[i]};
adj[u[i]].push_back({v[i], w[i]});
adj[v[i]].push_back({u[i], w[i]});
}
if(adj[0].size() == n-1) { // subtask 3
isStar = true;
s.insert(0);
for(int i = 0; i < n-1; i++) {
s.insert(w[i]);
}
}
for(int i = 0; i < n; i++) sort(adj[i].begin(), adj[i].end());
dist.resize(n);
}
void dfs(int n, ll dis = 0, int par = -1) {
dist[n] = {dis, n};
for(auto ch : adj[n]) {
if(ch.first == par) continue;
dfs(ch.first, dis + ch.second, n);
}
}
ll get_diameter(int d, ll e) {
int x, y;
tie(x, y) = pa[d];
int l = 0, r = adj[x].size();
while(l != r-1) {
int mid = (l+r)/2;
if(adj[x][mid].first <= y) l = mid;
else r = mid;
}
adj[x][l].second = e;
l = 0; r = adj[y].size();
while(l != r-1) {
int mid = (l+r)/2;
if(adj[y][mid].first <= x) l = mid;
else r = mid;
}
if(isStar) {
auto it = s.find(adj[y][l].second);
s.erase(it);
s.insert(e);
it = s.end();
it--;
ll ans = *it;
it--;
adj[y][l].second = e;
if(isStar) return (ans + (*it));
}
adj[y][l].second = e;
dfs(0);
sort(dist.rbegin(), dist.rend());
dfs(dist[0].second);
sort(dist.rbegin(), dist.rend());
return dist[0].first;
}
int main() {
int n, q;
ll l;
cin >> n >> q >> l;
vector<int> u(n-1), v(n-1);
vector<ll> w(n-1);
for(int i = 0; i < n-1; i++) {
cin >> u[i] >> v[i] >> w[i];
}
init(n, q, l, u, v, w);
ll last = 0;
for(int i = 0; i < q; i++) {
ll d, e;
cin >> d >> e;
d += last;
d %= n-1;
e += last;
e %= l;
last = get_diameter(d, e);
cout << last << '\n';
}
}
Compilation message
diameter.cpp: In function 'void init(int, int, ll, std::vector<int>, std::vector<int>, std::vector<long long int>)':
diameter.cpp:22:22: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
22 | if(adj[0].size() == n-1) { // subtask 3
| ~~~~~~~~~~~~~~^~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
2 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
2 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
2 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
2 ms |
256 KB |
Output is correct |
19 |
Correct |
592 ms |
544 KB |
Output is correct |
20 |
Correct |
603 ms |
420 KB |
Output is correct |
21 |
Correct |
616 ms |
436 KB |
Output is correct |
22 |
Correct |
568 ms |
580 KB |
Output is correct |
23 |
Correct |
4019 ms |
1072 KB |
Output is correct |
24 |
Correct |
4011 ms |
968 KB |
Output is correct |
25 |
Correct |
4034 ms |
1004 KB |
Output is correct |
26 |
Correct |
4091 ms |
1200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
4 ms |
204 KB |
Output is correct |
4 |
Correct |
36 ms |
352 KB |
Output is correct |
5 |
Correct |
185 ms |
612 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
5 ms |
332 KB |
Output is correct |
10 |
Correct |
38 ms |
412 KB |
Output is correct |
11 |
Correct |
188 ms |
832 KB |
Output is correct |
12 |
Correct |
5 ms |
1196 KB |
Output is correct |
13 |
Correct |
6 ms |
1092 KB |
Output is correct |
14 |
Correct |
9 ms |
1228 KB |
Output is correct |
15 |
Correct |
53 ms |
1424 KB |
Output is correct |
16 |
Correct |
209 ms |
2532 KB |
Output is correct |
17 |
Correct |
98 ms |
18716 KB |
Output is correct |
18 |
Correct |
102 ms |
18696 KB |
Output is correct |
19 |
Correct |
103 ms |
18740 KB |
Output is correct |
20 |
Correct |
148 ms |
18848 KB |
Output is correct |
21 |
Correct |
401 ms |
18852 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
102 ms |
412 KB |
Output is correct |
2 |
Correct |
1020 ms |
688 KB |
Output is correct |
3 |
Execution timed out |
5010 ms |
864 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5079 ms |
13252 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
2 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
2 ms |
256 KB |
Output is correct |
19 |
Correct |
592 ms |
544 KB |
Output is correct |
20 |
Correct |
603 ms |
420 KB |
Output is correct |
21 |
Correct |
616 ms |
436 KB |
Output is correct |
22 |
Correct |
568 ms |
580 KB |
Output is correct |
23 |
Correct |
4019 ms |
1072 KB |
Output is correct |
24 |
Correct |
4011 ms |
968 KB |
Output is correct |
25 |
Correct |
4034 ms |
1004 KB |
Output is correct |
26 |
Correct |
4091 ms |
1200 KB |
Output is correct |
27 |
Correct |
0 ms |
204 KB |
Output is correct |
28 |
Correct |
1 ms |
204 KB |
Output is correct |
29 |
Correct |
4 ms |
204 KB |
Output is correct |
30 |
Correct |
36 ms |
352 KB |
Output is correct |
31 |
Correct |
185 ms |
612 KB |
Output is correct |
32 |
Correct |
0 ms |
204 KB |
Output is correct |
33 |
Correct |
1 ms |
332 KB |
Output is correct |
34 |
Correct |
1 ms |
332 KB |
Output is correct |
35 |
Correct |
5 ms |
332 KB |
Output is correct |
36 |
Correct |
38 ms |
412 KB |
Output is correct |
37 |
Correct |
188 ms |
832 KB |
Output is correct |
38 |
Correct |
5 ms |
1196 KB |
Output is correct |
39 |
Correct |
6 ms |
1092 KB |
Output is correct |
40 |
Correct |
9 ms |
1228 KB |
Output is correct |
41 |
Correct |
53 ms |
1424 KB |
Output is correct |
42 |
Correct |
209 ms |
2532 KB |
Output is correct |
43 |
Correct |
98 ms |
18716 KB |
Output is correct |
44 |
Correct |
102 ms |
18696 KB |
Output is correct |
45 |
Correct |
103 ms |
18740 KB |
Output is correct |
46 |
Correct |
148 ms |
18848 KB |
Output is correct |
47 |
Correct |
401 ms |
18852 KB |
Output is correct |
48 |
Correct |
102 ms |
412 KB |
Output is correct |
49 |
Correct |
1020 ms |
688 KB |
Output is correct |
50 |
Execution timed out |
5010 ms |
864 KB |
Time limit exceeded |
51 |
Halted |
0 ms |
0 KB |
- |