oj.uz

Submission #579275

# Submission time Handle Problem Language Result Execution time Memory
579275 2022-06-18T17:26:19 Z temporary_juggernaut Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 4559 ms 200784 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[20];
int tin[100005][20];
int tout[100005][20];
ll w[100005];
multiset<ll>st[100005];
pair<int,int>edge[100005];
vector<pair<int,int>>g[100005];
bool vis[100005];
int sz[100005];
int par[100005];
int depth[100005];
int prepar[100005][20];
struct MultiSegmentTree{
	vector<ll>tree;
	vector<ll>lazy;
	MultiSegmentTree(){
	}
	MultiSegmentTree(int n){
		tree.assign(n<<2|3,0ll);
		lazy.assign(n<<2|3,0ll);
	}
	void push(int v,bool bit){
		if(bit){
			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]);
	}
};
MultiSegmentTree tree[20],alls;
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_tin(int v,int p,int &depth,int &kylych){
	tin[v][depth]=++timer[depth];
	prepar[v][depth]=kylych;
	for(auto &to:g[v])if((to.fr^p)&&(!vis[to.fr]))build_tin(to.fr,v,depth,kylych);
	tout[v][depth]=timer[depth];
}
ll cash;
unordered_map<int,ll>csh[100005];
ll scs[100005];
void go(int v,int p,int &depth,ll kylych){
	tree[depth].update(tin[v][depth],tin[v][depth],kylych,1,1,n);
	umax(cash,kylych);
	for(auto &to:g[v])if((to.fr^p)&&(!vis[to.fr]))go(to.fr,v,depth,kylych+w[to.sc]);
}
void build(int v,int p,int dep){
	build_sz(v,0);
	v=centroid(v,0,sz[v]>>1);
	tin[v][dep]=++timer[dep];
	for(auto &to:g[v])if((to.fr^p)&&(!vis[to.fr])){
		build_tin(to.fr,v,dep,to.fr);
	}
	tout[v][dep]=timer[dep];
	for(auto &to:g[v])if((to.fr^p)&&(!vis[to.fr])){
		cash=0;
		go(to.fr,v,dep,w[to.sc]);
		st[v].insert(cash);
		csh[v][to.fr]=cash;
	}
	//CALC ALLS
	if(!st[v].empty()){
		ll ans=0;
		auto it=st[v].rbegin();
		ans+=*it;
		if((int)st[v].size()!=1){
			it++;
			ans+=*it;
		}
		scs[v]=ans;
		alls.update(v,v,ans,1,1,n);
	}
	//END
	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;
int cand_x,cand_y;
void edit(int v,ll val){
	int x=cand_x;
	int y=cand_y;
	if(tin[x][depth[v]]<tin[y][depth[v]])swap(x,y);
	int child=prepar[x][depth[v]];
	st[v].erase(st[v].find(csh[v][child]));
	tree[depth[v]].update(tin[x][depth[v]],tout[x][depth[v]],val,1,1,n);
	csh[v][child]=tree[depth[v]].get(tin[child][depth[v]],tout[child][depth[v]],1,1,n);
	st[v].insert(csh[v][child]);
	ll ans=0;
	auto it=st[v].rbegin();
	ans+=*it;
	if((int)st[v].size()!=1){
		it++;
		ans+=*it;
	}
	alls.update(v,v,ans-scs[v],1,1,n);
	scs[v]=ans;
}
int main(){
	scanf("%d%d%lld",&n,&q,&w[0]);
	for(int i=0;i<20;i++)tree[i]=MultiSegmentTree(n);
	alls=MultiSegmentTree(n);
	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);
	while(q--){
		ll x;
		ll y;
		scanf("%lld%lld",&x,&y);
		x=((x+ans)%(n-1))+1;
		y=(y+ans)%w[0];
		ll pivot=y-w[x];
		w[x]=y;
		cand_x=edge[x].fr;
		cand_y=edge[x].sc;
		x=edge[x].fr;
		while(x){
			edit(x,pivot);
			x=par[x];
		}
		ans=alls.get(1,n,1,1,n);
		printl("______________________");
		printf("%lld\n",ans);
	}
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:18:29: warning: statement has no effect [-Wunused-value]
   18 |     #define printl(args...) 0
      |                             ^
diameter.cpp:188:3: note: in expansion of macro 'printl'
  188 |   printl("______________________");
      |   ^~~~~~
diameter.cpp:162:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  162 |  scanf("%d%d%lld",&n,&q,&w[0]);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:166:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  166 |   scanf("%d%d%lld",&edge[i].fr,&edge[i].sc,&w[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:175:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  175 |   scanf("%lld%lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12884 KB Output is correct
2 Correct 7 ms 12904 KB Output is correct
3 Correct 7 ms 12900 KB Output is correct
4 Correct 7 ms 12884 KB Output is correct
5 Correct 7 ms 12884 KB Output is correct
6 Correct 6 ms 12884 KB Output is correct
7 Correct 7 ms 12884 KB Output is correct
8 Correct 7 ms 12884 KB Output is correct
9 Correct 7 ms 12884 KB Output is correct
10 Correct 7 ms 12884 KB Output is correct
11 Correct 7 ms 12884 KB Output is correct
12 Correct 7 ms 12884 KB Output is correct
13 Correct 7 ms 12944 KB Output is correct
14 Correct 7 ms 13012 KB Output is correct
15 Correct 7 ms 13076 KB Output is correct
16 Correct 8 ms 12976 KB Output is correct
17 Correct 8 ms 13012 KB Output is correct
18 Correct 7 ms 13012 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12884 KB Output is correct
2 Correct 7 ms 12904 KB Output is correct
3 Correct 7 ms 12900 KB Output is correct
4 Correct 7 ms 12884 KB Output is correct
5 Correct 7 ms 12884 KB Output is correct
6 Correct 6 ms 12884 KB Output is correct
7 Correct 7 ms 12884 KB Output is correct
8 Correct 7 ms 12884 KB Output is correct
9 Correct 7 ms 12884 KB Output is correct
10 Correct 7 ms 12884 KB Output is correct
11 Correct 7 ms 12884 KB Output is correct
12 Correct 7 ms 12884 KB Output is correct
13 Correct 7 ms 12944 KB Output is correct
14 Correct 7 ms 13012 KB Output is correct
15 Correct 7 ms 13076 KB Output is correct
16 Correct 8 ms 12976 KB Output is correct
17 Correct 8 ms 13012 KB Output is correct
18 Correct 7 ms 13012 KB Output is correct
19 Correct 33 ms 14644 KB Output is correct
20 Correct 33 ms 14656 KB Output is correct
21 Correct 38 ms 14668 KB Output is correct
22 Correct 43 ms 14700 KB Output is correct
23 Correct 62 ms 21916 KB Output is correct
24 Correct 72 ms 21724 KB Output is correct
25 Correct 102 ms 21852 KB Output is correct
26 Correct 100 ms 22152 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12884 KB Output is correct
2 Correct 8 ms 12884 KB Output is correct
3 Correct 12 ms 12884 KB Output is correct
4 Correct 19 ms 13012 KB Output is correct
5 Correct 80 ms 13440 KB Output is correct
6 Correct 7 ms 12884 KB Output is correct
7 Correct 7 ms 13748 KB Output is correct
8 Correct 10 ms 13652 KB Output is correct
9 Correct 10 ms 13656 KB Output is correct
10 Correct 30 ms 13832 KB Output is correct
11 Correct 104 ms 14184 KB Output is correct
12 Correct 15 ms 21472 KB Output is correct
13 Correct 15 ms 21460 KB Output is correct
14 Correct 17 ms 21552 KB Output is correct
15 Correct 51 ms 21644 KB Output is correct
16 Correct 147 ms 21996 KB Output is correct
17 Correct 218 ms 183952 KB Output is correct
18 Correct 208 ms 183860 KB Output is correct
19 Correct 250 ms 183844 KB Output is correct
20 Correct 235 ms 183896 KB Output is correct
21 Correct 537 ms 184612 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14640 KB Output is correct
2 Correct 51 ms 14688 KB Output is correct
3 Correct 207 ms 14988 KB Output is correct
4 Correct 491 ms 15164 KB Output is correct
5 Correct 67 ms 30540 KB Output is correct
6 Correct 140 ms 30536 KB Output is correct
7 Correct 450 ms 30824 KB Output is correct
8 Correct 855 ms 31176 KB Output is correct
9 Correct 328 ms 100636 KB Output is correct
10 Correct 443 ms 100744 KB Output is correct
11 Correct 887 ms 101052 KB Output is correct
12 Correct 1458 ms 101344 KB Output is correct
13 Correct 702 ms 188364 KB Output is correct
14 Correct 832 ms 188412 KB Output is correct
15 Correct 1446 ms 188688 KB Output is correct
16 Correct 2142 ms 189096 KB Output is correct
17 Correct 3481 ms 189396 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2850 ms 189484 KB Output is correct
2 Correct 3006 ms 189868 KB Output is correct
3 Correct 3064 ms 189624 KB Output is correct
4 Correct 2892 ms 189716 KB Output is correct
5 Correct 2880 ms 189304 KB Output is correct
6 Correct 2559 ms 188044 KB Output is correct
7 Correct 3956 ms 192240 KB Output is correct
8 Correct 3946 ms 192328 KB Output is correct
9 Correct 4021 ms 192128 KB Output is correct
10 Correct 3931 ms 192408 KB Output is correct
11 Correct 3999 ms 191684 KB Output is correct
12 Correct 3619 ms 190388 KB Output is correct
13 Correct 4346 ms 197760 KB Output is correct
14 Correct 4422 ms 197700 KB Output is correct
15 Correct 4318 ms 197508 KB Output is correct
16 Correct 4510 ms 197616 KB Output is correct
17 Correct 4151 ms 196416 KB Output is correct
18 Correct 3692 ms 192696 KB Output is correct
19 Correct 4368 ms 197576 KB Output is correct
20 Correct 4450 ms 197440 KB Output is correct
21 Correct 4399 ms 197496 KB Output is correct
22 Correct 4338 ms 197440 KB Output is correct
23 Correct 4235 ms 196464 KB Output is correct
24 Correct 3701 ms 192656 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12884 KB Output is correct
2 Correct 7 ms 12904 KB Output is correct
3 Correct 7 ms 12900 KB Output is correct
4 Correct 7 ms 12884 KB Output is correct
5 Correct 7 ms 12884 KB Output is correct
6 Correct 6 ms 12884 KB Output is correct
7 Correct 7 ms 12884 KB Output is correct
8 Correct 7 ms 12884 KB Output is correct
9 Correct 7 ms 12884 KB Output is correct
10 Correct 7 ms 12884 KB Output is correct
11 Correct 7 ms 12884 KB Output is correct
12 Correct 7 ms 12884 KB Output is correct
13 Correct 7 ms 12944 KB Output is correct
14 Correct 7 ms 13012 KB Output is correct
15 Correct 7 ms 13076 KB Output is correct
16 Correct 8 ms 12976 KB Output is correct
17 Correct 8 ms 13012 KB Output is correct
18 Correct 7 ms 13012 KB Output is correct
19 Correct 33 ms 14644 KB Output is correct
20 Correct 33 ms 14656 KB Output is correct
21 Correct 38 ms 14668 KB Output is correct
22 Correct 43 ms 14700 KB Output is correct
23 Correct 62 ms 21916 KB Output is correct
24 Correct 72 ms 21724 KB Output is correct
25 Correct 102 ms 21852 KB Output is correct
26 Correct 100 ms 22152 KB Output is correct
27 Correct 7 ms 12884 KB Output is correct
28 Correct 8 ms 12884 KB Output is correct
29 Correct 12 ms 12884 KB Output is correct
30 Correct 19 ms 13012 KB Output is correct
31 Correct 80 ms 13440 KB Output is correct
32 Correct 7 ms 12884 KB Output is correct
33 Correct 7 ms 13748 KB Output is correct
34 Correct 10 ms 13652 KB Output is correct
35 Correct 10 ms 13656 KB Output is correct
36 Correct 30 ms 13832 KB Output is correct
37 Correct 104 ms 14184 KB Output is correct
38 Correct 15 ms 21472 KB Output is correct
39 Correct 15 ms 21460 KB Output is correct
40 Correct 17 ms 21552 KB Output is correct
41 Correct 51 ms 21644 KB Output is correct
42 Correct 147 ms 21996 KB Output is correct
43 Correct 218 ms 183952 KB Output is correct
44 Correct 208 ms 183860 KB Output is correct
45 Correct 250 ms 183844 KB Output is correct
46 Correct 235 ms 183896 KB Output is correct
47 Correct 537 ms 184612 KB Output is correct
48 Correct 15 ms 14640 KB Output is correct
49 Correct 51 ms 14688 KB Output is correct
50 Correct 207 ms 14988 KB Output is correct
51 Correct 491 ms 15164 KB Output is correct
52 Correct 67 ms 30540 KB Output is correct
53 Correct 140 ms 30536 KB Output is correct
54 Correct 450 ms 30824 KB Output is correct
55 Correct 855 ms 31176 KB Output is correct
56 Correct 328 ms 100636 KB Output is correct
57 Correct 443 ms 100744 KB Output is correct
58 Correct 887 ms 101052 KB Output is correct
59 Correct 1458 ms 101344 KB Output is correct
60 Correct 702 ms 188364 KB Output is correct
61 Correct 832 ms 188412 KB Output is correct
62 Correct 1446 ms 188688 KB Output is correct
63 Correct 2142 ms 189096 KB Output is correct
64 Correct 3481 ms 189396 KB Output is correct
65 Correct 2850 ms 189484 KB Output is correct
66 Correct 3006 ms 189868 KB Output is correct
67 Correct 3064 ms 189624 KB Output is correct
68 Correct 2892 ms 189716 KB Output is correct
69 Correct 2880 ms 189304 KB Output is correct
70 Correct 2559 ms 188044 KB Output is correct
71 Correct 3956 ms 192240 KB Output is correct
72 Correct 3946 ms 192328 KB Output is correct
73 Correct 4021 ms 192128 KB Output is correct
74 Correct 3931 ms 192408 KB Output is correct
75 Correct 3999 ms 191684 KB Output is correct
76 Correct 3619 ms 190388 KB Output is correct
77 Correct 4346 ms 197760 KB Output is correct
78 Correct 4422 ms 197700 KB Output is correct
79 Correct 4318 ms 197508 KB Output is correct
80 Correct 4510 ms 197616 KB Output is correct
81 Correct 4151 ms 196416 KB Output is correct
82 Correct 3692 ms 192696 KB Output is correct
83 Correct 4368 ms 197576 KB Output is correct
84 Correct 4450 ms 197440 KB Output is correct
85 Correct 4399 ms 197496 KB Output is correct
86 Correct 4338 ms 197440 KB Output is correct
87 Correct 4235 ms 196464 KB Output is correct
88 Correct 3701 ms 192656 KB Output is correct
89 Correct 2846 ms 191524 KB Output is correct
90 Correct 3302 ms 193120 KB Output is correct
91 Correct 3791 ms 194488 KB Output is correct
92 Correct 3994 ms 195248 KB Output is correct
93 Correct 4042 ms 197036 KB Output is correct
94 Correct 4222 ms 197572 KB Output is correct
95 Correct 4307 ms 198964 KB Output is correct
96 Correct 4328 ms 198568 KB Output is correct
97 Correct 4513 ms 198852 KB Output is correct
98 Correct 4531 ms 200784 KB Output is correct
99 Correct 4559 ms 198956 KB Output is correct
100 Correct 4341 ms 198872 KB Output is correct