oj.uz

Submission #276033

# Submission time Handle Problem Language Result Execution time Memory
276033 2020-08-20T10:03:13 Z AKaan37 Dynamic Diameter (CEOI19_diameter) C++17
55 / 100
 2336 ms 28316 KB 
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;
typedef pair< lo,PII > PIII;

#define fi first
#define se second
#define mp make_pair
#define int long long
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 100005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,t,x[li],y[li],z[li],mx,ind,dep[li],st[li],en[li],lazy[li*4],say,hedef,parca[li],indis[li];
int cev;
PIII tree[li*4];
multiset<int> stt;
string s;
vector<PII> v[li];

inline void dfs(int node,int ata,int der){
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i].fi;
		int co=v[node][i].se;
		if(go==ata)continue;
		dfs(go,node,der+co);
	}
	if(der>mx)ind=node;
	mx=max(mx,der);
	dep[node]=der;
}

inline void dfs1(int node,int ata){
	int flag=0;
	if(ata==1)parca[node]=node;
	else if(node!=1)parca[node]=parca[ata];
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i].fi;
		if(go==ata)continue;
		
		dfs1(go,node);
		flag=1;
		if(st[node]==0)st[node]=st[go];
		else st[node]=min(st[node],st[go]);
		en[node]=max(en[node],en[go]);
	}
	if(flag==0){
		st[node]=++say;
		indis[say]=node;
		en[node]=say;
	}
}

inline void build(int node,int start,int end){
	if(start==end){tree[node]={dep[indis[start]],{start,parca[indis[start]]}};return ;}
	build(node*2,start,mid),build(node*2+1,mid+1,end);
	tree[node]=max(tree[node*2],tree[node*2+1]);
}

inline void push(int node,int start,int end){
	if(lazy[node]==0)return ;
	tree[node].fi+=lazy[node];
	if(start!=end){
		lazy[node*2]+=lazy[node];
		lazy[node*2+1]+=lazy[node];
	}
	lazy[node]=0;
}

inline void update(int node,int start,int end,int l,int r,int val){
	push(node,start,end);
	if(start>end || start>r || end<l)return ;
	if(start>=l && end<=r){
		lazy[node]=val;
		push(node,start,end);
		return ;
	}
	update(node*2,start,mid,l,r,val),update(node*2+1,mid+1,end,l,r,val);
	tree[node]=max(tree[node*2],tree[node*2+1]);
}


inline PIII query(int node,int start,int end,int l,int r){
	if(start>end || start>r || end<l)return {0,{0,0}};
	push(node,start,end);
	if(start>=l && end<=r)return tree[node];
	return max(query(node*2,start,mid,l,r),query(node*2+1,mid+1,end,l,r));
}

