oj.uz

Submission #579228

# Submission time Handle Problem Language Result Execution time Memory
579228 2022-06-18T13:46:21 Z temporary_juggernaut Dynamic Diameter (CEOI19_diameter) C++14
24 / 100
 5000 ms 16488 KB 
#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 MultiSegmentTree{
	vector<ll>tree;
	vector<ll>lazy;
	MultiSegmentTree(int n){
		tree.assign(n<<2|3,0ll);
		lazy.assign(n<<2|3,0ll);
	}
	void push(int v,int l,int r){
		if(l^r){
			lazy[v<<1]+=lazy[v];
			lazy[v<<1|1]+=lazy[v];
		}
		tree[v]+=lazy[v];
		lazy[v]=0;
	}
	ll get(int ql,int qr,int v,int l,int r){
		if(qr<l||r<ql)return 0ll;
		push(v,l,r);
		if(ql<=l&&r<=qr)return tree[v];
		int mid=(l+r)>>1;
		return max(get(ql,qr,v<<1,l,mid),get(ql,qr,v<<1|1,mid+1,r));
	}
	void update(int ql,int qr,ll val,int v,int l,int r){
		push(v,l,r);
		if(qr<l||r<ql)return;
		if(ql<=l&&r<=qr){
			lazy[v]+=val;
			push(v,l,r);
			return;
		}
		int mid=(l+r)>>1;
		update(ql,qr,val,v<<1,l,mid);
		update(ql,qr,val,v<<1|1,mid+1,r);
		tree[v]=max(tree[v<<1],tree[v<<1|1]);
	}
};
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);
	MultiSegmentTree alls(n);
	for(int i=1;i<=n;i++)alls.update(i,i,go(i,0,depth[i],0),1,1,n);
	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.update(x,x,go(x,0,depth[x],0)-alls.get(x,x,1,1,n),1,1,n);
			x=par[x];
		}
		ans=alls.get(1,n,1,1,n);
		printf("%lld\n",ans);
	}
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:113:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |  scanf("%d%d%lld",&n,&q,&w[0]);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:115:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |   scanf("%d%d%lld",&edge[i].fr,&edge[i].sc,&w[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:126:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |   scanf("%lld%lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2580 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2660 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 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 3 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2580 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2660 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 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 3 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 138 ms 2860 KB Output is correct
20 Correct 149 ms 2892 KB Output is correct
21 Correct 187 ms 2988 KB Output is correct
22 Correct 243 ms 2888 KB Output is correct
23 Correct 741 ms 3704 KB Output is correct
24 Correct 1180 ms 3412 KB Output is correct
25 Correct 1267 ms 3608 KB Output is correct
26 Correct 1429 ms 3848 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2680 KB Output is correct
4 Correct 13 ms 2900 KB Output is correct
5 Correct 53 ms 3532 KB Output is correct
6 Correct 2 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 9 ms 2676 KB Output is correct
10 Correct 72 ms 2996 KB Output is correct
11 Correct 342 ms 3704 KB Output is correct
12 Correct 7 ms 3284 KB Output is correct
13 Correct 12 ms 3312 KB Output is correct
14 Correct 63 ms 3328 KB Output is correct
15 Correct 612 ms 3736 KB Output is correct
16 Correct 2952 ms 4436 KB Output is correct
17 Correct 87 ms 16220 KB Output is correct
18 Correct 185 ms 16152 KB Output is correct
19 Correct 1198 ms 16216 KB Output is correct
20 Execution timed out 5046 ms 16488 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2832 KB Output is correct
2 Correct 134 ms 2916 KB Output is correct
3 Correct 626 ms 3460 KB Output is correct
4 Correct 1266 ms 3884 KB Output is correct
5 Correct 129 ms 4052 KB Output is correct
6 Correct 1215 ms 4376 KB Output is correct
7 Execution timed out 5049 ms 5032 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5062 ms 16104 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2580 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2660 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 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 3 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 138 ms 2860 KB Output is correct
20 Correct 149 ms 2892 KB Output is correct
21 Correct 187 ms 2988 KB Output is correct
22 Correct 243 ms 2888 KB Output is correct
23 Correct 741 ms 3704 KB Output is correct
24 Correct 1180 ms 3412 KB Output is correct
25 Correct 1267 ms 3608 KB Output is correct
26 Correct 1429 ms 3848 KB Output is correct
27 Correct 3 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 3 ms 2680 KB Output is correct
30 Correct 13 ms 2900 KB Output is correct
31 Correct 53 ms 3532 KB Output is correct
32 Correct 2 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 9 ms 2676 KB Output is correct
36 Correct 72 ms 2996 KB Output is correct
37 Correct 342 ms 3704 KB Output is correct
38 Correct 7 ms 3284 KB Output is correct
39 Correct 12 ms 3312 KB Output is correct
40 Correct 63 ms 3328 KB Output is correct
41 Correct 612 ms 3736 KB Output is correct
42 Correct 2952 ms 4436 KB Output is correct
43 Correct 87 ms 16220 KB Output is correct
44 Correct 185 ms 16152 KB Output is correct
45 Correct 1198 ms 16216 KB Output is correct
46 Execution timed out 5046 ms 16488 KB Time limit exceeded
47 Halted 0 ms 0 KB -