oj.uz

Submission #740655

# Submission time Handle Problem Language Result Execution time Memory
740655 2023-05-13T01:02:49 Z anhduc2701 Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 4521 ms 382856 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
#define int long long
using namespace std;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI acos(-1.0)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x,i) (1&((x)>>(i)))
#define MASK(x) (1LL<<(x))
#define task "tnc"  
typedef long long ll;
typedef long double ld;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,q,w;
vector<pair<int,int>>G[maxn];
pair<int,int>ed[maxn];
int we[maxn];
int ok[maxn];
int tin[maxn][18];
int tout[maxn][18];
int eu[maxn][18];
int par[maxn][18];
int dis[maxn][18];
int belong[maxn][18];
int ti=0;
struct ST{
	vector<pair<int,int>>st;
	vector<int>lazy;
	vector<int>eu;
	int n;
	int l=0;
	void init(int _n){
		n=_n;
		eu.resize(n+1,0);
		st.resize(4*(n+1),{0,0});
		lazy.resize(4*(n+1),0);
	}
	void push(int id){
		st[id*2].fi+=lazy[id];
		st[id*2+1].fi+=lazy[id];
		lazy[id*2]+=lazy[id];
		lazy[id*2+1]+=lazy[id];
		lazy[id]=0;
	}
	void update(int id,int l,int r,int u,int v,int val,int val1){
		if(r<u || v<l){
			return;
		}
		if(u<=l && r<=v){
			if(val1!=0){
				st[id].se=val1;
			}
			st[id].fi+=val;
			lazy[id]+=val;
			return;
		}
		int mid=(l+r)/2;
		push(id);
		update(id*2,l,mid,u,v,val,val1);
		update(id*2+1,mid+1,r,u,v,val,val1);
		st[id]=max(st[id*2],st[id*2+1]);
	}
	pair<int,int>get(int id,int l,int r,int u,int v){
		if(v<=0 || u>n)return {0,0};
		if(r<u || v<l)return {0,0};
		if(u<= l && r<=v){
			return st[id];
		}
		push(id);
		int mid=(l+r)/2;
		return max(get(id*2,l,mid,u,v),get(id*2+1,mid+1,r,u,v));
	}
	void update(int id,int val,int ti){
		if(par[ed[id].se][ti]==ed[id].fi){
			update(1,1,n,tin[ed[id].se][ti]	,tout[ed[id].se][ti],val,0);
		}
		else{
			update(1,1,n,tin[ed[id].fi][ti],tout[ed[id].fi][ti],val,0);			
		}
	}
	int calc(int ti){
		int p=belong[st[1].se][ti];

		pair<int,int>ma=max(get(1,1,n,1,tin[p][ti]-1),get(1,1,n,tout[p][ti]+1,n));

		return st[1].fi+ma.fi;	
	}
}A[maxn];

void dfs(int u,int pa,int h,int thuoc,int siz,int be){
	tin[u][h]=++ti;
	
	A[thuoc].update(1,1,siz,tin[u][h],tin[u][h],dis[u][h],u);
	belong[u][h]=be;
	for(auto v:G[u]){
		if(v.fi==pa || ok[v.fi]==1)continue;
		dis[v.fi][h]=dis[u][h]+we[v.se];
		par[v.fi][h]=u;

		dfs(v.fi,u,h,thuoc,siz,be);
	}
	tout[u][h]=ti;
}
int id;
int sz[maxn];
void dfsz(int u,int pa){
	sz[u]=1;
	for(auto v:G[u]){
		if(v.fi==pa || ok[v.fi]==1)continue;
		dfsz(v.fi,u);
		sz[u]+=sz[v.fi];
	}
}
int fin(int u,int pa,int siz){
	for(auto v:G[u]){
		if(v.fi==pa || ok[v.fi]==1)continue;
		if(sz[v.fi]>siz/2 ){
			return fin(v.fi,u,siz);
		}
	}
	return u;
}
int l=0;
int dep[maxn];
int thuoc[maxn];
int pa[maxn];

