oj.uz

Submission #252051

# Submission time Handle Problem Language Result Execution time Memory
252051 2020-07-24T02:17:51 Z errorgorn Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 4510 ms 201040 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

ll MAX(ll a){return a;}
ll MIN(ll a){return a;}
template<typename... Args>
ll MAX(ll a,Args... args){return max(a,MAX(args...));}
template<typename... Args>
ll MIN(ll a,Args... args){return min(a,MIN(args...));}

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

struct node{
	int s,e,m;
	ii val;
	ll lazy=0;
	node *l,*r;
	
	node (int _s,int _e){
		s=_s,e=_e,m=s+e>>1;
		val=ii(0,s);
		
		if (s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
		}
	}
	
	void propo(){
		if (lazy){
			val.fi+=lazy;
			
			if (s!=e){
				l->lazy+=lazy;
				r->lazy+=lazy;
			}
			
			lazy=0;
		}
	}
	
	void update(int i,int j,ll k){
		if (s==i && e==j) lazy+=k;
		else{
			if (j<=m) l->update(i,j,k);
			else if (m<i) r->update(i,j,k);
			else l->update(i,m,k),r->update(m+1,j,k);
			
			l->propo(),r->propo();
			val=max(l->val,r->val);
		}
	}
	
	ii query(int i,int j){
		propo();
		
		if (s==i && e==j) return val;
		else if (j<=m) return l->query(i,j);
		else if (m<i) return r->query(i,j);
		else return max(l->query(i,m),r->query(m+1,j));
	}
};

struct mxnode{
	int s,e,m;
	ll val=0;
	mxnode *l,*r;
	
	mxnode (int _s,int _e){
		s=_s,e=_e,m=s+e>>1;
		
		if (s!=e){
			l=new mxnode(s,m);
			r=new mxnode(m+1,e);
		}
	}
	
	void update(int i,ll j){
		if (s==e) val=j;
		else{
			if (i<=m) l->update(i,j);
			else r->update(i,j);
			
			val=max(l->val,r->val);
		}
	}
} *mxroot=new mxnode(0,100005);

ll n,q,w;
vector<ii> al[100005];

bool used[100005];
int ss[100005];

void dfs_c(int i,int p){
	ss[i]=1;

	for (auto &it:al[i]){
		if (it.fi==p || used[it.fi]) continue;
		
		dfs_c(it.fi,i);
		ss[i]+=ss[it.fi];
	}
}

ll cw[100005];
vector<ii> range[100005];
vector<ii> subtree[100005];
vector<ii> pos[100005];
node* root[100005];

bool degen[100005];

int TIME;
ii dfs(int i,int p,int root){
	ii r=ii(1e9,-1e9);
	
	for (auto &it:al[i]){
		if (it.fi==p || used[it.fi]) continue;
		
		auto temp=dfs(it.fi,i,root);
		
		if (i==root){
			rep(x,temp.fi,temp.se+1) subtree[root].push_back(temp);
		}
		
		pos[it.se].push_back(ii(root,sz(range[root])));
		range[root].push_back(temp);
		
		r.fi=min(r.fi,temp.fi);
		r.se=max(r.se,temp.se);
	}
	
	if (r==ii(1e9,-1e9)){
		r=ii(TIME,TIME);
		TIME++;
	}
	
	return r;
}

void centroid(int i,int sz){
	//cout<<i<<" "<<sz<<endl;

	dfs_c(i,-1);
	
	int p=-1;
	reloop:
	for (auto &it:al[i]){
		if (it.fi==p || used[it.fi]) continue;
		
		if (ss[it.fi]>sz/2){
			p=i;
			i=it.fi;
			goto reloop;
		}
	}
	
	if (sz!=1){
		TIME=1;
		subtree[i].push_back(ii(1,1));
		root[i]=new node(0,dfs(i,-1,i).se+1);
	}
	else{
		degen[i]=true;
	}
	
	used[i]=true;
	
	sz--;
	for (auto &it:al[i]){
		if (it.fi==p || used[it.fi]) continue;
		
		sz-=ss[it.fi];
		centroid(it.fi,ss[it.fi]);
	}
	
	if (p!=-1) centroid(p,sz);
}