int32_t main(void){
	//~ freopen("at.txt","r",stdin);
	//~ freopen("att.txt","w",stdout);
	scanf("%lld %lld %lld",&n,&t,&k);
	int yes=0;
	for(int i=1;i<n;i++){
		scanf("%lld %lld %lld",&x[i],&y[i],&z[i]);
		stt.insert(z[i]);
		if(x[i]==1)yes++;
		if(y[i]==1)yes++;
	}
	if(n*t<=5000*5000){
		while(t--){
			int d,e;
			scanf("%lld %lld",&d,&e);
			z[(d+cev)%(n-1)+1]=(cev+e)%k;
			FOR v[i].clear();
			for(int i=1;i<n;i++){
				v[x[i]].pb({y[i],z[i]});
				v[y[i]].pb({x[i],z[i]});
			}
			mx=0;
			dfs(1,0,0);
			mx=0;
			dfs(ind,0,0);
			cev=mx;
			printf("%lld\n",cev);
		}
		return 0;
	}
	if(yes==n-1){
		while(t--){
			int d,e;
			scanf("%lld %lld",&d,&e);
			stt.erase(stt.find(z[(d+cev)%(n-1)+1]));
			z[(d+cev)%(n-1)+1]=(cev+e)%k;
			stt.insert(z[(d+cev)%(n-1)+1]);
			auto it=stt.end();
			if(it==stt.begin()){cev=0;printf("%lld\n",cev);continue;}
			it--;
			cev=*it;
			if(it==stt.begin()){printf("%lld\n",cev);continue;}
			it--;
			cev+=*it;
			printf("%lld\n",cev);
		}
		return 0;
	}
	for(int i=1;i<n;i++){
		v[x[i]].pb({y[i],z[i]});
		v[y[i]].pb({x[i],z[i]});
	}
	dfs(1,0,0);
	dfs1(1,0);
	build(1,1,say);
	//~ cout<<say<<endl;
	while(t--){
		int d,e;
		scanf("%lld %lld",&d,&e);
		if(dep[y[(d+cev)%(n-1)+1]]<dep[x[(d+cev)%(n-1)+1]])swap(x[(d+cev)%(n-1)+1],y[(d+cev)%(n-1)+1]);
		update(1,1,say,st[y[(d+cev)%(n-1)+1]],en[y[(d+cev)%(n-1)+1]],-z[(d+cev)%(n-1)+1]+((cev+e)%k));
		z[(d+cev)%(n-1)+1]=(cev+e)%k;
		//~ update(1,1,say,st[y[(d+cev)%(n-1)+1]],en[y[(d+cev)%(n-1)+1]],z[(d+cev)%(n-1)+1]);
		PIII at=query(1,1,say,1,say);
		cev=at.fi;
		int mxx=0;
		//~ cout<<say<<" : : "<<at.se.se<<" : : "<<st[at.se.se]<<" : : "<<en[at.se.se]<<endl;
		if(st[at.se.se]>1)mxx=max(mxx,query(1,1,say,1,st[at.se.se]-1).fi);
		if(en[at.se.se]<say)mxx=max(mxx,query(1,1,say,en[at.se.se]+1,say).fi);
		cev+=mxx;
		printf("%lld\n",cev);
	}
	return 0;
}

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:110:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  110 |  scanf("%lld %lld %lld",&n,&t,&k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:113:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  113 |   scanf("%lld %lld %lld",&x[i],&y[i],&z[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:121:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  121 |    scanf("%lld %lld",&d,&e);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~
diameter.cpp:140:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  140 |    scanf("%lld %lld",&d,&e);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~
diameter.cpp:165:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  165 |   scanf("%lld %lld",&d,&e);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 2 ms 2728 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 3 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 3 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 3 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 335 ms 2944 KB Output is correct
20 Correct 291 ms 2952 KB Output is correct
21 Correct 295 ms 2944 KB Output is correct
22 Correct 342 ms 2944 KB Output is correct
23 Correct 1996 ms 3704 KB Output is correct
24 Correct 2037 ms 3700 KB Output is correct
25 Correct 2164 ms 3708 KB Output is correct
26 Correct 2336 ms 3800 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2724 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 23 ms 2944 KB Output is correct
5 Correct 109 ms 3832 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 3 ms 2816 KB Output is correct
8 Correct 6 ms 2816 KB Output is correct
9 Correct 35 ms 2816 KB Output is correct
10 Correct 331 ms 3192 KB Output is correct
11 Correct 78 ms 4088 KB Output is correct
12 Correct 8 ms 3456 KB Output is correct
13 Correct 37 ms 3456 KB Output is correct
14 Correct 327 ms 3576 KB Output is correct
15 Correct 19 ms 3456 KB Output is correct
16 Correct 74 ms 4600 KB Output is correct
17 Correct 154 ms 16360 KB Output is correct
18 Correct 740 ms 16360 KB Output is correct
19 Correct 76 ms 11000 KB Output is correct
20 Correct 98 ms 11256 KB Output is correct
21 Correct 279 ms 11856 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2816 KB Output is correct
2 Correct 406 ms 3124 KB Output is correct
3 Incorrect 38 ms 3704 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 27640 KB Output is correct
2 Correct 364 ms 25780 KB Output is correct
3 Correct 341 ms 25720 KB Output is correct
4 Correct 335 ms 25720 KB Output is correct
5 Correct 344 ms 25460 KB Output is correct
6 Correct 321 ms 28316 KB Output is correct
7 Correct 318 ms 26236 KB Output is correct
8 Correct 318 ms 26488 KB Output is correct
9 Correct 328 ms 26500 KB Output is correct
10 Correct 333 ms 27512 KB Output is correct
11 Correct 315 ms 27388 KB Output is correct
12 Correct 294 ms 26040 KB Output is correct
13 Correct 232 ms 25976 KB Output is correct
14 Correct 233 ms 25976 KB Output is correct
15 Correct 260 ms 26076 KB Output is correct
16 Correct 277 ms 26052 KB Output is correct
17 Correct 289 ms 26488 KB Output is correct
18 Correct 268 ms 26748 KB Output is correct
19 Correct 229 ms 26120 KB Output is correct
20 Correct 213 ms 25964 KB Output is correct
21 Correct 224 ms 26024 KB Output is correct
22 Correct 293 ms 26228 KB Output is correct
23 Correct 255 ms 26356 KB Output is correct
24 Correct 279 ms 26732 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 2 ms 2728 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 3 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 3 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 3 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 335 ms 2944 KB Output is correct
20 Correct 291 ms 2952 KB Output is correct
21 Correct 295 ms 2944 KB Output is correct
22 Correct 342 ms 2944 KB Output is correct
23 Correct 1996 ms 3704 KB Output is correct
24 Correct 2037 ms 3700 KB Output is correct
25 Correct 2164 ms 3708 KB Output is correct
26 Correct 2336 ms 3800 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 2 ms 2724 KB Output is correct
29 Correct 4 ms 2688 KB Output is correct
30 Correct 23 ms 2944 KB Output is correct
31 Correct 109 ms 3832 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 3 ms 2816 KB Output is correct
34 Correct 6 ms 2816 KB Output is correct
35 Correct 35 ms 2816 KB Output is correct
36 Correct 331 ms 3192 KB Output is correct
37 Correct 78 ms 4088 KB Output is correct
38 Correct 8 ms 3456 KB Output is correct
39 Correct 37 ms 3456 KB Output is correct
40 Correct 327 ms 3576 KB Output is correct
41 Correct 19 ms 3456 KB Output is correct
42 Correct 74 ms 4600 KB Output is correct
43 Correct 154 ms 16360 KB Output is correct
44 Correct 740 ms 16360 KB Output is correct
45 Correct 76 ms 11000 KB Output is correct
46 Correct 98 ms 11256 KB Output is correct
47 Correct 279 ms 11856 KB Output is correct
48 Correct 41 ms 2816 KB Output is correct
49 Correct 406 ms 3124 KB Output is correct
50 Incorrect 38 ms 3704 KB Output isn't correct
51 Halted 0 ms 0 KB -