oj.uz

Submission #276001

# Submission time Handle Problem Language Result Execution time Memory
276001 2020-08-20T09:13:54 Z AKaan37 Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 2218 ms 15208 KB 
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#include <bits/stdc++.h>

using namespace std;

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

#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,flag,t,x[li],y[li],z[li],mx,ind,dep[li],st[li],en[li],lazy[li*4],say,hedef;
int cev;
PII tree[li];
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){
	flag=0;
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i].fi;
		if(go==ata)continue;
		flag=1;
		dfs1(go,node);
		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;
		en[node]=say;
	}
}

inline void build(int node,int start,int end){
	if(start==end){tree[node]={dep[start],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 void update1(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){
		tree[node]={val,start};
		return ;
	}
	update1(node*2,start,mid,l,r,val),update1(node*2+1,mid+1,end,l,r,val);
	tree[node]=max(tree[node*2],tree[node*2+1]);
}

inline PII query(int node,int start,int end,int l,int r){
	if(start>end || start>r || end<l)return {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){
	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;
	}
	dfs(1,0,0);
	dfs1(1,0);
	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]);
		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]);
		PII at=query(1,1,say,1,say);
		cev=at.fi;
		int tut=cev;
		update1(1,1,say,at.se,at.se,0);
		cev+=query(1,1,say,1,say).fi;
		update1(1,1,say,at.se,at.se,tut);
		printf("%lld\n",cev);
	}
	return 0;
}

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:113:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  113 |  scanf("%lld %lld %lld",&n,&t,&k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:116:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  116 |   scanf("%lld %lld %lld",&x[i],&y[i],&z[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:124:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  124 |    scanf("%lld %lld",&d,&e);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~
diameter.cpp:143:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  143 |    scanf("%lld %lld",&d,&e);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~
diameter.cpp:162:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  162 |   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 2 ms 2816 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 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 2 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 2 ms 2688 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2688 KB Output is correct
18 Correct 2 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 2 ms 2816 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 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 2 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 2 ms 2688 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2688 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 272 ms 2940 KB Output is correct
20 Correct 277 ms 2936 KB Output is correct
21 Correct 309 ms 3016 KB Output is correct
22 Correct 323 ms 3216 KB Output is correct
23 Correct 1895 ms 3544 KB Output is correct
24 Correct 2077 ms 3564 KB Output is correct
25 Correct 2174 ms 3488 KB Output is correct
26 Correct 2218 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 2688 KB Output is correct
3 Correct 5 ms 2688 KB Output is correct
4 Correct 26 ms 2816 KB Output is correct
5 Correct 113 ms 3096 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 325 ms 2816 KB Output is correct
11 Correct 70 ms 3192 KB Output is correct
12 Correct 8 ms 3328 KB Output is correct
13 Correct 36 ms 3328 KB Output is correct
14 Correct 324 ms 3496 KB Output is correct
15 Correct 18 ms 3200 KB Output is correct
16 Correct 72 ms 3576 KB Output is correct
17 Correct 159 ms 15208 KB Output is correct
18 Correct 763 ms 15208 KB Output is correct
19 Correct 85 ms 9720 KB Output is correct
20 Correct 105 ms 9848 KB Output is correct
21 Correct 228 ms 10360 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 401 ms 3168 KB Output is correct
3 Incorrect 24 ms 2936 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 143 ms 10008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2816 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 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 2 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 2 ms 2688 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2688 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 272 ms 2940 KB Output is correct
20 Correct 277 ms 2936 KB Output is correct
21 Correct 309 ms 3016 KB Output is correct
22 Correct 323 ms 3216 KB Output is correct
23 Correct 1895 ms 3544 KB Output is correct
24 Correct 2077 ms 3564 KB Output is correct
25 Correct 2174 ms 3488 KB Output is correct
26 Correct 2218 ms 3800 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 5 ms 2688 KB Output is correct
30 Correct 26 ms 2816 KB Output is correct
31 Correct 113 ms 3096 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 325 ms 2816 KB Output is correct
37 Correct 70 ms 3192 KB Output is correct
38 Correct 8 ms 3328 KB Output is correct
39 Correct 36 ms 3328 KB Output is correct
40 Correct 324 ms 3496 KB Output is correct
41 Correct 18 ms 3200 KB Output is correct
42 Correct 72 ms 3576 KB Output is correct
43 Correct 159 ms 15208 KB Output is correct
44 Correct 763 ms 15208 KB Output is correct
45 Correct 85 ms 9720 KB Output is correct
46 Correct 105 ms 9848 KB Output is correct
47 Correct 228 ms 10360 KB Output is correct
48 Correct 41 ms 2816 KB Output is correct
49 Correct 401 ms 3168 KB Output is correct
50 Incorrect 24 ms 2936 KB Output isn't correct
51 Halted 0 ms 0 KB -