void get(int i){
	auto temp=root[i]->query(root[i]->s,root[i]->e);
	mxroot->update(i,temp.fi+max(root[i]->query(root[i]->s,subtree[i][temp.se].fi-1),root[i]->query(subtree[i][temp.se].se+1,root[i]->e)).fi);
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n>>q>>w;
	
	ll a,b,c;
	rep(x,0,n-1){
		cin>>a>>b>>c;
		
		al[a].push_back(ii(b,x));
		al[b].push_back(ii(a,x));
		cw[x]=c;
	}
	
	centroid(1,n);
	
	rep(x,0,n-1){
		for (auto &it:pos[x]){
			root[it.fi]->update(range[it.fi][it.se].fi,range[it.fi][it.se].se,cw[x]);
		}
	}
	
	rep(x,1,n+1){
		if (degen[x]) continue;
		
		get(x);
	}
	
	ll last=0;
	ll d,e;
	while (q--){
		cin>>d>>e;
		
		d=(d+last)%(n-1);
		e=(e+last)%w;
		
		for (auto &it:pos[d]){
			root[it.fi]->update(range[it.fi][it.se].fi,range[it.fi][it.se].se,e-cw[d]);
			get(it.fi);
		}
		cw[d]=e;
		
		last=mxroot->val;
		cout<<last<<endl;
	}
}

Compilation message

diameter.cpp: In constructor 'node::node(int, int)':
diameter.cpp:41:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   s=_s,e=_e,m=s+e>>1;
               ~^~
diameter.cpp: In constructor 'mxnode::mxnode(int, int)':
diameter.cpp:91:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   s=_s,e=_e,m=s+e>>1;
               ~^~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 23 ms 19192 KB Output is correct
