oj.uz

Submission #740653

# Submission time Handle Problem Language Result Execution time Memory
740653 2023-05-13T01:01:56 Z anhduc2701 Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 3671 ms 146128 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
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=1e5+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 6 ms 10580 KB Output is correct
2 Correct 7 ms 10524 KB Output is correct
3 Correct 8 ms 10524 KB Output is correct
4 Correct 6 ms 10580 KB Output is correct
5 Correct 6 ms 10580 KB Output is correct
6 Correct 6 ms 10580 KB Output is correct
7 Correct 6 ms 10524 KB Output is correct
8 Correct 6 ms 10580 KB Output is correct
9 Correct 6 ms 10500 KB Output is correct
10 Correct 6 ms 10580 KB Output is correct
11 Correct 8 ms 10488 KB Output is correct
12 Correct 6 ms 10580 KB Output is correct
13 Correct 6 ms 10580 KB Output is correct
14 Correct 7 ms 10648 KB Output is correct
15 Correct 6 ms 10580 KB Output is correct
16 Correct 7 ms 10652 KB Output is correct
17 Correct 6 ms 10652 KB Output is correct
18 Correct 6 ms 10636 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10580 KB Output is correct
2 Correct 7 ms 10524 KB Output is correct
3 Correct 8 ms 10524 KB Output is correct
4 Correct 6 ms 10580 KB Output is correct
5 Correct 6 ms 10580 KB Output is correct
6 Correct 6 ms 10580 KB Output is correct
7 Correct 6 ms 10524 KB Output is correct
8 Correct 6 ms 10580 KB Output is correct
9 Correct 6 ms 10500 KB Output is correct
10 Correct 6 ms 10580 KB Output is correct
11 Correct 8 ms 10488 KB Output is correct
12 Correct 6 ms 10580 KB Output is correct
13 Correct 6 ms 10580 KB Output is correct
14 Correct 7 ms 10648 KB Output is correct
15 Correct 6 ms 10580 KB Output is correct
16 Correct 7 ms 10652 KB Output is correct
17 Correct 6 ms 10652 KB Output is correct
18 Correct 6 ms 10636 KB Output is correct
19 Correct 27 ms 11440 KB Output is correct
20 Correct 29 ms 11540 KB Output is correct
21 Correct 45 ms 11512 KB Output is correct
22 Correct 36 ms 11712 KB Output is correct
23 Correct 51 ms 15316 KB Output is correct
24 Correct 60 ms 15804 KB Output is correct
25 Correct 69 ms 16136 KB Output is correct
26 Correct 73 ms 16788 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10580 KB Output is correct
2 Correct 6 ms 10580 KB Output is correct
3 Correct 8 ms 10580 KB Output is correct
4 Correct 24 ms 10796 KB Output is correct
5 Correct 70 ms 11708 KB Output is correct
6 Correct 5 ms 10580 KB Output is correct
7 Correct 7 ms 10912 KB Output is correct
8 Correct 6 ms 10912 KB Output is correct
9 Correct 8 ms 10836 KB Output is correct
10 Correct 28 ms 11100 KB Output is correct
11 Correct 117 ms 12152 KB Output is correct
12 Correct 11 ms 13908 KB Output is correct
13 Correct 11 ms 13964 KB Output is correct
14 Correct 13 ms 13988 KB Output is correct
15 Correct 47 ms 14264 KB Output is correct
16 Correct 151 ms 15432 KB Output is correct
17 Correct 143 ms 79416 KB Output is correct
18 Correct 137 ms 79312 KB Output is correct
19 Correct 149 ms 79452 KB Output is correct
20 Correct 188 ms 79756 KB Output is correct
21 Correct 329 ms 81040 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11476 KB Output is correct
2 Correct 45 ms 11656 KB Output is correct
3 Correct 204 ms 12224 KB Output is correct
4 Correct 395 ms 12940 KB Output is correct
5 Correct 42 ms 22220 KB Output is correct
6 Correct 107 ms 22300 KB Output is correct
7 Correct 376 ms 22936 KB Output is correct
8 Correct 780 ms 23796 KB Output is correct
9 Correct 230 ms 74964 KB Output is correct
10 Correct 327 ms 75168 KB Output is correct
11 Correct 773 ms 75932 KB Output is correct
12 Correct 1418 ms 76716 KB Output is correct
13 Correct 470 ms 144468 KB Output is correct
14 Correct 617 ms 144644 KB Output is correct
15 Correct 1313 ms 145368 KB Output is correct
16 Correct 2065 ms 146128 KB Output is correct
17 Correct 3671 ms 145980 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 27148 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10580 KB Output is correct
2 Correct 7 ms 10524 KB Output is correct
3 Correct 8 ms 10524 KB Output is correct
4 Correct 6 ms 10580 KB Output is correct
5 Correct 6 ms 10580 KB Output is correct
6 Correct 6 ms 10580 KB Output is correct
7 Correct 6 ms 10524 KB Output is correct
8 Correct 6 ms 10580 KB Output is correct
9 Correct 6 ms 10500 KB Output is correct
10 Correct 6 ms 10580 KB Output is correct
11 Correct 8 ms 10488 KB Output is correct
12 Correct 6 ms 10580 KB Output is correct
13 Correct 6 ms 10580 KB Output is correct
14 Correct 7 ms 10648 KB Output is correct
15 Correct 6 ms 10580 KB Output is correct
16 Correct 7 ms 10652 KB Output is correct
17 Correct 6 ms 10652 KB Output is correct
18 Correct 6 ms 10636 KB Output is correct
19 Correct 27 ms 11440 KB Output is correct
20 Correct 29 ms 11540 KB Output is correct
21 Correct 45 ms 11512 KB Output is correct
22 Correct 36 ms 11712 KB Output is correct
23 Correct 51 ms 15316 KB Output is correct
24 Correct 60 ms 15804 KB Output is correct
25 Correct 69 ms 16136 KB Output is correct
26 Correct 73 ms 16788 KB Output is correct
27 Correct 7 ms 10580 KB Output is correct
28 Correct 6 ms 10580 KB Output is correct
29 Correct 8 ms 10580 KB Output is correct
30 Correct 24 ms 10796 KB Output is correct
31 Correct 70 ms 11708 KB Output is correct
32 Correct 5 ms 10580 KB Output is correct
33 Correct 7 ms 10912 KB Output is correct
34 Correct 6 ms 10912 KB Output is correct
35 Correct 8 ms 10836 KB Output is correct
36 Correct 28 ms 11100 KB Output is correct
37 Correct 117 ms 12152 KB Output is correct
38 Correct 11 ms 13908 KB Output is correct
39 Correct 11 ms 13964 KB Output is correct
40 Correct 13 ms 13988 KB Output is correct
41 Correct 47 ms 14264 KB Output is correct
42 Correct 151 ms 15432 KB Output is correct
43 Correct 143 ms 79416 KB Output is correct
44 Correct 137 ms 79312 KB Output is correct
45 Correct 149 ms 79452 KB Output is correct
46 Correct 188 ms 79756 KB Output is correct
47 Correct 329 ms 81040 KB Output is correct
48 Correct 12 ms 11476 KB Output is correct
49 Correct 45 ms 11656 KB Output is correct
50 Correct 204 ms 12224 KB Output is correct
51 Correct 395 ms 12940 KB Output is correct
52 Correct 42 ms 22220 KB Output is correct
53 Correct 107 ms 22300 KB Output is correct
54 Correct 376 ms 22936 KB Output is correct
55 Correct 780 ms 23796 KB Output is correct
56 Correct 230 ms 74964 KB Output is correct
57 Correct 327 ms 75168 KB Output is correct
58 Correct 773 ms 75932 KB Output is correct
59 Correct 1418 ms 76716 KB Output is correct
60 Correct 470 ms 144468 KB Output is correct
61 Correct 617 ms 144644 KB Output is correct
62 Correct 1313 ms 145368 KB Output is correct
63 Correct 2065 ms 146128 KB Output is correct
64 Correct 3671 ms 145980 KB Output is correct
65 Runtime error 30 ms 27148 KB Execution killed with signal 11
66 Halted 0 ms 0 KB -