oj.uz

Submission #252010

# Submission time Handle Problem Language Result Execution time Memory
252010 2020-07-23T15:18:21 Z errorgorn Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 224132 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#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;
		
		centroid(it.fi,ss[it.fi]);
		sz-=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:45: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:95: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 15 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 16 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19200 KB Output is correct
6 Correct 16 ms 19200 KB Output is correct
7 Correct 16 ms 19200 KB Output is correct
8 Correct 16 ms 19200 KB Output is correct
9 Correct 16 ms 19200 KB Output is correct
10 Correct 16 ms 19200 KB Output is correct
11 Correct 16 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 17 ms 19200 KB Output is correct
16 Correct 16 ms 19200 KB Output is correct
17 Correct 18 ms 19200 KB Output is correct
18 Correct 16 ms 19200 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 16 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19200 KB Output is correct
6 Correct 16 ms 19200 KB Output is correct
7 Correct 16 ms 19200 KB Output is correct
8 Correct 16 ms 19200 KB Output is correct
9 Correct 16 ms 19200 KB Output is correct
10 Correct 16 ms 19200 KB Output is correct
11 Correct 16 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 17 ms 19200 KB Output is correct
16 Correct 16 ms 19200 KB Output is correct
17 Correct 18 ms 19200 KB Output is correct
18 Correct 16 ms 19200 KB Output is correct
19 Correct 29 ms 19968 KB Output is correct
20 Correct 34 ms 20096 KB Output is correct
21 Correct 37 ms 20224 KB Output is correct
22 Correct 29 ms 20096 KB Output is correct
23 Correct 53 ms 23808 KB Output is correct
24 Correct 76 ms 25336 KB Output is correct
25 Correct 89 ms 26232 KB Output is correct
26 Correct 52 ms 24692 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19140 KB Output is correct
2 Correct 17 ms 19200 KB Output is correct
3 Correct 17 ms 19200 KB Output is correct
4 Correct 28 ms 19320 KB Output is correct
5 Correct 66 ms 19572 KB Output is correct
6 Correct 16 ms 19200 KB Output is correct
7 Correct 17 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 31 ms 19448 KB Output is correct
11 Correct 86 ms 19704 KB Output is correct
12 Correct 20 ms 20472 KB Output is correct
13 Correct 19 ms 20352 KB Output is correct
14 Correct 21 ms 20480 KB Output is correct
15 Correct 49 ms 20480 KB Output is correct
16 Correct 108 ms 20988 KB Output is correct
17 Correct 90 ms 44008 KB Output is correct
18 Correct 94 ms 44004 KB Output is correct
19 Correct 103 ms 44004 KB Output is correct
20 Correct 129 ms 44128 KB Output is correct
21 Correct 253 ms 44768 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 20224 KB Output is correct
3 Correct 120 ms 20600 KB Output is correct
4 Correct 219 ms 20728 KB Output is correct
5 Correct 64 ms 34040 KB Output is correct
6 Correct 115 ms 34040 KB Output is correct
7 Correct 281 ms 34424 KB Output is correct
8 Correct 499 ms 34808 KB Output is correct
9 Correct 298 ms 105044 KB Output is correct
10 Correct 383 ms 105196 KB Output is correct
11 Correct 715 ms 105196 KB Output is correct
12 Correct 1137 ms 105548 KB Output is correct
13 Correct 624 ms 200036 KB Output is correct
14 Correct 714 ms 200040 KB Output is correct
15 Correct 1208 ms 200316 KB Output is correct
16 Correct 1687 ms 200644 KB Output is correct
17 Correct 2405 ms 200556 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3538 ms 168008 KB Output is correct
2 Correct 3624 ms 168596 KB Output is correct
3 Correct 3601 ms 169824 KB Output is correct
4 Correct 3771 ms 173780 KB Output is correct
5 Correct 3630 ms 164764 KB Output is correct
6 Correct 2777 ms 109244 KB Output is correct
7 Execution timed out 5083 ms 224132 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 16 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19200 KB Output is correct
6 Correct 16 ms 19200 KB Output is correct
7 Correct 16 ms 19200 KB Output is correct
8 Correct 16 ms 19200 KB Output is correct
9 Correct 16 ms 19200 KB Output is correct
10 Correct 16 ms 19200 KB Output is correct
11 Correct 16 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 17 ms 19200 KB Output is correct
16 Correct 16 ms 19200 KB Output is correct
17 Correct 18 ms 19200 KB Output is correct
18 Correct 16 ms 19200 KB Output is correct
19 Correct 29 ms 19968 KB Output is correct
20 Correct 34 ms 20096 KB Output is correct
21 Correct 37 ms 20224 KB Output is correct
22 Correct 29 ms 20096 KB Output is correct
23 Correct 53 ms 23808 KB Output is correct
24 Correct 76 ms 25336 KB Output is correct
25 Correct 89 ms 26232 KB Output is correct
26 Correct 52 ms 24692 KB Output is correct
27 Correct 16 ms 19140 KB Output is correct
28 Correct 17 ms 19200 KB Output is correct
29 Correct 17 ms 19200 KB Output is correct
30 Correct 28 ms 19320 KB Output is correct
31 Correct 66 ms 19572 KB Output is correct
32 Correct 16 ms 19200 KB Output is correct
33 Correct 17 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 31 ms 19448 KB Output is correct
37 Correct 86 ms 19704 KB Output is correct
38 Correct 20 ms 20472 KB Output is correct
39 Correct 19 ms 20352 KB Output is correct
40 Correct 21 ms 20480 KB Output is correct
41 Correct 49 ms 20480 KB Output is correct
42 Correct 108 ms 20988 KB Output is correct
43 Correct 90 ms 44008 KB Output is correct
44 Correct 94 ms 44004 KB Output is correct
45 Correct 103 ms 44004 KB Output is correct
46 Correct 129 ms 44128 KB Output is correct
47 Correct 253 ms 44768 KB Output is correct
48 Correct 20 ms 20224 KB Output is correct
49 Correct 38 ms 20224 KB Output is correct
50 Correct 120 ms 20600 KB Output is correct
51 Correct 219 ms 20728 KB Output is correct
52 Correct 64 ms 34040 KB Output is correct
53 Correct 115 ms 34040 KB Output is correct
54 Correct 281 ms 34424 KB Output is correct
55 Correct 499 ms 34808 KB Output is correct
56 Correct 298 ms 105044 KB Output is correct
57 Correct 383 ms 105196 KB Output is correct
58 Correct 715 ms 105196 KB Output is correct
59 Correct 1137 ms 105548 KB Output is correct
60 Correct 624 ms 200036 KB Output is correct
61 Correct 714 ms 200040 KB Output is correct
62 Correct 1208 ms 200316 KB Output is correct
63 Correct 1687 ms 200644 KB Output is correct
64 Correct 2405 ms 200556 KB Output is correct
65 Correct 3538 ms 168008 KB Output is correct
66 Correct 3624 ms 168596 KB Output is correct
67 Correct 3601 ms 169824 KB Output is correct
68 Correct 3771 ms 173780 KB Output is correct
69 Correct 3630 ms 164764 KB Output is correct
70 Correct 2777 ms 109244 KB Output is correct
71 Execution timed out 5083 ms 224132 KB Time limit exceeded
72 Halted 0 ms 0 KB -