oj.uz

답안 #252050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252050 2020-07-24T02:11:33 Z errorgorn Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 221924 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{
	ll val[400005];
	
	mxnode(){
		memset(val,0,sizeof(val));
	}
	
	void update(int i,ll j,int u=1,int s=0,int e=100005){
		if (s==e) val[u]=j;
		else{
			int m=s+e>>1;
			if (i<=m) update(i,j,u<<1,s,m);
			else update(i,j,u<<1|1,m+1,e);
			
			val[u]=max(val[u<<1],val[u<<1|1]);
		}
	}
} *mxroot=new mxnode();

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[1];
		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 member function 'void mxnode::update(int, long long int, int, int, int)':
diameter.cpp:99:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int m=s+e>>1;
          ~^~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 9 ms 12928 KB Output is correct
3 Correct 10 ms 12928 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 8 ms 12928 KB Output is correct
7 Correct 10 ms 12928 KB Output is correct
8 Correct 10 ms 12928 KB Output is correct
9 Correct 9 ms 12928 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 9 ms 12928 KB Output is correct
12 Correct 9 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 12 ms 12928 KB Output is correct
15 Correct 9 ms 12928 KB Output is correct
16 Correct 10 ms 12928 KB Output is correct
17 Correct 9 ms 12928 KB Output is correct
18 Correct 10 ms 12928 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 9 ms 12928 KB Output is correct
3 Correct 10 ms 12928 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 8 ms 12928 KB Output is correct
7 Correct 10 ms 12928 KB Output is correct
8 Correct 10 ms 12928 KB Output is correct
9 Correct 9 ms 12928 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 9 ms 12928 KB Output is correct
12 Correct 9 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 12 ms 12928 KB Output is correct
15 Correct 9 ms 12928 KB Output is correct
16 Correct 10 ms 12928 KB Output is correct
17 Correct 9 ms 12928 KB Output is correct
18 Correct 10 ms 12928 KB Output is correct
19 Correct 20 ms 13824 KB Output is correct
20 Correct 26 ms 13952 KB Output is correct
21 Correct 29 ms 14080 KB Output is correct
22 Correct 20 ms 13952 KB Output is correct
23 Correct 40 ms 17536 KB Output is correct
24 Correct 67 ms 19192 KB Output is correct
25 Correct 86 ms 20096 KB Output is correct
26 Correct 47 ms 18552 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 12928 KB Output is correct
2 Correct 8 ms 12928 KB Output is correct
3 Correct 11 ms 12928 KB Output is correct
4 Correct 17 ms 13184 KB Output is correct
5 Correct 57 ms 14072 KB Output is correct
6 Correct 10 ms 12928 KB Output is correct
7 Correct 8 ms 13056 KB Output is correct
8 Correct 10 ms 13056 KB Output is correct
9 Correct 10 ms 13056 KB Output is correct
10 Correct 22 ms 13312 KB Output is correct
11 Correct 77 ms 14320 KB Output is correct
12 Correct 12 ms 14204 KB Output is correct
13 Correct 12 ms 14204 KB Output is correct
14 Correct 13 ms 14204 KB Output is correct
15 Correct 28 ms 14460 KB Output is correct
16 Correct 100 ms 15732 KB Output is correct
17 Correct 81 ms 39016 KB Output is correct
18 Correct 83 ms 39016 KB Output is correct
19 Correct 85 ms 39016 KB Output is correct
20 Correct 108 ms 39268 KB Output is correct
21 Correct 241 ms 40628 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 13952 KB Output is correct
2 Correct 31 ms 14080 KB Output is correct
3 Correct 109 ms 14712 KB Output is correct
4 Correct 203 ms 15352 KB Output is correct
5 Correct 57 ms 27900 KB Output is correct
6 Correct 96 ms 28084 KB Output is correct
7 Correct 269 ms 28660 KB Output is correct
8 Correct 490 ms 29428 KB Output is correct
9 Correct 395 ms 99440 KB Output is correct
10 Correct 459 ms 99692 KB Output is correct
11 Correct 705 ms 100332 KB Output is correct
12 Correct 1148 ms 101232 KB Output is correct
13 Correct 631 ms 195432 KB Output is correct
14 Correct 714 ms 195432 KB Output is correct
15 Correct 1129 ms 196116 KB Output is correct
16 Correct 1759 ms 196968 KB Output is correct
17 Correct 2254 ms 196832 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3394 ms 165736 KB Output is correct
2 Correct 3309 ms 166372 KB Output is correct
3 Correct 3815 ms 167448 KB Output is correct
4 Correct 3524 ms 171560 KB Output is correct
5 Correct 3575 ms 162844 KB Output is correct
6 Correct 2502 ms 107112 KB Output is correct
7 Execution timed out 5078 ms 221924 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 9 ms 12928 KB Output is correct
3 Correct 10 ms 12928 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 8 ms 12928 KB Output is correct
7 Correct 10 ms 12928 KB Output is correct
8 Correct 10 ms 12928 KB Output is correct
9 Correct 9 ms 12928 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 9 ms 12928 KB Output is correct
12 Correct 9 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 12 ms 12928 KB Output is correct
15 Correct 9 ms 12928 KB Output is correct
16 Correct 10 ms 12928 KB Output is correct
17 Correct 9 ms 12928 KB Output is correct
18 Correct 10 ms 12928 KB Output is correct
19 Correct 20 ms 13824 KB Output is correct
20 Correct 26 ms 13952 KB Output is correct
21 Correct 29 ms 14080 KB Output is correct
22 Correct 20 ms 13952 KB Output is correct
23 Correct 40 ms 17536 KB Output is correct
24 Correct 67 ms 19192 KB Output is correct
25 Correct 86 ms 20096 KB Output is correct
26 Correct 47 ms 18552 KB Output is correct
27 Correct 10 ms 12928 KB Output is correct
28 Correct 8 ms 12928 KB Output is correct
29 Correct 11 ms 12928 KB Output is correct
30 Correct 17 ms 13184 KB Output is correct
31 Correct 57 ms 14072 KB Output is correct
32 Correct 10 ms 12928 KB Output is correct
33 Correct 8 ms 13056 KB Output is correct
34 Correct 10 ms 13056 KB Output is correct
35 Correct 10 ms 13056 KB Output is correct
36 Correct 22 ms 13312 KB Output is correct
37 Correct 77 ms 14320 KB Output is correct
38 Correct 12 ms 14204 KB Output is correct
39 Correct 12 ms 14204 KB Output is correct
40 Correct 13 ms 14204 KB Output is correct
41 Correct 28 ms 14460 KB Output is correct
42 Correct 100 ms 15732 KB Output is correct
43 Correct 81 ms 39016 KB Output is correct
44 Correct 83 ms 39016 KB Output is correct
45 Correct 85 ms 39016 KB Output is correct
46 Correct 108 ms 39268 KB Output is correct
47 Correct 241 ms 40628 KB Output is correct
48 Correct 13 ms 13952 KB Output is correct
49 Correct 31 ms 14080 KB Output is correct
50 Correct 109 ms 14712 KB Output is correct
51 Correct 203 ms 15352 KB Output is correct
52 Correct 57 ms 27900 KB Output is correct
53 Correct 96 ms 28084 KB Output is correct
54 Correct 269 ms 28660 KB Output is correct
55 Correct 490 ms 29428 KB Output is correct
56 Correct 395 ms 99440 KB Output is correct
57 Correct 459 ms 99692 KB Output is correct
58 Correct 705 ms 100332 KB Output is correct
59 Correct 1148 ms 101232 KB Output is correct
60 Correct 631 ms 195432 KB Output is correct
61 Correct 714 ms 195432 KB Output is correct
62 Correct 1129 ms 196116 KB Output is correct
63 Correct 1759 ms 196968 KB Output is correct
64 Correct 2254 ms 196832 KB Output is correct
65 Correct 3394 ms 165736 KB Output is correct
66 Correct 3309 ms 166372 KB Output is correct
67 Correct 3815 ms 167448 KB Output is correct
68 Correct 3524 ms 171560 KB Output is correct
69 Correct 3575 ms 162844 KB Output is correct
70 Correct 2502 ms 107112 KB Output is correct
71 Execution timed out 5078 ms 221924 KB Time limit exceeded
72 Halted 0 ms 0 KB -