oj.uz

Submission #259333

# Submission time Handle Problem Language Result Execution time Memory
259333 2020-08-07T15:00:29 Z errorgorn Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 201620 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){
	//cout<<i<<" "<<sz<<endl;
 
	dfs_c(i,-1);
	int sz=ss[i];
	
	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;
	
	for (auto &it:al[i]){
		if (it.fi==p || used[it.fi]) continue;
		
		centroid(it.fi);
	}
	
	if (p!=-1) centroid(p);
}
 
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);
	
	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 17 ms 19200 KB Output is correct
3 Correct 15 ms 19200 KB Output is correct
4 Correct 15 ms 19200 KB Output is correct
5 Correct 15 ms 19200 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 17 ms 19200 KB Output is correct
8 Correct 16 ms 19200 KB Output is correct
9 Correct 15 ms 19200 KB Output is correct
10 Correct 17 ms 19188 KB Output is correct
11 Correct 15 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 15 ms 19200 KB Output is correct
16 Correct 15 ms 19200 KB Output is correct
17 Correct 16 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 17 ms 19200 KB Output is correct
3 Correct 15 ms 19200 KB Output is correct
4 Correct 15 ms 19200 KB Output is correct
5 Correct 15 ms 19200 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 17 ms 19200 KB Output is correct
8 Correct 16 ms 19200 KB Output is correct
9 Correct 15 ms 19200 KB Output is correct
10 Correct 17 ms 19188 KB Output is correct
11 Correct 15 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 15 ms 19200 KB Output is correct
16 Correct 15 ms 19200 KB Output is correct
17 Correct 16 ms 19200 KB Output is correct
18 Correct 15 ms 19200 KB Output is correct
19 Correct 29 ms 20224 KB Output is correct
20 Correct 29 ms 20088 KB Output is correct
21 Correct 34 ms 20096 KB Output is correct
22 Correct 25 ms 19960 KB Output is correct
23 Correct 49 ms 23808 KB Output is correct
24 Correct 63 ms 24440 KB Output is correct
25 Correct 70 ms 25208 KB Output is correct
26 Correct 44 ms 23928 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 15 ms 19192 KB Output is correct
3 Correct 16 ms 19200 KB Output is correct
4 Correct 24 ms 19320 KB Output is correct
5 Correct 70 ms 20300 KB Output is correct
6 Correct 16 ms 19200 KB Output is correct
7 Correct 15 ms 19320 KB Output is correct
8 Correct 17 ms 19328 KB Output is correct
9 Correct 17 ms 19328 KB Output is correct
10 Correct 29 ms 19576 KB Output is correct
11 Correct 81 ms 20472 KB Output is correct
12 Correct 18 ms 20480 KB Output is correct
13 Correct 18 ms 20480 KB Output is correct
14 Correct 20 ms 20480 KB Output is correct
15 Correct 36 ms 20856 KB Output is correct
16 Correct 100 ms 21624 KB Output is correct
17 Correct 91 ms 44696 KB Output is correct
18 Correct 88 ms 44644 KB Output is correct
19 Correct 92 ms 44644 KB Output is correct
20 Correct 116 ms 44768 KB Output is correct
21 Correct 265 ms 45408 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 38 ms 20352 KB Output is correct
3 Correct 120 ms 20896 KB Output is correct
4 Correct 217 ms 21756 KB Output is correct
5 Correct 65 ms 34168 KB Output is correct
6 Correct 108 ms 34308 KB Output is correct
7 Correct 293 ms 34936 KB Output is correct
8 Correct 509 ms 35704 KB Output is correct
9 Correct 371 ms 105824 KB Output is correct
10 Correct 408 ms 106012 KB Output is correct
11 Correct 753 ms 106156 KB Output is correct
12 Correct 1370 ms 106344 KB Output is correct
13 Correct 646 ms 200804 KB Output is correct
14 Correct 753 ms 200956 KB Output is correct
15 Correct 1196 ms 201188 KB Output is correct
16 Correct 1922 ms 201576 KB Output is correct
17 Correct 2710 ms 201620 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3098 ms 147916 KB Output is correct
2 Correct 3704 ms 151296 KB Output is correct
3 Correct 3602 ms 150120 KB Output is correct
4 Correct 3539 ms 151988 KB Output is correct
5 Correct 3587 ms 144672 KB Output is correct
6 Correct 2767 ms 100808 KB Output is correct
7 Execution timed out 5070 ms 169428 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 17 ms 19200 KB Output is correct
3 Correct 15 ms 19200 KB Output is correct
4 Correct 15 ms 19200 KB Output is correct
5 Correct 15 ms 19200 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 17 ms 19200 KB Output is correct
8 Correct 16 ms 19200 KB Output is correct
9 Correct 15 ms 19200 KB Output is correct
10 Correct 17 ms 19188 KB Output is correct
11 Correct 15 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 15 ms 19200 KB Output is correct
16 Correct 15 ms 19200 KB Output is correct
17 Correct 16 ms 19200 KB Output is correct
18 Correct 15 ms 19200 KB Output is correct
19 Correct 29 ms 20224 KB Output is correct
20 Correct 29 ms 20088 KB Output is correct
21 Correct 34 ms 20096 KB Output is correct
22 Correct 25 ms 19960 KB Output is correct
23 Correct 49 ms 23808 KB Output is correct
24 Correct 63 ms 24440 KB Output is correct
25 Correct 70 ms 25208 KB Output is correct
26 Correct 44 ms 23928 KB Output is correct
27 Correct 15 ms 19200 KB Output is correct
28 Correct 15 ms 19192 KB Output is correct
29 Correct 16 ms 19200 KB Output is correct
30 Correct 24 ms 19320 KB Output is correct
31 Correct 70 ms 20300 KB Output is correct
32 Correct 16 ms 19200 KB Output is correct
33 Correct 15 ms 19320 KB Output is correct
34 Correct 17 ms 19328 KB Output is correct
35 Correct 17 ms 19328 KB Output is correct
36 Correct 29 ms 19576 KB Output is correct
37 Correct 81 ms 20472 KB Output is correct
38 Correct 18 ms 20480 KB Output is correct
39 Correct 18 ms 20480 KB Output is correct
40 Correct 20 ms 20480 KB Output is correct
41 Correct 36 ms 20856 KB Output is correct
42 Correct 100 ms 21624 KB Output is correct
43 Correct 91 ms 44696 KB Output is correct
44 Correct 88 ms 44644 KB Output is correct
45 Correct 92 ms 44644 KB Output is correct
46 Correct 116 ms 44768 KB Output is correct
47 Correct 265 ms 45408 KB Output is correct
48 Correct 20 ms 20224 KB Output is correct
49 Correct 38 ms 20352 KB Output is correct
50 Correct 120 ms 20896 KB Output is correct
51 Correct 217 ms 21756 KB Output is correct
52 Correct 65 ms 34168 KB Output is correct
53 Correct 108 ms 34308 KB Output is correct
54 Correct 293 ms 34936 KB Output is correct
55 Correct 509 ms 35704 KB Output is correct
56 Correct 371 ms 105824 KB Output is correct
57 Correct 408 ms 106012 KB Output is correct
58 Correct 753 ms 106156 KB Output is correct
59 Correct 1370 ms 106344 KB Output is correct
60 Correct 646 ms 200804 KB Output is correct
61 Correct 753 ms 200956 KB Output is correct
62 Correct 1196 ms 201188 KB Output is correct
63 Correct 1922 ms 201576 KB Output is correct
64 Correct 2710 ms 201620 KB Output is correct
65 Correct 3098 ms 147916 KB Output is correct
66 Correct 3704 ms 151296 KB Output is correct
67 Correct 3602 ms 150120 KB Output is correct
68 Correct 3539 ms 151988 KB Output is correct
69 Correct 3587 ms 144672 KB Output is correct
70 Correct 2767 ms 100808 KB Output is correct
71 Execution timed out 5070 ms 169428 KB Time limit exceeded
72 Halted 0 ms 0 KB -