oj.uz

답안 #252002

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

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];
unordered_map<int,ii> range[100005];
unordered_map<int,ii> subtree[100005];
vector<int> pos[100005];
node* root[100005];

ll ans[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][x]=temp;
		}
		
		range[root][it.se]=temp;
		pos[it.se].push_back(root);
		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;
		}
	}
	
	TIME=1;
	root[i]=new node(0,dfs(i,-1,i).se+1);
	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);
	if (!subtree[i].count(temp.se)) return 0;
	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]->update(range[it][x].fi,range[it][x].se,cw[x]);
		}
	}
	
	multiset<ll> s;
	
	rep(x,1,n+1){
		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]));
			
			root[it]->update(range[it][d].fi,range[it][d].se,e-cw[d]);
			
			ans[it]=get(it);
			s.insert(ans[it]);
		}
		cw[d]=e;
		
		last=*s.rbegin();
		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;
               ~^~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 16000 KB Output is correct
2 Correct 12 ms 16128 KB Output is correct
3 Correct 11 ms 16000 KB Output is correct
4 Correct 11 ms 16000 KB Output is correct
5 Correct 11 ms 16000 KB Output is correct
6 Correct 10 ms 16000 KB Output is correct
7 Correct 11 ms 16000 KB Output is correct
8 Correct 11 ms 16128 KB Output is correct
9 Correct 13 ms 16000 KB Output is correct
10 Correct 10 ms 16000 KB Output is correct
11 Correct 11 ms 16000 KB Output is correct
12 Correct 15 ms 16000 KB Output is correct
13 Correct 11 ms 16128 KB Output is correct
14 Correct 11 ms 16128 KB Output is correct
15 Correct 11 ms 16128 KB Output is correct
16 Correct 11 ms 16128 KB Output is correct
17 Correct 11 ms 16128 KB Output is correct
18 Correct 16 ms 16128 KB Output is correct
19 Correct 31 ms 17280 KB Output is correct
20 Correct 34 ms 17408 KB Output is correct
21 Correct 51 ms 17664 KB Output is correct
22 Correct 37 ms 17416 KB Output is correct
23 Correct 61 ms 23032 KB Output is correct
24 Correct 97 ms 25080 KB Output is correct
25 Correct 120 ms 26360 KB Output is correct
26 Correct 79 ms 23672 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 16000 KB Output is correct
2 Correct 10 ms 16000 KB Output is correct
3 Correct 11 ms 16000 KB Output is correct
4 Correct 21 ms 16152 KB Output is correct
5 Correct 63 ms 16492 KB Output is correct
6 Correct 11 ms 16000 KB Output is correct
7 Correct 11 ms 16384 KB Output is correct
8 Correct 11 ms 16384 KB Output is correct
9 Correct 13 ms 16384 KB Output is correct
10 Correct 26 ms 16512 KB Output is correct
11 Correct 86 ms 16888 KB Output is correct
12 Correct 17 ms 19584 KB Output is correct
13 Correct 17 ms 19596 KB Output is correct
14 Correct 20 ms 19584 KB Output is correct
15 Correct 38 ms 19704 KB Output is correct
16 Correct 113 ms 20088 KB Output is correct
17 Correct 150 ms 86244 KB Output is correct
18 Correct 153 ms 86248 KB Output is correct
19 Correct 152 ms 86248 KB Output is correct
20 Correct 180 ms 86372 KB Output is correct
21 Correct 319 ms 87048 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 17664 KB Output is correct
2 Correct 45 ms 17664 KB Output is correct
3 Correct 156 ms 17916 KB Output is correct
4 Correct 286 ms 18224 KB Output is correct
5 Correct 91 ms 37240 KB Output is correct
6 Correct 148 ms 37368 KB Output is correct
7 Correct 426 ms 37620 KB Output is correct
8 Correct 801 ms 37912 KB Output is correct
9 Correct 482 ms 140072 KB Output is correct
10 Correct 589 ms 140200 KB Output is correct
11 Correct 1074 ms 140456 KB Output is correct
12 Correct 1692 ms 140756 KB Output is correct
13 Correct 994 ms 279420 KB Output is correct
14 Correct 1137 ms 279656 KB Output is correct
15 Correct 1803 ms 279816 KB Output is correct
16 Correct 2609 ms 280068 KB Output is correct
17 Correct 3774 ms 280328 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4986 ms 236216 KB Output is correct
2 Correct 4918 ms 236960 KB Output is correct
3 Execution timed out 5087 ms 240132 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 16000 KB Output is correct
2 Correct 12 ms 16128 KB Output is correct
3 Correct 11 ms 16000 KB Output is correct
4 Correct 11 ms 16000 KB Output is correct
5 Correct 11 ms 16000 KB Output is correct
6 Correct 10 ms 16000 KB Output is correct
7 Correct 11 ms 16000 KB Output is correct
8 Correct 11 ms 16128 KB Output is correct
9 Correct 13 ms 16000 KB Output is correct
10 Correct 10 ms 16000 KB Output is correct
11 Correct 11 ms 16000 KB Output is correct
12 Correct 15 ms 16000 KB Output is correct
13 Correct 11 ms 16128 KB Output is correct
14 Correct 11 ms 16128 KB Output is correct
15 Correct 11 ms 16128 KB Output is correct
16 Correct 11 ms 16128 KB Output is correct
17 Correct 11 ms 16128 KB Output is correct
18 Correct 16 ms 16128 KB Output is correct
19 Correct 31 ms 17280 KB Output is correct
20 Correct 34 ms 17408 KB Output is correct
21 Correct 51 ms 17664 KB Output is correct
22 Correct 37 ms 17416 KB Output is correct
23 Correct 61 ms 23032 KB Output is correct
24 Correct 97 ms 25080 KB Output is correct
25 Correct 120 ms 26360 KB Output is correct
26 Correct 79 ms 23672 KB Output is correct
27 Correct 10 ms 16000 KB Output is correct
28 Correct 10 ms 16000 KB Output is correct
29 Correct 11 ms 16000 KB Output is correct
30 Correct 21 ms 16152 KB Output is correct
31 Correct 63 ms 16492 KB Output is correct
32 Correct 11 ms 16000 KB Output is correct
33 Correct 11 ms 16384 KB Output is correct
34 Correct 11 ms 16384 KB Output is correct
35 Correct 13 ms 16384 KB Output is correct
36 Correct 26 ms 16512 KB Output is correct
37 Correct 86 ms 16888 KB Output is correct
38 Correct 17 ms 19584 KB Output is correct
39 Correct 17 ms 19596 KB Output is correct
40 Correct 20 ms 19584 KB Output is correct
41 Correct 38 ms 19704 KB Output is correct
42 Correct 113 ms 20088 KB Output is correct
43 Correct 150 ms 86244 KB Output is correct
44 Correct 153 ms 86248 KB Output is correct
45 Correct 152 ms 86248 KB Output is correct
46 Correct 180 ms 86372 KB Output is correct
47 Correct 319 ms 87048 KB Output is correct
48 Correct 17 ms 17664 KB Output is correct
49 Correct 45 ms 17664 KB Output is correct
50 Correct 156 ms 17916 KB Output is correct
51 Correct 286 ms 18224 KB Output is correct
52 Correct 91 ms 37240 KB Output is correct
53 Correct 148 ms 37368 KB Output is correct
54 Correct 426 ms 37620 KB Output is correct
55 Correct 801 ms 37912 KB Output is correct
56 Correct 482 ms 140072 KB Output is correct
57 Correct 589 ms 140200 KB Output is correct
58 Correct 1074 ms 140456 KB Output is correct
59 Correct 1692 ms 140756 KB Output is correct
60 Correct 994 ms 279420 KB Output is correct
61 Correct 1137 ms 279656 KB Output is correct
62 Correct 1803 ms 279816 KB Output is correct
63 Correct 2609 ms 280068 KB Output is correct
64 Correct 3774 ms 280328 KB Output is correct
65 Correct 4986 ms 236216 KB Output is correct
66 Correct 4918 ms 236960 KB Output is correct
67 Execution timed out 5087 ms 240132 KB Time limit exceeded
68 Halted 0 ms 0 KB -