4 Correct 14 ms 19200 KB Output is correct
5 Correct 14 ms 19200 KB Output is correct
6 Correct 14 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 16 ms 19192 KB Output is correct
9 Correct 24 ms 19200 KB Output is correct
10 Correct 15 ms 19200 KB Output is correct
11 Correct 14 ms 19200 KB Output is correct
12 Correct 15 ms 19200 KB Output is correct
13 Correct 15 ms 19200 KB Output is correct
14 Correct 15 ms 19200 KB Output is correct
15 Correct 17 ms 19200 KB Output is correct
16 Correct 15 ms 19200 KB Output is correct
17 Correct 15 ms 19200 KB Output is correct
18 Correct 15 ms 19200 KB Output is correct
19 Correct 28 ms 19968 KB Output is correct
20 Correct 29 ms 19968 KB Output is correct
21 Correct 33 ms 20216 KB Output is correct
22 Correct 27 ms 19960 KB Output is correct
23 Correct 50 ms 23672 KB Output is correct
24 Correct 62 ms 24388 KB Output is correct
25 Correct 81 ms 25128 KB Output is correct
26 Correct 53 ms 23900 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 19200 KB Output is correct
2 Correct 16 ms 19200 KB Output is correct
3 Correct 21 ms 19200 KB Output is correct
4 Correct 24 ms 19200 KB Output is correct
5 Correct 77 ms 19576 KB Output is correct
6 Correct 14 ms 19200 KB Output is correct
7 Correct 16 ms 19328 KB Output is correct
8 Correct 16 ms 19328 KB Output is correct
9 Correct 18 ms 19328 KB Output is correct
10 Correct 28 ms 19328 KB Output is correct
11 Correct 84 ms 19612 KB Output is correct
12 Correct 18 ms 20352 KB Output is correct
13 Correct 20 ms 20352 KB Output is correct
14 Correct 22 ms 20480 KB Output is correct
15 Correct 34 ms 20480 KB Output is correct
16 Correct 108 ms 20984 KB Output is correct
17 Correct 91 ms 44004 KB Output is correct
18 Correct 97 ms 44004 KB Output is correct
19 Correct 93 ms 44004 KB Output is correct
20 Correct 122 ms 44128 KB Output is correct
21 Correct 255 ms 44640 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 20224 KB Output is correct
2 Correct 39 ms 20224 KB Output is correct
3 Correct 129 ms 20600 KB Output is correct
4 Correct 230 ms 20856 KB Output is correct
5 Correct 66 ms 34168 KB Output is correct
6 Correct 111 ms 34196 KB Output is correct
7 Correct 332 ms 34292 KB Output is correct
8 Correct 546 ms 34688 KB Output is correct
9 Correct 311 ms 105068 KB Output is correct
10 Correct 410 ms 105040 KB Output is correct
11 Correct 780 ms 105320 KB Output is correct
12 Correct 1151 ms 105568 KB Output is correct
13 Correct 640 ms 200200 KB Output is correct
14 Correct 751 ms 200164 KB Output is correct
15 Correct 1177 ms 200372 KB Output is correct
16 Correct 1721 ms 200592 KB Output is correct
17 Correct 2506 ms 201040 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2993 ms 147340 KB Output is correct
2 Correct 3161 ms 151196 KB Output is correct
3 Correct 3008 ms 150028 KB Output is correct
4 Correct 3091 ms 151716 KB Output is correct
5 Correct 3052 ms 144232 KB Output is correct
6 Correct 2372 ms 100752 KB Output is correct
7 Correct 4413 ms 169768 KB Output is correct
8 Correct 4318 ms 173668 KB Output is correct
9 Correct 4510 ms 173428 KB Output is correct
10 Correct 4424 ms 173496 KB Output is correct
11 Correct 4279 ms 165296 KB Output is correct
12 Correct 3076 ms 110760 KB Output is correct
13 Correct 1871 ms 125580 KB Output is correct
14 Correct 1793 ms 125540 KB Output is correct
15 Correct 1804 ms 125796 KB Output is correct
16 Correct 1916 ms 126112 KB Output is correct
17 Correct 1915 ms 124140 KB Output is correct
18 Correct 1466 ms 92240 KB Output is correct
19 Correct 1813 ms 125744 KB Output is correct
20 Correct 1787 ms 125540 KB Output is correct
21 Correct 1797 ms 125640 KB Output is correct
22 Correct 2007 ms 125992 KB Output is correct
23 Correct 1858 ms 124008 KB Output is correct
24 Correct 1360 ms 92264 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 23 ms 19192 KB Output is correct
4 Correct 14 ms 19200 KB Output is correct
5 Correct 14 ms 19200 KB Output is correct
6 Correct 14 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 16 ms 19192 KB Output is correct
9 Correct 24 ms 19200 KB Output is correct
10 Correct 15 ms 19200 KB Output is correct
11 Correct 14 ms 19200 KB Output is correct
12 Correct 15 ms 19200 KB Output is correct
13 Correct 15 ms 19200 KB Output is correct
14 Correct 15 ms 19200 KB Output is correct
15 Correct 17 ms 19200 KB Output is correct
16 Correct 15 ms 19200 KB Output is correct
17 Correct 15 ms 19200 KB Output is correct
18 Correct 15 ms 19200 KB Output is correct
19 Correct 28 ms 19968 KB Output is correct
20 Correct 29 ms 19968 KB Output is correct
21 Correct 33 ms 20216 KB Output is correct
22 Correct 27 ms 19960 KB Output is correct
23 Correct 50 ms 23672 KB Output is correct
24 Correct 62 ms 24388 KB Output is correct
25 Correct 81 ms 25128 KB Output is correct
26 Correct 53 ms 23900 KB Output is correct
27 Correct 15 ms 19200 KB Output is correct
28 Correct 16 ms 19200 KB Output is correct
29 Correct 21 ms 19200 KB Output is correct
30 Correct 24 ms 19200 KB Output is correct
31 Correct 77 ms 19576 KB Output is correct
32 Correct 14 ms 19200 KB Output is correct
33 Correct 16 ms 19328 KB Output is correct
34 Correct 16 ms 19328 KB Output is correct
35 Correct 18 ms 19328 KB Output is correct
36 Correct 28 ms 19328 KB Output is correct
37 Correct 84 ms 19612 KB Output is correct
38 Correct 18 ms 20352 KB Output is correct
39 Correct 20 ms 20352 KB Output is correct
40 Correct 22 ms 20480 KB Output is correct
41 Correct 34 ms 20480 KB Output is correct
42 Correct 108 ms 20984 KB Output is correct
43 Correct 91 ms 44004 KB Output is correct
44 Correct 97 ms 44004 KB Output is correct
45 Correct 93 ms 44004 KB Output is correct
46 Correct 122 ms 44128 KB Output is correct
47 Correct 255 ms 44640 KB Output is correct
48 Correct 20 ms 20224 KB Output is correct
49 Correct 39 ms 20224 KB Output is correct
50 Correct 129 ms 20600 KB Output is correct
51 Correct 230 ms 20856 KB Output is correct
52 Correct 66 ms 34168 KB Output is correct
53 Correct 111 ms 34196 KB Output is correct
54 Correct 332 ms 34292 KB Output is correct
55 Correct 546 ms 34688 KB Output is correct
56 Correct 311 ms 105068 KB Output is correct
57 Correct 410 ms 105040 KB Output is correct
58 Correct 780 ms 105320 KB Output is correct
59 Correct 1151 ms 105568 KB Output is correct
60 Correct 640 ms 200200 KB Output is correct
61 Correct 751 ms 200164 KB Output is correct
62 Correct 1177 ms 200372 KB Output is correct
63 Correct 1721 ms 200592 KB Output is correct
64 Correct 2506 ms 201040 KB Output is correct
65 Correct 2993 ms 147340 KB Output is correct
66 Correct 3161 ms 151196 KB Output is correct
67 Correct 3008 ms 150028 KB Output is correct
68 Correct 3091 ms 151716 KB Output is correct
69 Correct 3052 ms 144232 KB Output is correct
70 Correct 2372 ms 100752 KB Output is correct
71 Correct 4413 ms 169768 KB Output is correct
72 Correct 4318 ms 173668 KB Output is correct
73 Correct 4510 ms 173428 KB Output is correct
74 Correct 4424 ms 173496 KB Output is correct
75 Correct 4279 ms 165296 KB Output is correct
76 Correct 3076 ms 110760 KB Output is correct
77 Correct 1871 ms 125580 KB Output is correct
78 Correct 1793 ms 125540 KB Output is correct
79 Correct 1804 ms 125796 KB Output is correct
80 Correct 1916 ms 126112 KB Output is correct
81 Correct 1915 ms 124140 KB Output is correct
82 Correct 1466 ms 92240 KB Output is correct
83 Correct 1813 ms 125744 KB Output is correct
84 Correct 1787 ms 125540 KB Output is correct
85 Correct 1797 ms 125640 KB Output is correct
86 Correct 2007 ms 125992 KB Output is correct
87 Correct 1858 ms 124008 KB Output is correct
88 Correct 1360 ms 92264 KB Output is correct
89 Correct 3103 ms 152380 KB Output is correct
90 Correct 3651 ms 165040 KB Output is correct
91 Correct 4168 ms 174680 KB Output is correct
92 Correct 4301 ms 173096 KB Output is correct
93 Correct 4096 ms 164968 KB Output is correct
94 Correct 3386 ms 153036 KB Output is correct
95 Correct 1819 ms 125188 KB Output is correct
96 Correct 1777 ms 125024 KB Output is correct
97 Correct 1764 ms 124872 KB Output is correct
98 Correct 1966 ms 124900 KB Output is correct
99 Correct 1830 ms 124948 KB Output is correct
100 Correct 1753 ms 124900 KB Output is correct