#include<algorithm>
#include<iostream>
#include<cassert>
#include<vector>
#include<string>
#include<array>
#include<stack>
#include<queue>
#include<map>
#include<set>
using namespace std;
#define V vector
#define Int long long
#define rep(i,a,b) for(int i=(int)(a); i<(int)(b); i++)
#define nl '\n'
#define dbg(x) cout << "?" << #x << " : " << x << endl;
#define all(x) (x).begin(), (x).end()
#define int long long
#define pii pair<int,int>
const int N = 1e5+5;
int n, q, wlim;
V<array<int,3>> edges;
V<pair<int,int>> queries;
struct Sub1{
V<int> adj[N];
int mxdist = 0, mxnode = -1;
void dfs(int x,int par=-1,int dist=0){
if(dist >= mxdist){
mxdist = dist;
mxnode = x;
}
for(int id : adj[x]){
int y = edges[id][0]^edges[id][1]^x;
int w = edges[id][2];
if(y==par) continue;
dfs(y,x, dist+w);
}
}
void run(){
rep(i,0,n-1){
auto[u,v,w] = edges[i];
adj[u].push_back(i);
adj[v].push_back(i);
}
int last = 0;
for(auto[i,w] : queries){
i = (i+last)%(n-1);
w = (w+last)%wlim;
edges[i][2] = w;
mxdist = 0;
dfs(1);
dfs(mxnode);
cout << mxdist << nl;
last = mxdist;
}
}
};
signed main(){
cin >> n >> q >> wlim;
rep(i,0,n-1){
int u, v, w;
cin >> u >> v >> w;
edges.push_back({u,v,w});
}
rep(i,0,q){
int idx, w;
cin >> idx >> w;
queries.push_back({idx,w});
}
Sub1 sub; sub.run(); 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 |
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 |
2588 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 |
2 ms |
2644 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 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 |
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 |
2588 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 |
2 ms |
2644 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
19 |
Correct |
188 ms |
2900 KB |
Output is correct |
20 |
Correct |
218 ms |
2892 KB |
Output is correct |
21 |
Correct |
204 ms |
2896 KB |
Output is correct |
22 |
Correct |
255 ms |
2936 KB |
Output is correct |
23 |
Correct |
1459 ms |
3084 KB |
Output is correct |
24 |
Correct |
1591 ms |
3184 KB |
Output is correct |
25 |
Correct |
1615 ms |
3096 KB |
Output is correct |
26 |
Correct |
1787 ms |
3456 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
3 ms |
2644 KB |
Output is correct |
4 |
Correct |
19 ms |
3204 KB |
Output is correct |
5 |
Correct |
95 ms |
4760 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
6 ms |
2644 KB |
Output is correct |
9 |
Correct |
22 ms |
2724 KB |
Output is correct |
10 |
Correct |
222 ms |
3280 KB |
Output is correct |
11 |
Correct |
1004 ms |
4800 KB |
Output is correct |
12 |
Correct |
8 ms |
2900 KB |
Output is correct |
13 |
Correct |
29 ms |
2964 KB |
Output is correct |
14 |
Correct |
183 ms |
2992 KB |
Output is correct |
15 |
Correct |
1815 ms |
3484 KB |
Output is correct |
16 |
Execution timed out |
5064 ms |
4864 KB |
Time limit exceeded |
17 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
2732 KB |
Output is correct |
2 |
Correct |
227 ms |
3028 KB |
Output is correct |
3 |
Correct |
1006 ms |
3740 KB |
Output is correct |
4 |
Correct |
2005 ms |
4804 KB |
Output is correct |
5 |
Correct |
233 ms |
3288 KB |
Output is correct |
6 |
Correct |
2282 ms |
3600 KB |
Output is correct |
7 |
Execution timed out |
5042 ms |
4600 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5059 ms |
10168 KB |
Time limit exceeded |
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 |
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 |
2588 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 |
2 ms |
2644 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
19 |
Correct |
188 ms |
2900 KB |
Output is correct |
20 |
Correct |
218 ms |
2892 KB |
Output is correct |
21 |
Correct |
204 ms |
2896 KB |
Output is correct |
22 |
Correct |
255 ms |
2936 KB |
Output is correct |
23 |
Correct |
1459 ms |
3084 KB |
Output is correct |
24 |
Correct |
1591 ms |
3184 KB |
Output is correct |
25 |
Correct |
1615 ms |
3096 KB |
Output is correct |
26 |
Correct |
1787 ms |
3456 KB |
Output is correct |
27 |
Correct |
1 ms |
2644 KB |
Output is correct |
28 |
Correct |
2 ms |
2644 KB |
Output is correct |
29 |
Correct |
3 ms |
2644 KB |
Output is correct |
30 |
Correct |
19 ms |
3204 KB |
Output is correct |
31 |
Correct |
95 ms |
4760 KB |
Output is correct |
32 |
Correct |
2 ms |
2644 KB |
Output is correct |
33 |
Correct |
2 ms |
2644 KB |
Output is correct |
34 |
Correct |
6 ms |
2644 KB |
Output is correct |
35 |
Correct |
22 ms |
2724 KB |
Output is correct |
36 |
Correct |
222 ms |
3280 KB |
Output is correct |
37 |
Correct |
1004 ms |
4800 KB |
Output is correct |
38 |
Correct |
8 ms |
2900 KB |
Output is correct |
39 |
Correct |
29 ms |
2964 KB |
Output is correct |
40 |
Correct |
183 ms |
2992 KB |
Output is correct |
41 |
Correct |
1815 ms |
3484 KB |
Output is correct |
42 |
Execution timed out |
5064 ms |
4864 KB |
Time limit exceeded |
43 |
Halted |
0 ms |
0 KB |
- |