#include <bits/stdc++.h>
#pragma GCC optimize("O3,no-stack-protector,unroll-loops")
#pragma GCC target("avx2,fma")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
typedef pair<long double,long double> pld;
const long long int N = 1e5+10,mod = 1e9+7,inf = 1e9,sq = 700,sig = 26;
inline int mkay(int a,int b){
if (a+b >= mod) return a+b-mod;
if (a+b < 0) return a+b+mod;
return a+b;
}
inline int poww(int n,int k){
int c = 1;
while (k){
if (k&1) c = (1ll*c*n)%mod;
n = (1ll*n*n)%mod;
k >>= 1;
}
return c;
}
vector<pll> adj[N];
ll e[N];
ll h[N];
int dfs(int v,int p){
ll mx = h[v];
int w = v;
for (pll u : adj[v]){
if(u.X == p) continue;
h[u.X] = h[v]+e[u.Y];
int x = dfs(u.X,v);
if (h[x] > mx){
mx = h[x];
w = x;
}
}
return w;
}
int main(){
ios :: sync_with_stdio(0); cin.tie(0);cout.tie(0);
int n,q;
ll w;
cin >> n >> q >> w;
rep(i,0,n-1){
int u,v;
ll d;
cin >> u >> v >> d;
e[i] = d;
adj[u].pb({v,i});
adj[v].pb({u,i});
}
ll last = 0;
while (q--){
int d;
ll x;
cin >> d >> x;
d = (d+last)%(n-1);
x = (x+last)%w;
e[d] = x;
h[1] = 0;
int u = dfs(1,-1);
h[u] = 0;
int v = dfs(u,-1);
cout << h[v] << endl;
last = h[v];
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2636 KB |
Output is correct |
2 |
Correct |
1 ms |
2636 KB |
Output is correct |
3 |
Correct |
1 ms |
2636 KB |
Output is correct |
4 |
Correct |
1 ms |
2636 KB |
Output is correct |
5 |
Correct |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2668 KB |
Output is correct |
7 |
Correct |
2 ms |
2636 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
2 ms |
2636 KB |
Output is correct |
11 |
Correct |
2 ms |
2636 KB |
Output is correct |
12 |
Correct |
2 ms |
2636 KB |
Output is correct |
13 |
Correct |
2 ms |
2636 KB |
Output is correct |
14 |
Correct |
2 ms |
2636 KB |
Output is correct |
15 |
Correct |
2 ms |
2636 KB |
Output is correct |
16 |
Correct |
2 ms |
2592 KB |
Output is correct |
17 |
Correct |
2 ms |
2636 KB |
Output is correct |
18 |
Correct |
2 ms |
2636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2636 KB |
Output is correct |
2 |
Correct |
1 ms |
2636 KB |
Output is correct |
3 |
Correct |
1 ms |
2636 KB |
Output is correct |
4 |
Correct |
1 ms |
2636 KB |
Output is correct |
5 |
Correct |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2668 KB |
Output is correct |
7 |
Correct |
2 ms |
2636 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
2 ms |
2636 KB |
Output is correct |
11 |
Correct |
2 ms |
2636 KB |
Output is correct |
12 |
Correct |
2 ms |
2636 KB |
Output is correct |
13 |
Correct |
2 ms |
2636 KB |
Output is correct |
14 |
Correct |
2 ms |
2636 KB |
Output is correct |
15 |
Correct |
2 ms |
2636 KB |
Output is correct |
16 |
Correct |
2 ms |
2592 KB |
Output is correct |
17 |
Correct |
2 ms |
2636 KB |
Output is correct |
18 |
Correct |
2 ms |
2636 KB |
Output is correct |
19 |
Correct |
189 ms |
2796 KB |
Output is correct |
20 |
Correct |
184 ms |
2904 KB |
Output is correct |
21 |
Correct |
178 ms |
2796 KB |
Output is correct |
22 |
Correct |
179 ms |
2816 KB |
Output is correct |
23 |
Correct |
1359 ms |
3200 KB |
Output is correct |
24 |
Correct |
1397 ms |
3180 KB |
Output is correct |
25 |
Correct |
1427 ms |
3108 KB |
Output is correct |
26 |
Correct |
1361 ms |
3364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
3 ms |
2636 KB |
Output is correct |
4 |
Correct |
15 ms |
2848 KB |
Output is correct |
5 |
Correct |
54 ms |
3100 KB |
Output is correct |
6 |
Correct |
1 ms |
2636 KB |
Output is correct |
7 |
Correct |
2 ms |
2636 KB |
Output is correct |
8 |
Correct |
3 ms |
2636 KB |
Output is correct |
9 |
Correct |
15 ms |
2680 KB |
Output is correct |
10 |
Correct |
134 ms |
2816 KB |
Output is correct |
11 |
Correct |
620 ms |
3280 KB |
Output is correct |
12 |
Correct |
4 ms |
2892 KB |
Output is correct |
13 |
Correct |
21 ms |
3000 KB |
Output is correct |
14 |
Correct |
128 ms |
3024 KB |
Output is correct |
15 |
Correct |
1222 ms |
3276 KB |
Output is correct |
16 |
Execution timed out |
5057 ms |
3688 KB |
Time limit exceeded |
17 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
2636 KB |
Output is correct |
2 |
Correct |
230 ms |
2756 KB |
Output is correct |
3 |
Correct |
1102 ms |
2968 KB |
Output is correct |
4 |
Correct |
2199 ms |
3348 KB |
Output is correct |
5 |
Correct |
257 ms |
3324 KB |
Output is correct |
6 |
Correct |
2482 ms |
3208 KB |
Output is correct |
7 |
Execution timed out |
5053 ms |
3420 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5073 ms |
8036 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2636 KB |
Output is correct |
2 |
Correct |
1 ms |
2636 KB |
Output is correct |
3 |
Correct |
1 ms |
2636 KB |
Output is correct |
4 |
Correct |
1 ms |
2636 KB |
Output is correct |
5 |
Correct |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2668 KB |
Output is correct |
7 |
Correct |
2 ms |
2636 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
2 ms |
2636 KB |
Output is correct |
11 |
Correct |
2 ms |
2636 KB |
Output is correct |
12 |
Correct |
2 ms |
2636 KB |
Output is correct |
13 |
Correct |
2 ms |
2636 KB |
Output is correct |
14 |
Correct |
2 ms |
2636 KB |
Output is correct |
15 |
Correct |
2 ms |
2636 KB |
Output is correct |
16 |
Correct |
2 ms |
2592 KB |
Output is correct |
17 |
Correct |
2 ms |
2636 KB |
Output is correct |
18 |
Correct |
2 ms |
2636 KB |
Output is correct |
19 |
Correct |
189 ms |
2796 KB |
Output is correct |
20 |
Correct |
184 ms |
2904 KB |
Output is correct |
21 |
Correct |
178 ms |
2796 KB |
Output is correct |
22 |
Correct |
179 ms |
2816 KB |
Output is correct |
23 |
Correct |
1359 ms |
3200 KB |
Output is correct |
24 |
Correct |
1397 ms |
3180 KB |
Output is correct |
25 |
Correct |
1427 ms |
3108 KB |
Output is correct |
26 |
Correct |
1361 ms |
3364 KB |
Output is correct |
27 |
Correct |
2 ms |
2636 KB |
Output is correct |
28 |
Correct |
2 ms |
2636 KB |
Output is correct |
29 |
Correct |
3 ms |
2636 KB |
Output is correct |
30 |
Correct |
15 ms |
2848 KB |
Output is correct |
31 |
Correct |
54 ms |
3100 KB |
Output is correct |
32 |
Correct |
1 ms |
2636 KB |
Output is correct |
33 |
Correct |
2 ms |
2636 KB |
Output is correct |
34 |
Correct |
3 ms |
2636 KB |
Output is correct |
35 |
Correct |
15 ms |
2680 KB |
Output is correct |
36 |
Correct |
134 ms |
2816 KB |
Output is correct |
37 |
Correct |
620 ms |
3280 KB |
Output is correct |
38 |
Correct |
4 ms |
2892 KB |
Output is correct |
39 |
Correct |
21 ms |
3000 KB |
Output is correct |
40 |
Correct |
128 ms |
3024 KB |
Output is correct |
41 |
Correct |
1222 ms |
3276 KB |
Output is correct |
42 |
Execution timed out |
5057 ms |
3688 KB |
Time limit exceeded |
43 |
Halted |
0 ms |
0 KB |
- |