oj.uz

Submission #779493

# Submission time Handle Problem Language Result Execution time Memory
779493 2023-07-11T13:22:53 Z sdgdgssdg Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 4572 ms 185328 KB 
//diameter
#include <bits/stdc++.h>
#define MAX 205000
#define SMAX 5550000
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
 
 
using ll = long long;
typedef std::pair<int,int> pii;
ll tab[SMAX*4],lazy[SMAX*4];
void propag(int pos){
	tab[pos]+=lazy[pos];
	if(pos*2<SMAX*4){
		lazy[pos*2]+=lazy[pos];
		lazy[(pos*2)+1]+=lazy[pos];
	}
	lazy[pos]=0;
}
ll query(int l,int r,int la=0,int ra=SMAX-1,int pos=1){
	propag(pos);
	if(la>r||ra<l)return 0;
	if(la>=l&&ra<=r){
		return tab[pos];
	}
	int m = (la+ra)/2;
	return std::max(query(l,r,la,m,pos*2),query(l,r,m+1,ra,(pos*2)+1));
}
void lazyadd(int l,int r,ll k,int la=0,int ra=SMAX-1,int pos=1){
	propag(pos);
	if(la>r||ra<l)return;
	if(la>=l&&ra<=r){
		lazy[pos]+=k;
		propag(pos);
		return;
	}
	int m = (la+ra)/2;
	lazyadd(l,r,k,la,m,pos*2);
	lazyadd(l,r,k,m+1,ra,(pos*2)+1);
	tab[pos]=std::max(tab[pos*2],tab[(pos*2)+1]);
}
std::vector<pii> con[MAX];
ll N,Q,W;
ll peso[MAX];
bool bloqueado[MAX];
inline int dfs(int pos,int prev){
	int s=1;
	for(auto&x:con[pos]){
		if(x.first==prev)continue;
		if(bloqueado[x.first])continue;
		s+=dfs(x.first,pos);
	}
	return s;
}
int centroide=0;
inline int find_centroide(int pos,int prev,int sz){
	int b=0;
	int c=1;
	for(auto&x:con[pos]){
		if(x.first==prev)continue;
		if(bloqueado[x.first])continue;
		int d = find_centroide(x.first,pos,sz);
		b=std::max(b,d);
		c+=d;
	}
	if(std::max(b,sz-c)<=sz/2){
		centroide=pos;
	}
	return c;
}
int cureuler=0;
pii rangeeuler[MAX][20];
pii rangeedges[MAX][20];
int ancestralmaior[MAX][20];
int centronivel[MAX][20];
int valores[SMAX];
inline void montar_euler(int pos,int prev,int lvl,int C){
	centronivel[pos][lvl]=C;
	++cureuler;
	valores[cureuler]=pos;
	rangeeuler[pos][lvl].first=cureuler;
	for(auto&x:con[pos]){
		if(x.first==prev)continue;
		if(bloqueado[x.first])continue;
		montar_euler(x.first,pos,lvl,C);
	}
	rangeeuler[pos][lvl].second=cureuler;
}
inline void setar_euler(int pos,int prev,int lvl,int paimax){
	ancestralmaior[pos][lvl]=paimax;
	for(auto&x:con[pos]){
		if(x.first==prev)continue;
		if(bloqueado[x.first])continue;
		rangeedges[x.second][lvl]=rangeeuler[x.first][lvl];
		if(prev==-1)
			setar_euler(x.first,pos,lvl,x.first);
		else
			setar_euler(x.first,pos,lvl,paimax);
	}
}
int virou_centroide[MAX];
int farthest(int la,int ra){
	ll goal=query(la,ra);
	int l=la,r=ra;
	while(l<r){
		int m = (l+r)/2;
		if(query(la,m)==goal){
			r=m;
		}else l=m+1;
	}
	return l;
}
ll pega_custo_otter(int otter,int lvl){
	int C = centronivel[otter][lvl];
	int maisdist=otter;
	if(maisdist==C)return query(rangeeuler[maisdist][lvl].first,rangeeuler[maisdist][lvl].first);
	ll pega = ancestralmaior[maisdist][lvl];
	assert(pega!=-1);
	pii ragpai = rangeeuler[C][lvl];
	ll p1 = query(rangeeuler[maisdist][lvl].first,rangeeuler[maisdist][lvl].first);
	pii ragfil = rangeeuler[pega][lvl];
	ll p2 = std::max(query(ragpai.first,ragfil.first-1),query(ragfil.second+1,ragpai.second));
	return p1+p2;
}
int raiz=0;
void decompor_centroide(int X,int lvl=0){
	int SZ = dfs(X,-1);
	find_centroide(X,-1,SZ);
	int C = centroide;
	virou_centroide[C]=lvl;
	///Do centroid stuff
	montar_euler(C,-1,lvl,C);
	setar_euler(C,-1,lvl,-1);
	bloqueado[C]=1;
	if(!lvl)raiz=C;
	for(auto&x:con[C]){
		if(!bloqueado[x.first])decompor_centroide(x.first,lvl+1);
	}
}
void altera_aresta(int X,ll novo){
	ll delta = novo-peso[X];
	for(int i=0;i!=20;++i){
		if(rangeedges[X][i].first==0)continue;
		lazyadd(rangeedges[X][i].first,rangeedges[X][i].second,delta);
	}
	peso[X]=novo;
}
int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);
	std::cin>>N>>Q>>W;
	for(int i=0;i!=N-1;++i){
		ll a,b,c;
		std::cin>>a>>b>>c;--a;--b;
		con[a].push_back({b,i});
		con[b].push_back({a,i});
		peso[i]=c;
	}
	decompor_centroide(0);
	for(int i=0;i!=N-1;++i){
		ll kek=peso[i];
		peso[i]=0;
		altera_aresta(i,kek);
	}
	assert(cureuler<SMAX);
	ll last=0;
	for(int i=0;i!=Q;++i){
		ll a,b;
		std::cin>>a>>b;a=(a+last)%(N-1);b=(b+last)%W;
		altera_aresta(a,b);
		ll best=0;
		int maisdist = valores[farthest(rangeeuler[raiz][0].first,rangeeuler[raiz][0].second)];
		for(int i=0;i<=virou_centroide[maisdist];++i)best=std::max(best,pega_custo_otter(maisdist,i));
		last=best;
		std::cout<<last<<"\n";
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5284 KB Output is correct
3 Correct 4 ms 5260 KB Output is correct
4 Correct 3 ms 5332 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 3 ms 5412 KB Output is correct
10 Correct 5 ms 5332 KB Output is correct
11 Correct 4 ms 5332 KB Output is correct
12 Correct 3 ms 5332 KB Output is correct
13 Correct 3 ms 5360 KB Output is correct
14 Correct 4 ms 5408 KB Output is correct
15 Correct 4 ms 5408 KB Output is correct
16 Correct 3 ms 5408 KB Output is correct
17 Correct 4 ms 5460 KB Output is correct
18 Correct 5 ms 5404 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5284 KB Output is correct
3 Correct 4 ms 5260 KB Output is correct
4 Correct 3 ms 5332 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 3 ms 5412 KB Output is correct
10 Correct 5 ms 5332 KB Output is correct
11 Correct 4 ms 5332 KB Output is correct
12 Correct 3 ms 5332 KB Output is correct
13 Correct 3 ms 5360 KB Output is correct
14 Correct 4 ms 5408 KB Output is correct
15 Correct 4 ms 5408 KB Output is correct
16 Correct 3 ms 5408 KB Output is correct
17 Correct 4 ms 5460 KB Output is correct
18 Correct 5 ms 5404 KB Output is correct
19 Correct 62 ms 6424 KB Output is correct
20 Correct 57 ms 6468 KB Output is correct
21 Correct 69 ms 6572 KB Output is correct
22 Correct 74 ms 6692 KB Output is correct
23 Correct 81 ms 10660 KB Output is correct
24 Correct 108 ms 11408 KB Output is correct
25 Correct 106 ms 11880 KB Output is correct
26 Correct 122 ms 12636 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 3 ms 5280 KB Output is correct
3 Correct 11 ms 5416 KB Output is correct
4 Correct 56 ms 5596 KB Output is correct
5 Correct 308 ms 6476 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 12 ms 5764 KB Output is correct
10 Correct 110 ms 5976 KB Output is correct
11 Correct 505 ms 7016 KB Output is correct
12 Correct 10 ms 8492 KB Output is correct
13 Correct 8 ms 8788 KB Output is correct
14 Correct 19 ms 8788 KB Output is correct
15 Correct 129 ms 9068 KB Output is correct
16 Correct 624 ms 10168 KB Output is correct
17 Correct 78 ms 66972 KB Output is correct
18 Correct 82 ms 68392 KB Output is correct
19 Correct 100 ms 71940 KB Output is correct
20 Correct 259 ms 74048 KB Output is correct
21 Correct 897 ms 73848 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 6448 KB Output is correct
2 Correct 116 ms 6664 KB Output is correct
3 Correct 565 ms 7144 KB Output is correct
4 Correct 1148 ms 7940 KB Output is correct
5 Correct 61 ms 19300 KB Output is correct
6 Correct 212 ms 19500 KB Output is correct
7 Correct 882 ms 20180 KB Output is correct
8 Correct 1714 ms 20740 KB Output is correct
9 Correct 299 ms 83772 KB Output is correct
10 Correct 496 ms 83908 KB Output is correct
11 Correct 1418 ms 84636 KB Output is correct
12 Correct 2518 ms 85336 KB Output is correct
13 Correct 607 ms 169680 KB Output is correct
14 Correct 834 ms 169808 KB Output is correct
15 Correct 1857 ms 170572 KB Output is correct
16 Correct 3099 ms 171296 KB Output is correct
17 Correct 3316 ms 171096 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3354 ms 142732 KB Output is correct
2 Correct 3394 ms 145704 KB Output is correct
3 Correct 3092 ms 144752 KB Output is correct
4 Correct 2780 ms 145820 KB Output is correct
5 Correct 2411 ms 139820 KB Output is correct
6 Correct 2744 ms 109140 KB Output is correct
7 Correct 4126 ms 171956 KB Output is correct
8 Correct 4080 ms 171748 KB Output is correct
9 Correct 4018 ms 170724 KB Output is correct
10 Correct 3648 ms 170104 KB Output is correct
11 Correct 3153 ms 163012 KB Output is correct
12 Correct 3464 ms 121824 KB Output is correct
13 Correct 4333 ms 183196 KB Output is correct
14 Correct 4328 ms 185244 KB Output is correct
15 Correct 4367 ms 185156 KB Output is correct
16 Correct 3742 ms 184624 KB Output is correct
17 Correct 3366 ms 176020 KB Output is correct
18 Correct 3606 ms 128268 KB Output is correct
19 Correct 4461 ms 185164 KB Output is correct
20 Correct 4418 ms 185288 KB Output is correct
21 Correct 4307 ms 185328 KB Output is correct
22 Correct 3747 ms 184584 KB Output is correct
23 Correct 3308 ms 176056 KB Output is correct
24 Correct 3646 ms 128268 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5284 KB Output is correct
3 Correct 4 ms 5260 KB Output is correct
4 Correct 3 ms 5332 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 3 ms 5412 KB Output is correct
10 Correct 5 ms 5332 KB Output is correct
11 Correct 4 ms 5332 KB Output is correct
12 Correct 3 ms 5332 KB Output is correct
13 Correct 3 ms 5360 KB Output is correct
14 Correct 4 ms 5408 KB Output is correct
15 Correct 4 ms 5408 KB Output is correct
16 Correct 3 ms 5408 KB Output is correct
17 Correct 4 ms 5460 KB Output is correct
18 Correct 5 ms 5404 KB Output is correct
19 Correct 62 ms 6424 KB Output is correct
20 Correct 57 ms 6468 KB Output is correct
21 Correct 69 ms 6572 KB Output is correct
22 Correct 74 ms 6692 KB Output is correct
23 Correct 81 ms 10660 KB Output is correct
24 Correct 108 ms 11408 KB Output is correct
25 Correct 106 ms 11880 KB Output is correct
26 Correct 122 ms 12636 KB Output is correct
27 Correct 3 ms 5332 KB Output is correct
28 Correct 3 ms 5280 KB Output is correct
29 Correct 11 ms 5416 KB Output is correct
30 Correct 56 ms 5596 KB Output is correct
31 Correct 308 ms 6476 KB Output is correct
32 Correct 3 ms 5332 KB Output is correct
33 Correct 3 ms 5716 KB Output is correct
34 Correct 4 ms 5716 KB Output is correct
35 Correct 12 ms 5764 KB Output is correct
36 Correct 110 ms 5976 KB Output is correct
37 Correct 505 ms 7016 KB Output is correct
38 Correct 10 ms 8492 KB Output is correct
39 Correct 8 ms 8788 KB Output is correct
40 Correct 19 ms 8788 KB Output is correct
41 Correct 129 ms 9068 KB Output is correct
42 Correct 624 ms 10168 KB Output is correct
43 Correct 78 ms 66972 KB Output is correct
44 Correct 82 ms 68392 KB Output is correct
45 Correct 100 ms 71940 KB Output is correct
46 Correct 259 ms 74048 KB Output is correct
47 Correct 897 ms 73848 KB Output is correct
48 Correct 17 ms 6448 KB Output is correct
49 Correct 116 ms 6664 KB Output is correct
50 Correct 565 ms 7144 KB Output is correct
51 Correct 1148 ms 7940 KB Output is correct
52 Correct 61 ms 19300 KB Output is correct
53 Correct 212 ms 19500 KB Output is correct
54 Correct 882 ms 20180 KB Output is correct
55 Correct 1714 ms 20740 KB Output is correct
56 Correct 299 ms 83772 KB Output is correct
57 Correct 496 ms 83908 KB Output is correct
58 Correct 1418 ms 84636 KB Output is correct
59 Correct 2518 ms 85336 KB Output is correct
60 Correct 607 ms 169680 KB Output is correct
61 Correct 834 ms 169808 KB Output is correct
62 Correct 1857 ms 170572 KB Output is correct
63 Correct 3099 ms 171296 KB Output is correct
64 Correct 3316 ms 171096 KB Output is correct
65 Correct 3354 ms 142732 KB Output is correct
66 Correct 3394 ms 145704 KB Output is correct
67 Correct 3092 ms 144752 KB Output is correct
68 Correct 2780 ms 145820 KB Output is correct
69 Correct 2411 ms 139820 KB Output is correct
70 Correct 2744 ms 109140 KB Output is correct
71 Correct 4126 ms 171956 KB Output is correct
72 Correct 4080 ms 171748 KB Output is correct
73 Correct 4018 ms 170724 KB Output is correct
74 Correct 3648 ms 170104 KB Output is correct
75 Correct 3153 ms 163012 KB Output is correct
76 Correct 3464 ms 121824 KB Output is correct
77 Correct 4333 ms 183196 KB Output is correct
78 Correct 4328 ms 185244 KB Output is correct
79 Correct 4367 ms 185156 KB Output is correct
80 Correct 3742 ms 184624 KB Output is correct
81 Correct 3366 ms 176020 KB Output is correct
82 Correct 3606 ms 128268 KB Output is correct
83 Correct 4461 ms 185164 KB Output is correct
84 Correct 4418 ms 185288 KB Output is correct
85 Correct 4307 ms 185328 KB Output is correct
86 Correct 3747 ms 184584 KB Output is correct
87 Correct 3308 ms 176056 KB Output is correct
88 Correct 3646 ms 128268 KB Output is correct
89 Correct 3424 ms 144824 KB Output is correct
90 Correct 3640 ms 155440 KB Output is correct
91 Correct 4011 ms 168660 KB Output is correct
92 Correct 4216 ms 172068 KB Output is correct
93 Correct 4365 ms 177432 KB Output is correct
94 Correct 4376 ms 178604 KB Output is correct
95 Correct 4474 ms 182888 KB Output is correct
96 Correct 4363 ms 182116 KB Output is correct
97 Correct 4335 ms 182804 KB Output is correct
98 Correct 4381 ms 184408 KB Output is correct
99 Correct 4508 ms 182672 KB Output is correct
100 Correct 4572 ms 182736 KB Output is correct