#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;
void init(int n, int q, ll l, vector<int> u, vector<int> v, vector<ll> w) {
pa.resize(n-1);
adj.resize(n);
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]});
}
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;
}
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() {
ios::sync_with_stdio(false);
cin.tie(0);
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';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
312 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
312 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 |
1 ms |
204 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 |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
312 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
312 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 |
1 ms |
204 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 |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
590 ms |
500 KB |
Output is correct |
20 |
Correct |
603 ms |
452 KB |
Output is correct |
21 |
Correct |
607 ms |
512 KB |
Output is correct |
22 |
Correct |
562 ms |
820 KB |
Output is correct |
23 |
Correct |
4005 ms |
1100 KB |
Output is correct |
24 |
Correct |
4141 ms |
1224 KB |
Output is correct |
25 |
Correct |
4129 ms |
1236 KB |
Output is correct |
26 |
Correct |
4128 ms |
1420 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
312 KB |
Output is correct |
3 |
Correct |
3 ms |
312 KB |
Output is correct |
4 |
Correct |
25 ms |
484 KB |
Output is correct |
5 |
Correct |
117 ms |
1368 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
2 ms |
332 KB |
Output is correct |
8 |
Correct |
10 ms |
384 KB |
Output is correct |
9 |
Correct |
104 ms |
384 KB |
Output is correct |
10 |
Correct |
1129 ms |
672 KB |
Output is correct |
11 |
Execution timed out |
5050 ms |
1800 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
103 ms |
460 KB |
Output is correct |
2 |
Correct |
1014 ms |
584 KB |
Output is correct |
3 |
Execution timed out |
5035 ms |
1108 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5074 ms |
15648 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
312 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
312 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 |
1 ms |
204 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 |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
590 ms |
500 KB |
Output is correct |
20 |
Correct |
603 ms |
452 KB |
Output is correct |
21 |
Correct |
607 ms |
512 KB |
Output is correct |
22 |
Correct |
562 ms |
820 KB |
Output is correct |
23 |
Correct |
4005 ms |
1100 KB |
Output is correct |
24 |
Correct |
4141 ms |
1224 KB |
Output is correct |
25 |
Correct |
4129 ms |
1236 KB |
Output is correct |
26 |
Correct |
4128 ms |
1420 KB |
Output is correct |
27 |
Correct |
1 ms |
204 KB |
Output is correct |
28 |
Correct |
1 ms |
312 KB |
Output is correct |
29 |
Correct |
3 ms |
312 KB |
Output is correct |
30 |
Correct |
25 ms |
484 KB |
Output is correct |
31 |
Correct |
117 ms |
1368 KB |
Output is correct |
32 |
Correct |
0 ms |
204 KB |
Output is correct |
33 |
Correct |
2 ms |
332 KB |
Output is correct |
34 |
Correct |
10 ms |
384 KB |
Output is correct |
35 |
Correct |
104 ms |
384 KB |
Output is correct |
36 |
Correct |
1129 ms |
672 KB |
Output is correct |
37 |
Execution timed out |
5050 ms |
1800 KB |
Time limit exceeded |
38 |
Halted |
0 ms |
0 KB |
- |