oj.uz

Submission #579254

# Submission time Handle Problem Language Result Execution time Memory
579254 2022-06-18T16:25:30 Z temporary_juggernaut Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 5000 ms 175996 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];
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];
}
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);
		st[v].insert(0ll);
	}
	tout[v][dep]=timer[dep];
	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(){
	}
	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]);
	}
};
MultiSegmentTree tree[20],alls;
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(tree[depth[v]].get(tin[child][depth[v]],tout[child][depth[v]],1,1,n)));
	tree[depth[v]].update(tin[x][depth[v]],tout[x][depth[v]],val,1,1,n);
	st[v].insert(tree[depth[v]].get(tin[child][depth[v]],tout[child][depth[v]],1,1,n));
	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);
	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:170:3: note: in expansion of macro 'printl'
  170 |   printl("______________________");
      |   ^~~~~~
diameter.cpp:134:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  134 |  scanf("%d%d%lld",&n,&q,&w[0]);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:138:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  138 |   scanf("%d%d%lld",&edge[i].fr,&edge[i].sc,&w[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:157:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  157 |   scanf("%lld%lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7380 KB Output is correct
2 Correct 5 ms 7368 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7368 KB Output is correct
5 Correct 5 ms 7368 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 5 ms 7368 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 5 ms 7368 KB Output is correct
11 Correct 5 ms 7380 KB Output is correct
12 Correct 5 ms 7380 KB Output is correct
13 Correct 5 ms 7508 KB Output is correct
14 Correct 5 ms 7508 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct
16 Correct 5 ms 7496 KB Output is correct
17 Correct 5 ms 7508 KB Output is correct
18 Correct 6 ms 7508 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7380 KB Output is correct
2 Correct 5 ms 7368 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7368 KB Output is correct
5 Correct 5 ms 7368 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 5 ms 7368 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 5 ms 7368 KB Output is correct
11 Correct 5 ms 7380 KB Output is correct
12 Correct 5 ms 7380 KB Output is correct
13 Correct 5 ms 7508 KB Output is correct
14 Correct 5 ms 7508 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct
16 Correct 5 ms 7496 KB Output is correct
17 Correct 5 ms 7508 KB Output is correct
18 Correct 6 ms 7508 KB Output is correct
19 Correct 37 ms 9116 KB Output is correct
20 Correct 39 ms 9040 KB Output is correct
21 Correct 47 ms 9136 KB Output is correct
22 Correct 50 ms 9160 KB Output is correct
23 Correct 101 ms 15992 KB Output is correct
24 Correct 135 ms 16000 KB Output is correct
25 Correct 131 ms 16024 KB Output is correct
26 Correct 171 ms 16212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7364 KB Output is correct
3 Correct 6 ms 7380 KB Output is correct
4 Correct 18 ms 7596 KB Output is correct
5 Correct 76 ms 8088 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 5 ms 8148 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 7 ms 8148 KB Output is correct
10 Correct 27 ms 8412 KB Output is correct
11 Correct 133 ms 8908 KB Output is correct
12 Correct 15 ms 15828 KB Output is correct
13 Correct 16 ms 15932 KB Output is correct
14 Correct 19 ms 15956 KB Output is correct
15 Correct 50 ms 16052 KB Output is correct
16 Correct 212 ms 16560 KB Output is correct
17 Correct 308 ms 174292 KB Output is correct
18 Correct 308 ms 174276 KB Output is correct
19 Correct 325 ms 174184 KB Output is correct
20 Correct 351 ms 174380 KB Output is correct
21 Correct 688 ms 175856 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 9044 KB Output is correct
2 Correct 66 ms 9172 KB Output is correct
3 Correct 254 ms 9424 KB Output is correct
4 Correct 511 ms 9956 KB Output is correct
5 Correct 172 ms 24276 KB Output is correct
6 Correct 246 ms 24360 KB Output is correct
7 Correct 661 ms 24632 KB Output is correct
8 Correct 1186 ms 25528 KB Output is correct
9 Correct 1026 ms 91436 KB Output is correct
10 Correct 1171 ms 91400 KB Output is correct
11 Correct 1746 ms 91744 KB Output is correct
12 Correct 2485 ms 92584 KB Output is correct
13 Correct 2289 ms 174976 KB Output is correct
14 Correct 2429 ms 175164 KB Output is correct
15 Correct 3240 ms 175744 KB Output is correct
16 Correct 4083 ms 175996 KB Output is correct
17 Execution timed out 5049 ms 175924 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7380 KB Output is correct
2 Correct 5 ms 7368 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7368 KB Output is correct
5 Correct 5 ms 7368 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 5 ms 7368 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 5 ms 7368 KB Output is correct
11 Correct 5 ms 7380 KB Output is correct
12 Correct 5 ms 7380 KB Output is correct
13 Correct 5 ms 7508 KB Output is correct
14 Correct 5 ms 7508 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct
16 Correct 5 ms 7496 KB Output is correct
17 Correct 5 ms 7508 KB Output is correct
18 Correct 6 ms 7508 KB Output is correct
19 Correct 37 ms 9116 KB Output is correct
20 Correct 39 ms 9040 KB Output is correct
21 Correct 47 ms 9136 KB Output is correct
22 Correct 50 ms 9160 KB Output is correct
23 Correct 101 ms 15992 KB Output is correct
24 Correct 135 ms 16000 KB Output is correct
25 Correct 131 ms 16024 KB Output is correct
26 Correct 171 ms 16212 KB Output is correct
27 Correct 5 ms 7380 KB Output is correct
28 Correct 4 ms 7364 KB Output is correct
29 Correct 6 ms 7380 KB Output is correct
30 Correct 18 ms 7596 KB Output is correct
31 Correct 76 ms 8088 KB Output is correct
32 Correct 5 ms 7380 KB Output is correct
33 Correct 5 ms 8148 KB Output is correct
34 Correct 5 ms 8148 KB Output is correct
35 Correct 7 ms 8148 KB Output is correct
36 Correct 27 ms 8412 KB Output is correct
37 Correct 133 ms 8908 KB Output is correct
38 Correct 15 ms 15828 KB Output is correct
39 Correct 16 ms 15932 KB Output is correct
40 Correct 19 ms 15956 KB Output is correct
41 Correct 50 ms 16052 KB Output is correct
42 Correct 212 ms 16560 KB Output is correct
43 Correct 308 ms 174292 KB Output is correct
44 Correct 308 ms 174276 KB Output is correct
45 Correct 325 ms 174184 KB Output is correct
46 Correct 351 ms 174380 KB Output is correct
47 Correct 688 ms 175856 KB Output is correct
48 Correct 17 ms 9044 KB Output is correct
49 Correct 66 ms 9172 KB Output is correct
50 Correct 254 ms 9424 KB Output is correct
51 Correct 511 ms 9956 KB Output is correct
52 Correct 172 ms 24276 KB Output is correct
53 Correct 246 ms 24360 KB Output is correct
54 Correct 661 ms 24632 KB Output is correct
55 Correct 1186 ms 25528 KB Output is correct
56 Correct 1026 ms 91436 KB Output is correct
57 Correct 1171 ms 91400 KB Output is correct
58 Correct 1746 ms 91744 KB Output is correct
59 Correct 2485 ms 92584 KB Output is correct
60 Correct 2289 ms 174976 KB Output is correct
61 Correct 2429 ms 175164 KB Output is correct
62 Correct 3240 ms 175744 KB Output is correct
63 Correct 4083 ms 175996 KB Output is correct
64 Execution timed out 5049 ms 175924 KB Time limit exceeded
65 Halted 0 ms 0 KB -