oj.uz

Submission #779488

# Submission time Handle Problem Language Result Execution time Memory
779488 2023-07-11T13:21:21 Z sdgdgssdg Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 3862 ms 304708 KB 
//diameter
#include <bits/stdc++.h>
#define MAX 205000
#define SMAX 1550000
#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 5 ms 5332 KB Output is correct
2 Correct 3 ms 5332 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 3 ms 5284 KB Output is correct
5 Correct 3 ms 5260 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 3 ms 5276 KB Output is correct
10 Correct 3 ms 5332 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 3 ms 5332 KB Output is correct
13 Correct 3 ms 5332 KB Output is correct
14 Correct 3 ms 5408 KB Output is correct
15 Correct 3 ms 5332 KB Output is correct
16 Correct 3 ms 5332 KB Output is correct
17 Correct 3 ms 5332 KB Output is correct
18 Correct 4 ms 5332 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5332 KB Output is correct
2 Correct 3 ms 5332 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 3 ms 5284 KB Output is correct
5 Correct 3 ms 5260 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 3 ms 5276 KB Output is correct
10 Correct 3 ms 5332 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 3 ms 5332 KB Output is correct
13 Correct 3 ms 5332 KB Output is correct
14 Correct 3 ms 5408 KB Output is correct
15 Correct 3 ms 5332 KB Output is correct
16 Correct 3 ms 5332 KB Output is correct
17 Correct 3 ms 5332 KB Output is correct
18 Correct 4 ms 5332 KB Output is correct
19 Correct 53 ms 6320 KB Output is correct
20 Correct 51 ms 6348 KB Output is correct
21 Correct 62 ms 6552 KB Output is correct
22 Correct 63 ms 6484 KB Output is correct
23 Correct 80 ms 10352 KB Output is correct
24 Correct 88 ms 11028 KB Output is correct
25 Correct 96 ms 11436 KB Output is correct
26 Correct 108 ms 12112 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 5332 KB Output is correct
3 Correct 7 ms 5332 KB Output is correct
4 Correct 52 ms 5544 KB Output is correct
5 Correct 246 ms 6432 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 4 ms 5588 KB Output is correct
8 Correct 4 ms 5668 KB Output is correct
9 Correct 11 ms 5692 KB Output is correct
10 Correct 91 ms 5920 KB Output is correct
11 Correct 417 ms 6960 KB Output is correct
12 Correct 6 ms 8404 KB Output is correct
13 Correct 8 ms 8660 KB Output is correct
14 Correct 17 ms 8700 KB Output is correct
15 Correct 116 ms 8904 KB Output is correct
16 Correct 570 ms 10004 KB Output is correct
17 Correct 69 ms 66192 KB Output is correct
18 Correct 75 ms 67568 KB Output is correct
19 Correct 87 ms 70928 KB Output is correct
20 Correct 242 ms 72508 KB Output is correct
21 Correct 812 ms 72760 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 6356 KB Output is correct
2 Correct 108 ms 6524 KB Output is correct
3 Correct 525 ms 7080 KB Output is correct
4 Correct 1030 ms 7676 KB Output is correct
5 Correct 56 ms 18368 KB Output is correct
6 Correct 217 ms 18464 KB Output is correct
7 Correct 893 ms 19180 KB Output is correct
8 Correct 1618 ms 19888 KB Output is correct
9 Correct 270 ms 78540 KB Output is correct
10 Correct 473 ms 78720 KB Output is correct
11 Correct 1272 ms 79384 KB Output is correct
12 Correct 2305 ms 80220 KB Output is correct
13 Correct 566 ms 143020 KB Output is correct
14 Correct 778 ms 143052 KB Output is correct
15 Correct 1699 ms 143800 KB Output is correct
16 Correct 2890 ms 144716 KB Output is correct
17 Correct 3036 ms 144400 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3071 ms 128676 KB Output is correct
2 Correct 3128 ms 130540 KB Output is correct
3 Correct 2865 ms 130080 KB Output is correct
4 Correct 2635 ms 130544 KB Output is correct
5 Correct 2268 ms 126724 KB Output is correct
6 Correct 2545 ms 105972 KB Output is correct
7 Correct 3832 ms 147376 KB Output is correct
8 Correct 3818 ms 147408 KB Output is correct
9 Correct 3862 ms 147460 KB Output is correct
10 Correct 3423 ms 147044 KB Output is correct
11 Correct 2911 ms 142468 KB Output is correct
12 Correct 3274 ms 116736 KB Output is correct
13 Runtime error 1576 ms 304708 KB Execution killed with signal 6
14 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5332 KB Output is correct
2 Correct 3 ms 5332 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 3 ms 5284 KB Output is correct
5 Correct 3 ms 5260 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 3 ms 5276 KB Output is correct
10 Correct 3 ms 5332 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 3 ms 5332 KB Output is correct
13 Correct 3 ms 5332 KB Output is correct
14 Correct 3 ms 5408 KB Output is correct
15 Correct 3 ms 5332 KB Output is correct
16 Correct 3 ms 5332 KB Output is correct
17 Correct 3 ms 5332 KB Output is correct
18 Correct 4 ms 5332 KB Output is correct
19 Correct 53 ms 6320 KB Output is correct
20 Correct 51 ms 6348 KB Output is correct
21 Correct 62 ms 6552 KB Output is correct
22 Correct 63 ms 6484 KB Output is correct
23 Correct 80 ms 10352 KB Output is correct
24 Correct 88 ms 11028 KB Output is correct
25 Correct 96 ms 11436 KB Output is correct
26 Correct 108 ms 12112 KB Output is correct
27 Correct 3 ms 5332 KB Output is correct
28 Correct 3 ms 5332 KB Output is correct
29 Correct 7 ms 5332 KB Output is correct
30 Correct 52 ms 5544 KB Output is correct
31 Correct 246 ms 6432 KB Output is correct
32 Correct 3 ms 5332 KB Output is correct
33 Correct 4 ms 5588 KB Output is correct
34 Correct 4 ms 5668 KB Output is correct
35 Correct 11 ms 5692 KB Output is correct
36 Correct 91 ms 5920 KB Output is correct
37 Correct 417 ms 6960 KB Output is correct
38 Correct 6 ms 8404 KB Output is correct
39 Correct 8 ms 8660 KB Output is correct
40 Correct 17 ms 8700 KB Output is correct
41 Correct 116 ms 8904 KB Output is correct
42 Correct 570 ms 10004 KB Output is correct
43 Correct 69 ms 66192 KB Output is correct
44 Correct 75 ms 67568 KB Output is correct
45 Correct 87 ms 70928 KB Output is correct
46 Correct 242 ms 72508 KB Output is correct
47 Correct 812 ms 72760 KB Output is correct
48 Correct 15 ms 6356 KB Output is correct
49 Correct 108 ms 6524 KB Output is correct
50 Correct 525 ms 7080 KB Output is correct
51 Correct 1030 ms 7676 KB Output is correct
52 Correct 56 ms 18368 KB Output is correct
53 Correct 217 ms 18464 KB Output is correct
54 Correct 893 ms 19180 KB Output is correct
55 Correct 1618 ms 19888 KB Output is correct
56 Correct 270 ms 78540 KB Output is correct
57 Correct 473 ms 78720 KB Output is correct
58 Correct 1272 ms 79384 KB Output is correct
59 Correct 2305 ms 80220 KB Output is correct
60 Correct 566 ms 143020 KB Output is correct
61 Correct 778 ms 143052 KB Output is correct
62 Correct 1699 ms 143800 KB Output is correct
63 Correct 2890 ms 144716 KB Output is correct
64 Correct 3036 ms 144400 KB Output is correct
65 Correct 3071 ms 128676 KB Output is correct
66 Correct 3128 ms 130540 KB Output is correct
67 Correct 2865 ms 130080 KB Output is correct
68 Correct 2635 ms 130544 KB Output is correct
69 Correct 2268 ms 126724 KB Output is correct
70 Correct 2545 ms 105972 KB Output is correct
71 Correct 3832 ms 147376 KB Output is correct
72 Correct 3818 ms 147408 KB Output is correct
73 Correct 3862 ms 147460 KB Output is correct
74 Correct 3423 ms 147044 KB Output is correct
75 Correct 2911 ms 142468 KB Output is correct
76 Correct 3274 ms 116736 KB Output is correct
77 Runtime error 1576 ms 304708 KB Execution killed with signal 6
78 Halted 0 ms 0 KB -