multiset<int>sus;
void build(int u,int cha){
	dfsz(u,-1);
	int cen=fin(u,-1,sz[u]);
	pa[cen]=cha;
	dep[cen]=dep[cha]+1;
	++l;
	thuoc[cen]=l;
	ok[cen]=1;
	A[l].init(sz[u]);

	ti=0;
	for(auto v:G[cen]){
		if(ok[v.fi]==1)continue;
		dis[v.fi][dep[cen]]=we[v.se];
		par[v.fi][dep[cen]]=cen;
		dfs(v.fi,-1,dep[cen],l,sz[u],v.fi);
	}
	sus.insert(A[l].calc(dep[cen]));
	for(auto v:G[cen]){
		if(ok[v.fi]==1){
			continue;
		}
		build(v.fi,cen);
	}
	
}
void update(int x,int ed,int val){
	while(x!=0){
		sus.erase(sus.find(A[thuoc[x]].calc(dep[x])));

		A[thuoc[x]].update(ed,-we[ed],dep[x]);
		A[thuoc[x]].update(ed,val,dep[x]);
		sus.insert(A[thuoc[x]].calc(dep[x]));
		//cout<<A[thuoc[x]].calc(dep[x]);
		x=pa[x];
	}
}
signed main()
{
	cin.tie(0),cout.tie(0)->sync_with_stdio(0);
    //freopen(task".inp" , "r" , stdin);
    //freopen(task".out" , "w" , stdout);
    cin>>n>>q>>w;
    for(int i=0;i<n-1;i++){
    	int u,v,w;
    	cin>>u>>v>>w;
    	ed[i]={u,v};
    	we[i]=w;
    	G[u].pb({v,i});
    	G[v].pb({u,i});
    }
    build(1,0);
    int last=0;
    
    for(int i=1;i<=q;i++){
    	int d,e;
    	cin>>d>>e;
    	d=(last+d)%(n-1);
    	e=(e+last)%w;
    	if(dep[ed[d].fi]>dep[ed[d].se])swap(ed[d].fi,ed[d].se);

    	update(ed[d].fi,d,e);
    	we[d]=e;
    	last=(*sus.rbegin());
    	cout<<(*sus.rbegin())<<"\n";
    }
    
	
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 109956 KB Output is correct
2 Correct 52 ms 109900 KB Output is correct
3 Correct 49 ms 109908 KB Output is correct
4 Correct 60 ms 110036 KB Output is correct
5 Correct 50 ms 109940 KB Output is correct
6 Correct 50 ms 109952 KB Output is correct
7 Correct 49 ms 110052 KB Output is correct
8 Correct 51 ms 110044 KB Output is correct
9 Correct 51 ms 110004 KB Output is correct
10 Correct 50 ms 110056 KB Output is correct
11 Correct 56 ms 110016 KB Output is correct
12 Correct 49 ms 110028 KB Output is correct
13 Correct 50 ms 110024 KB Output is correct
14 Correct 50 ms 110096 KB Output is correct
15 Correct 52 ms 110124 KB Output is correct
16 Correct 56 ms 110028 KB Output is correct
17 Correct 50 ms 110068 KB Output is correct
18 Correct 50 ms 110028 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 109956 KB Output is correct
2 Correct 52 ms 109900 KB Output is correct
3 Correct 49 ms 109908 KB Output is correct
4 Correct 60 ms 110036 KB Output is correct
5 Correct 50 ms 109940 KB Output is correct
6 Correct 50 ms 109952 KB Output is correct
7 Correct 49 ms 110052 KB Output is correct
8 Correct 51 ms 110044 KB Output is correct
9 Correct 51 ms 110004 KB Output is correct
10 Correct 50 ms 110056 KB Output is correct
11 Correct 56 ms 110016 KB Output is correct
12 Correct 49 ms 110028 KB Output is correct
13 Correct 50 ms 110024 KB Output is correct
14 Correct 50 ms 110096 KB Output is correct
15 Correct 52 ms 110124 KB Output is correct
16 Correct 56 ms 110028 KB Output is correct
17 Correct 50 ms 110068 KB Output is correct
18 Correct 50 ms 110028 KB Output is correct
19 Correct 71 ms 111616 KB Output is correct
20 Correct 82 ms 111684 KB Output is correct
21 Correct 81 ms 111744 KB Output is correct
22 Correct 84 ms 111892 KB Output is correct
23 Correct 93 ms 118540 KB Output is correct
24 Correct 107 ms 119496 KB Output is correct
25 Correct 124 ms 120124 KB Output is correct
26 Correct 120 ms 121204 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 109996 KB Output is correct
2 Correct 53 ms 109972 KB Output is correct
3 Correct 51 ms 109992 KB Output is correct
4 Correct 65 ms 110024 KB Output is correct
5 Correct 117 ms 110424 KB Output is correct
6 Correct 51 ms 109900 KB Output is correct
7 Correct 52 ms 110504 KB Output is correct
8 Correct 51 ms 110544 KB Output is correct
9 Correct 52 ms 110620 KB Output is correct
10 Correct 74 ms 110692 KB Output is correct
11 Correct 171 ms 111016 KB Output is correct
12 Correct 61 ms 116024 KB Output is correct
13 Correct 58 ms 116076 KB Output is correct
14 Correct 58 ms 116052 KB Output is correct
15 Correct 85 ms 116108 KB Output is correct
16 Correct 205 ms 116684 KB Output is correct
17 Correct 186 ms 231256 KB Output is correct
18 Correct 199 ms 231248 KB Output is correct
19 Correct 191 ms 231244 KB Output is correct
20 Correct 232 ms 231480 KB Output is correct
21 Correct 392 ms 231960 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 111820 KB Output is correct
2 Correct 91 ms 111892 KB Output is correct
3 Correct 276 ms 112068 KB Output is correct
4 Correct 412 ms 112360 KB Output is correct
5 Correct 106 ms 131712 KB Output is correct
6 Correct 163 ms 131788 KB Output is correct
7 Correct 465 ms 132072 KB Output is correct
8 Correct 820 ms 132376 KB Output is correct
9 Correct 307 ms 231248 KB Output is correct
10 Correct 422 ms 231192 KB Output is correct
11 Correct 965 ms 231656 KB Output is correct
12 Correct 1618 ms 232036 KB Output is correct
13 Correct 591 ms 362436 KB Output is correct
14 Correct 743 ms 362532 KB Output is correct
15 Correct 1374 ms 362788 KB Output is correct
16 Correct 2164 ms 363256 KB Output is correct
17 Correct 3700 ms 363052 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3045 ms 327196 KB Output is correct
2 Correct 3112 ms 331552 KB Output is correct
3 Correct 3050 ms 330296 KB Output is correct
4 Correct 3192 ms 331780 KB Output is correct
5 Correct 3025 ms 324012 KB Output is correct
6 Correct 2591 ms 286244 KB Output is correct
7 Correct 3939 ms 367156 KB Output is correct
8 Correct 3936 ms 366716 KB Output is correct
9 Correct 3897 ms 367180 KB Output is correct
10 Correct 3808 ms 366260 KB Output is correct
11 Correct 3768 ms 356960 KB Output is correct
12 Correct 3410 ms 305948 KB Output is correct
13 Correct 4229 ms 382596 KB Output is correct
14 Correct 4253 ms 382580 KB Output is correct
15 Correct 4324 ms 382624 KB Output is correct
16 Correct 4273 ms 381736 KB Output is correct
17 Correct 4221 ms 370896 KB Output is correct
18 Correct 3553 ms 311328 KB Output is correct
19 Correct 4231 ms 382856 KB Output is correct
20 Correct 4252 ms 382644 KB Output is correct
21 Correct 4141 ms 382716 KB Output is correct
22 Correct 4310 ms 381824 KB Output is correct
23 Correct 4120 ms 370840 KB Output is correct
24 Correct 3431 ms 311536 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 109956 KB Output is correct
2 Correct 52 ms 109900 KB Output is correct
3 Correct 49 ms 109908 KB Output is correct
4 Correct 60 ms 110036 KB Output is correct
5 Correct 50 ms 109940 KB Output is correct
6 Correct 50 ms 109952 KB Output is correct
7 Correct 49 ms 110052 KB Output is correct
8 Correct 51 ms 110044 KB Output is correct
9 Correct 51 ms 110004 KB Output is correct
10 Correct 50 ms 110056 KB Output is correct
11 Correct 56 ms 110016 KB Output is correct
12 Correct 49 ms 110028 KB Output is correct
13 Correct 50 ms 110024 KB Output is correct
14 Correct 50 ms 110096 KB Output is correct
15 Correct 52 ms 110124 KB Output is correct
16 Correct 56 ms 110028 KB Output is correct
17 Correct 50 ms 110068 KB Output is correct
18 Correct 50 ms 110028 KB Output is correct
19 Correct 71 ms 111616 KB Output is correct
20 Correct 82 ms 111684 KB Output is correct
21 Correct 81 ms 111744 KB Output is correct
22 Correct 84 ms 111892 KB Output is correct
23 Correct 93 ms 118540 KB Output is correct
24 Correct 107 ms 119496 KB Output is correct
25 Correct 124 ms 120124 KB Output is correct
26 Correct 120 ms 121204 KB Output is correct
27 Correct 49 ms 109996 KB Output is correct
28 Correct 53 ms 109972 KB Output is correct
29 Correct 51 ms 109992 KB Output is correct
30 Correct 65 ms 110024 KB Output is correct
31 Correct 117 ms 110424 KB Output is correct
32 Correct 51 ms 109900 KB Output is correct
33 Correct 52 ms 110504 KB Output is correct
34 Correct 51 ms 110544 KB Output is correct
35 Correct 52 ms 110620 KB Output is correct
36 Correct 74 ms 110692 KB Output is correct
37 Correct 171 ms 111016 KB Output is correct
38 Correct 61 ms 116024 KB Output is correct
39 Correct 58 ms 116076 KB Output is correct
40 Correct 58 ms 116052 KB Output is correct
41 Correct 85 ms 116108 KB Output is correct
42 Correct 205 ms 116684 KB Output is correct
43 Correct 186 ms 231256 KB Output is correct
44 Correct 199 ms 231248 KB Output is correct
45 Correct 191 ms 231244 KB Output is correct
46 Correct 232 ms 231480 KB Output is correct
47 Correct 392 ms 231960 KB Output is correct
48 Correct 56 ms 111820 KB Output is correct
49 Correct 91 ms 111892 KB Output is correct
50 Correct 276 ms 112068 KB Output is correct
51 Correct 412 ms 112360 KB Output is correct
52 Correct 106 ms 131712 KB Output is correct
53 Correct 163 ms 131788 KB Output is correct
54 Correct 465 ms 132072 KB Output is correct
55 Correct 820 ms 132376 KB Output is correct
56 Correct 307 ms 231248 KB Output is correct
57 Correct 422 ms 231192 KB Output is correct
58 Correct 965 ms 231656 KB Output is correct
59 Correct 1618 ms 232036 KB Output is correct
60 Correct 591 ms 362436 KB Output is correct
61 Correct 743 ms 362532 KB Output is correct
62 Correct 1374 ms 362788 KB Output is correct
63 Correct 2164 ms 363256 KB Output is correct
64 Correct 3700 ms 363052 KB Output is correct
65 Correct 3045 ms 327196 KB Output is correct
66 Correct 3112 ms 331552 KB Output is correct
67 Correct 3050 ms 330296 KB Output is correct
68 Correct 3192 ms 331780 KB Output is correct
69 Correct 3025 ms 324012 KB Output is correct
70 Correct 2591 ms 286244 KB Output is correct
71 Correct 3939 ms 367156 KB Output is correct
72 Correct 3936 ms 366716 KB Output is correct
73 Correct 3897 ms 367180 KB Output is correct
74 Correct 3808 ms 366260 KB Output is correct
75 Correct 3768 ms 356960 KB Output is correct
76 Correct 3410 ms 305948 KB Output is correct
77 Correct 4229 ms 382596 KB Output is correct
78 Correct 4253 ms 382580 KB Output is correct
79 Correct 4324 ms 382624 KB Output is correct
80 Correct 4273 ms 381736 KB Output is correct
81 Correct 4221 ms 370896 KB Output is correct
82 Correct 3553 ms 311328 KB Output is correct
83 Correct 4231 ms 382856 KB Output is correct
84 Correct 4252 ms 382644 KB Output is correct
85 Correct 4141 ms 382716 KB Output is correct
86 Correct 4310 ms 381824 KB Output is correct
87 Correct 4120 ms 370840 KB Output is correct
88 Correct 3431 ms 311536 KB Output is correct
89 Correct 2887 ms 328716 KB Output is correct
90 Correct 3338 ms 343224 KB Output is correct
91 Correct 3789 ms 361136 KB Output is correct
92 Correct 3809 ms 366032 KB Output is correct
93 Correct 4099 ms 372348 KB Output is correct
94 Correct 4176 ms 375836 KB Output is correct
95 Correct 4394 ms 380572 KB Output is correct
96 Correct 4371 ms 380460 KB Output is correct
97 Correct 4249 ms 380364 KB Output is correct
98 Correct 4435 ms 381888 KB Output is correct
99 Correct 4204 ms 380220 KB Output is correct
100 Correct 4521 ms 380508 KB Output is correct