#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
#define printl(args...) printf(args)
#else
#define printl(args...) 0
#endif
int n,q;
int timer;
ll w[100005];
pair<int,int>edge[100005];
vector<pair<int,int>>g[100005];
bool vis[100005];
int sz[100005];
int par[100005];
int depth[100005];
void build_sz(int v,int p){
sz[v]=1;
for(auto &to:g[v])if((to.fr^p)&&(!vis[to.fr])){
build_sz(to.fr,v);
sz[v]+=sz[to.fr];
}
}
int centroid(int v,int p,int sz){
bool can;
while(true){
can=true;
for(auto &to:g[v])if((to.fr^p)&&(!vis[to.fr])){
if(::sz[to.fr]>sz){
can=false;
p=v;
v=to.fr;
break;
}
}
if(can)return v;
}
}
void build(int v,int p,int dep){
build_sz(v,0);
v=centroid(v,0,sz[v]>>1);
par[v]=p;
depth[v]=dep;
vis[v]=true;
for(auto &to:g[v])if(!vis[to.fr])build(to.fr,v,dep+1);
}
ll ans;
struct SegmentTree{
vector<ll>vec;
int n;
SegmentTree(int _n){
n=_n;
vec.assign(n<<2|3,0ll);
}
};
ll alls[100005];
ll go(int v,int p,int &pivot,ll depth){
ll mx=depth;
if(!p){
ll m1=0,m2=0;
for(auto &to:g[v])if((to.fr^p)&&::depth[to.fr]>pivot){
ll cur=go(to.fr,v,pivot,depth+w[to.sc]);
umax(mx,cur);
if(cur>m1){
m2=m1;
m1=cur;
}else if(cur>m2)m2=cur;
}
mx=m1+m2;
}else for(auto &to:g[v])if((to.fr^p)&&::depth[to.fr]>pivot)umax(mx,go(to.fr,v,pivot,depth+w[to.sc]));
return mx;
}
int main(){
scanf("%d%d%lld",&n,&q,&w[0]);
for(int i=1;i^n;i++){
scanf("%d%d%lld",&edge[i].fr,&edge[i].sc,&w[i]);
g[edge[i].fr].emplace_back(edge[i].sc,i);
g[edge[i].sc].emplace_back(edge[i].fr,i);
}
build(1,0,0);
for(int i=1;i^n;i++)if(depth[edge[i].fr]>depth[edge[i].sc])swap(edge[i].fr,edge[i].sc);
for(int i=1;i<=n;i++)alls[i]=go(i,0,depth[i],0);
while(q--){
ll x;
ll y;
scanf("%lld%lld",&x,&y);
x=(x+ans)%(n-1)+1;
y=(y+ans)%w[0];
//Episode 1-> Think hard
w[x]=y;
x=edge[x].fr;
while(x){
alls[x]=go(x,0,depth[x],0);
x=par[x];
}
ans=0;
for(int i=1;i<=n;i++)umax(ans,alls[i]);
printf("%lld\n",ans);
}
}
Compilation message
diameter.cpp: In function 'int main()':
diameter.cpp:86:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
86 | scanf("%d%d%lld",&n,&q,&w[0]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:88:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
88 | scanf("%d%d%lld",&edge[i].fr,&edge[i].sc,&w[i]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:98:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
98 | scanf("%lld%lld",&x,&y);
| ~~~~~^~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
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 |
1 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 |
1 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 |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
1 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 |
# |
결과 |
실행 시간 |
메모리 |
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 |
1 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 |
1 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 |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
1 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 |
122 ms |
2756 KB |
Output is correct |
20 |
Correct |
131 ms |
2756 KB |
Output is correct |
21 |
Correct |
164 ms |
2780 KB |
Output is correct |
22 |
Correct |
199 ms |
2784 KB |
Output is correct |
23 |
Correct |
708 ms |
3296 KB |
Output is correct |
24 |
Correct |
1118 ms |
3416 KB |
Output is correct |
25 |
Correct |
1206 ms |
3148 KB |
Output is correct |
26 |
Correct |
1301 ms |
3540 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2672 KB |
Output is correct |
3 |
Correct |
3 ms |
2644 KB |
Output is correct |
4 |
Correct |
10 ms |
2772 KB |
Output is correct |
5 |
Correct |
44 ms |
3072 KB |
Output is correct |
6 |
Correct |
1 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
3 ms |
2644 KB |
Output is correct |
9 |
Correct |
8 ms |
2644 KB |
Output is correct |
10 |
Correct |
71 ms |
2764 KB |
Output is correct |
11 |
Correct |
356 ms |
3376 KB |
Output is correct |
12 |
Correct |
4 ms |
3028 KB |
Output is correct |
13 |
Correct |
10 ms |
3028 KB |
Output is correct |
14 |
Correct |
65 ms |
3028 KB |
Output is correct |
15 |
Correct |
645 ms |
3268 KB |
Output is correct |
16 |
Correct |
3184 ms |
3740 KB |
Output is correct |
17 |
Correct |
49 ms |
10176 KB |
Output is correct |
18 |
Correct |
175 ms |
10184 KB |
Output is correct |
19 |
Correct |
1474 ms |
10340 KB |
Output is correct |
20 |
Execution timed out |
5088 ms |
10452 KB |
Time limit exceeded |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
2644 KB |
Output is correct |
2 |
Correct |
139 ms |
2780 KB |
Output is correct |
3 |
Correct |
668 ms |
3144 KB |
Output is correct |
4 |
Correct |
1349 ms |
3284 KB |
Output is correct |
5 |
Correct |
163 ms |
3416 KB |
Output is correct |
6 |
Correct |
1358 ms |
3548 KB |
Output is correct |
7 |
Execution timed out |
5080 ms |
3972 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
5090 ms |
10072 KB |
Time limit exceeded |
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 |
1 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 |
1 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 |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
1 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 |
122 ms |
2756 KB |
Output is correct |
20 |
Correct |
131 ms |
2756 KB |
Output is correct |
21 |
Correct |
164 ms |
2780 KB |
Output is correct |
22 |
Correct |
199 ms |
2784 KB |
Output is correct |
23 |
Correct |
708 ms |
3296 KB |
Output is correct |
24 |
Correct |
1118 ms |
3416 KB |
Output is correct |
25 |
Correct |
1206 ms |
3148 KB |
Output is correct |
26 |
Correct |
1301 ms |
3540 KB |
Output is correct |
27 |
Correct |
2 ms |
2644 KB |
Output is correct |
28 |
Correct |
2 ms |
2672 KB |
Output is correct |
29 |
Correct |
3 ms |
2644 KB |
Output is correct |
30 |
Correct |
10 ms |
2772 KB |
Output is correct |
31 |
Correct |
44 ms |
3072 KB |
Output is correct |
32 |
Correct |
1 ms |
2644 KB |
Output is correct |
33 |
Correct |
2 ms |
2644 KB |
Output is correct |
34 |
Correct |
3 ms |
2644 KB |
Output is correct |
35 |
Correct |
8 ms |
2644 KB |
Output is correct |
36 |
Correct |
71 ms |
2764 KB |
Output is correct |
37 |
Correct |
356 ms |
3376 KB |
Output is correct |
38 |
Correct |
4 ms |
3028 KB |
Output is correct |
39 |
Correct |
10 ms |
3028 KB |
Output is correct |
40 |
Correct |
65 ms |
3028 KB |
Output is correct |
41 |
Correct |
645 ms |
3268 KB |
Output is correct |
42 |
Correct |
3184 ms |
3740 KB |
Output is correct |
43 |
Correct |
49 ms |
10176 KB |
Output is correct |
44 |
Correct |
175 ms |
10184 KB |
Output is correct |
45 |
Correct |
1474 ms |
10340 KB |
Output is correct |
46 |
Execution timed out |
5088 ms |
10452 KB |
Time limit exceeded |
47 |
Halted |
0 ms |
0 KB |
- |