oj.uz

답안 #252006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252006 2020-07-23T15:07:24 Z errorgorn Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 219124 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));
	}
};

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];

ll ans[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);
}

ll get(int i){
	auto temp=root[i]->query(root[i]->s,root[i]->e);
	return 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]);
		}
	}
	
	multiset<ll> s;
	
	rep(x,1,n+1){
		if (degen[x]) continue;
		
		ans[x]=get(x);
		//cout<<x<<" "<<ans[x]<<endl;
		s.insert(ans[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]){
			s.erase(s.find(ans[it.fi]));
			
			root[it.fi]->update(range[it.fi][it.se].fi,range[it.fi][it.se].se,e-cw[d]);
			
			ans[it.fi]=get(it.fi);
			s.insert(ans[it.fi]);
		}
		cw[d]=e;
		
		last=*s.rbegin();
		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;
               ~^~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 8 ms 9728 KB Output is correct
5 Correct 6 ms 9728 KB Output is correct
6 Correct 8 ms 9728 KB Output is correct
7 Correct 6 ms 9728 KB Output is correct
8 Correct 6 ms 9728 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9728 KB Output is correct
13 Correct 6 ms 9856 KB Output is correct
14 Correct 6 ms 9856 KB Output is correct
15 Correct 6 ms 9856 KB Output is correct
16 Correct 6 ms 9856 KB Output is correct
17 Correct 6 ms 9856 KB Output is correct
18 Correct 6 ms 9856 KB Output is correct
19 Correct 23 ms 10624 KB Output is correct
20 Correct 35 ms 10752 KB Output is correct
21 Correct 32 ms 10880 KB Output is correct
22 Correct 24 ms 10752 KB Output is correct
23 Correct 44 ms 14464 KB Output is correct
24 Correct 70 ms 16120 KB Output is correct
25 Correct 87 ms 17272 KB Output is correct
26 Correct 53 ms 15608 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 15 ms 9856 KB Output is correct
5 Correct 53 ms 10232 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 6 ms 9856 KB Output is correct
8 Correct 7 ms 9856 KB Output is correct
9 Correct 8 ms 9856 KB Output is correct
10 Correct 20 ms 9984 KB Output is correct
11 Correct 76 ms 10360 KB Output is correct
12 Correct 10 ms 11004 KB Output is correct
13 Correct 9 ms 11004 KB Output is correct
14 Correct 11 ms 11004 KB Output is correct
15 Correct 27 ms 11132 KB Output is correct
16 Correct 94 ms 11632 KB Output is correct
17 Correct 76 ms 34664 KB Output is correct
18 Correct 75 ms 34668 KB Output is correct
19 Correct 80 ms 34664 KB Output is correct
20 Correct 105 ms 34784 KB Output is correct
21 Correct 229 ms 35168 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 10880 KB Output is correct
2 Correct 36 ms 10880 KB Output is correct
3 Correct 133 ms 11128 KB Output is correct
4 Correct 264 ms 11384 KB Output is correct
5 Correct 57 ms 24824 KB Output is correct
6 Correct 109 ms 24924 KB Output is correct
7 Correct 335 ms 25332 KB Output is correct
8 Correct 626 ms 25588 KB Output is correct
9 Correct 299 ms 96872 KB Output is correct
10 Correct 387 ms 97008 KB Output is correct
11 Correct 779 ms 97256 KB Output is correct
12 Correct 1275 ms 97628 KB Output is correct
13 Correct 632 ms 193380 KB Output is correct
14 Correct 754 ms 193380 KB Output is correct
15 Correct 1261 ms 193900 KB Output is correct
16 Correct 1974 ms 194260 KB Output is correct
17 Correct 3428 ms 194180 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4292 ms 161892 KB Output is correct
2 Correct 4315 ms 162372 KB Output is correct
3 Correct 4141 ms 163384 KB Output is correct
4 Correct 4706 ms 167204 KB Output is correct
5 Correct 4134 ms 159748 KB Output is correct
6 Correct 2891 ms 103304 KB Output is correct
7 Execution timed out 5058 ms 219124 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 8 ms 9728 KB Output is correct
5 Correct 6 ms 9728 KB Output is correct
6 Correct 8 ms 9728 KB Output is correct
7 Correct 6 ms 9728 KB Output is correct
8 Correct 6 ms 9728 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9728 KB Output is correct
12 Correct 6 ms 9728 KB Output is correct
13 Correct 6 ms 9856 KB Output is correct
14 Correct 6 ms 9856 KB Output is correct
15 Correct 6 ms 9856 KB Output is correct
16 Correct 6 ms 9856 KB Output is correct
17 Correct 6 ms 9856 KB Output is correct
18 Correct 6 ms 9856 KB Output is correct
19 Correct 23 ms 10624 KB Output is correct
20 Correct 35 ms 10752 KB Output is correct
21 Correct 32 ms 10880 KB Output is correct
22 Correct 24 ms 10752 KB Output is correct
23 Correct 44 ms 14464 KB Output is correct
24 Correct 70 ms 16120 KB Output is correct
25 Correct 87 ms 17272 KB Output is correct
26 Correct 53 ms 15608 KB Output is correct
27 Correct 6 ms 9728 KB Output is correct
28 Correct 6 ms 9728 KB Output is correct
29 Correct 7 ms 9728 KB Output is correct
30 Correct 15 ms 9856 KB Output is correct
31 Correct 53 ms 10232 KB Output is correct
32 Correct 6 ms 9728 KB Output is correct
33 Correct 6 ms 9856 KB Output is correct
34 Correct 7 ms 9856 KB Output is correct
35 Correct 8 ms 9856 KB Output is correct
36 Correct 20 ms 9984 KB Output is correct
37 Correct 76 ms 10360 KB Output is correct
38 Correct 10 ms 11004 KB Output is correct
39 Correct 9 ms 11004 KB Output is correct
40 Correct 11 ms 11004 KB Output is correct
41 Correct 27 ms 11132 KB Output is correct
42 Correct 94 ms 11632 KB Output is correct
43 Correct 76 ms 34664 KB Output is correct
44 Correct 75 ms 34668 KB Output is correct
45 Correct 80 ms 34664 KB Output is correct
46 Correct 105 ms 34784 KB Output is correct
47 Correct 229 ms 35168 KB Output is correct
48 Correct 13 ms 10880 KB Output is correct
49 Correct 36 ms 10880 KB Output is correct
50 Correct 133 ms 11128 KB Output is correct
51 Correct 264 ms 11384 KB Output is correct
52 Correct 57 ms 24824 KB Output is correct
53 Correct 109 ms 24924 KB Output is correct
54 Correct 335 ms 25332 KB Output is correct
55 Correct 626 ms 25588 KB Output is correct
56 Correct 299 ms 96872 KB Output is correct
57 Correct 387 ms 97008 KB Output is correct
58 Correct 779 ms 97256 KB Output is correct
59 Correct 1275 ms 97628 KB Output is correct
60 Correct 632 ms 193380 KB Output is correct
61 Correct 754 ms 193380 KB Output is correct
62 Correct 1261 ms 193900 KB Output is correct
63 Correct 1974 ms 194260 KB Output is correct
64 Correct 3428 ms 194180 KB Output is correct
65 Correct 4292 ms 161892 KB Output is correct
66 Correct 4315 ms 162372 KB Output is correct
67 Correct 4141 ms 163384 KB Output is correct
68 Correct 4706 ms 167204 KB Output is correct
69 Correct 4134 ms 159748 KB Output is correct
70 Correct 2891 ms 103304 KB Output is correct
71 Execution timed out 5058 ms 219124 KB Time limit exceeded
72 Halted 0 ms 0 KB -