oj.uz

Submission #579273

# Submission time Handle Problem Language Result Execution time Memory
579273 2022-06-18T17:20:50 Z temporary_juggernaut Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 187708 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;
map<int,ll>csh[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;
	}
	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-alls.get(v,v,1,1,n),1,1,n);
}
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);
	//Episode 2: Getting WA after TL
	for(int i=1;i^n;i++){
		ll pivot=w[i];
		cand_x=edge[i].fr;
		cand_y=edge[i].sc;
		int x=edge[i].fr;
		while(x){
			edit(x,pivot);
			x=par[x];
		}
	}
	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:184:3: note: in expansion of macro 'printl'
  184 |   printl("______________________");
      |   ^~~~~~
diameter.cpp:147:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  147 |  scanf("%d%d%lld",&n,&q,&w[0]);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:151:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  151 |   scanf("%d%d%lld",&edge[i].fr,&edge[i].sc,&w[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:171:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  171 |   scanf("%lld%lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 12112 KB Output is correct
4 Correct 6 ms 12040 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 7 ms 12116 KB Output is correct
7 Correct 7 ms 12116 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 7 ms 12116 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 7 ms 12116 KB Output is correct
13 Correct 7 ms 12244 KB Output is correct
14 Correct 8 ms 12244 KB Output is correct
15 Correct 8 ms 12244 KB Output is correct
16 Correct 7 ms 12244 KB Output is correct
17 Correct 8 ms 12244 KB Output is correct
18 Correct 7 ms 12240 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 12112 KB Output is correct
4 Correct 6 ms 12040 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 7 ms 12116 KB Output is correct
7 Correct 7 ms 12116 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 7 ms 12116 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 7 ms 12116 KB Output is correct
13 Correct 7 ms 12244 KB Output is correct
14 Correct 8 ms 12244 KB Output is correct
15 Correct 8 ms 12244 KB Output is correct
16 Correct 7 ms 12244 KB Output is correct
17 Correct 8 ms 12244 KB Output is correct
18 Correct 7 ms 12240 KB Output is correct
19 Correct 40 ms 13824 KB Output is correct
20 Correct 39 ms 13780 KB Output is correct
21 Correct 45 ms 13836 KB Output is correct
22 Correct 51 ms 13856 KB Output is correct
23 Correct 90 ms 20892 KB Output is correct
24 Correct 104 ms 20956 KB Output is correct
25 Correct 123 ms 21152 KB Output is correct
26 Correct 141 ms 21244 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12116 KB Output is correct
2 Correct 6 ms 12116 KB Output is correct
3 Correct 9 ms 12116 KB Output is correct
4 Correct 21 ms 12140 KB Output is correct
5 Correct 73 ms 12424 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 11 ms 13012 KB Output is correct
8 Correct 7 ms 12948 KB Output is correct
9 Correct 11 ms 12964 KB Output is correct
10 Correct 28 ms 13012 KB Output is correct
11 Correct 116 ms 13348 KB Output is correct
12 Correct 18 ms 20792 KB Output is correct
13 Correct 19 ms 20820 KB Output is correct
14 Correct 22 ms 20860 KB Output is correct
15 Correct 55 ms 20928 KB Output is correct
16 Correct 190 ms 21464 KB Output is correct
17 Correct 324 ms 184896 KB Output is correct
18 Correct 336 ms 184796 KB Output is correct
19 Correct 337 ms 184792 KB Output is correct
20 Correct 387 ms 185036 KB Output is correct
21 Correct 737 ms 185536 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 13780 KB Output is correct
2 Correct 54 ms 13844 KB Output is correct
3 Correct 218 ms 14064 KB Output is correct
4 Correct 421 ms 14428 KB Output is correct
5 Correct 135 ms 29540 KB Output is correct
6 Correct 204 ms 29508 KB Output is correct
7 Correct 532 ms 30488 KB Output is correct
8 Correct 900 ms 31364 KB Output is correct
9 Correct 843 ms 99288 KB Output is correct
10 Correct 959 ms 99476 KB Output is correct
11 Correct 1464 ms 100200 KB Output is correct
12 Correct 2091 ms 100592 KB Output is correct
13 Correct 1850 ms 186332 KB Output is correct
14 Correct 2024 ms 186316 KB Output is correct
15 Correct 2563 ms 186580 KB Output is correct
16 Correct 3391 ms 187192 KB Output is correct
17 Correct 4760 ms 187352 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4518 ms 186116 KB Output is correct
2 Correct 4787 ms 186256 KB Output is correct
3 Correct 4659 ms 186104 KB Output is correct
4 Correct 4632 ms 186224 KB Output is correct
5 Correct 4653 ms 186236 KB Output is correct
6 Correct 3685 ms 186476 KB Output is correct
7 Execution timed out 5055 ms 187708 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 12112 KB Output is correct
4 Correct 6 ms 12040 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 7 ms 12116 KB Output is correct
7 Correct 7 ms 12116 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 7 ms 12116 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 7 ms 12116 KB Output is correct
13 Correct 7 ms 12244 KB Output is correct
14 Correct 8 ms 12244 KB Output is correct
15 Correct 8 ms 12244 KB Output is correct
16 Correct 7 ms 12244 KB Output is correct
17 Correct 8 ms 12244 KB Output is correct
18 Correct 7 ms 12240 KB Output is correct
19 Correct 40 ms 13824 KB Output is correct
20 Correct 39 ms 13780 KB Output is correct
21 Correct 45 ms 13836 KB Output is correct
22 Correct 51 ms 13856 KB Output is correct
23 Correct 90 ms 20892 KB Output is correct
24 Correct 104 ms 20956 KB Output is correct
25 Correct 123 ms 21152 KB Output is correct
26 Correct 141 ms 21244 KB Output is correct
27 Correct 8 ms 12116 KB Output is correct
28 Correct 6 ms 12116 KB Output is correct
29 Correct 9 ms 12116 KB Output is correct
30 Correct 21 ms 12140 KB Output is correct
31 Correct 73 ms 12424 KB Output is correct
32 Correct 7 ms 11988 KB Output is correct
33 Correct 11 ms 13012 KB Output is correct
34 Correct 7 ms 12948 KB Output is correct
35 Correct 11 ms 12964 KB Output is correct
36 Correct 28 ms 13012 KB Output is correct
37 Correct 116 ms 13348 KB Output is correct
38 Correct 18 ms 20792 KB Output is correct
39 Correct 19 ms 20820 KB Output is correct
40 Correct 22 ms 20860 KB Output is correct
41 Correct 55 ms 20928 KB Output is correct
42 Correct 190 ms 21464 KB Output is correct
43 Correct 324 ms 184896 KB Output is correct
44 Correct 336 ms 184796 KB Output is correct
45 Correct 337 ms 184792 KB Output is correct
46 Correct 387 ms 185036 KB Output is correct
47 Correct 737 ms 185536 KB Output is correct
48 Correct 18 ms 13780 KB Output is correct
49 Correct 54 ms 13844 KB Output is correct
50 Correct 218 ms 14064 KB Output is correct
51 Correct 421 ms 14428 KB Output is correct
52 Correct 135 ms 29540 KB Output is correct
53 Correct 204 ms 29508 KB Output is correct
54 Correct 532 ms 30488 KB Output is correct
55 Correct 900 ms 31364 KB Output is correct
56 Correct 843 ms 99288 KB Output is correct
57 Correct 959 ms 99476 KB Output is correct
58 Correct 1464 ms 100200 KB Output is correct
59 Correct 2091 ms 100592 KB Output is correct
60 Correct 1850 ms 186332 KB Output is correct
61 Correct 2024 ms 186316 KB Output is correct
62 Correct 2563 ms 186580 KB Output is correct
63 Correct 3391 ms 187192 KB Output is correct
64 Correct 4760 ms 187352 KB Output is correct
65 Correct 4518 ms 186116 KB Output is correct
66 Correct 4787 ms 186256 KB Output is correct
67 Correct 4659 ms 186104 KB Output is correct
68 Correct 4632 ms 186224 KB Output is correct
69 Correct 4653 ms 186236 KB Output is correct
70 Correct 3685 ms 186476 KB Output is correct
71 Execution timed out 5055 ms 187708 KB Time limit exceeded
72 Halted 0 ms 0 KB -