oj.uz

Submission #619069

# Submission time Handle Problem Language Result Execution time Memory
619069 2022-08-02T09:40:15 Z HappyPacMan Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 5000 ms 426460 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
using ll = long long;
const int maxn = 1e5 + 3;
vector<pair<int,int> > adj[maxn],edges;
vector<int> partOf[maxn];
vector<ll> seg[maxn],lazy[maxn];
bool isCent[maxn];
int subSz[maxn],centRoot,timer[maxn];
map<int,int> tin[maxn],tout[maxn],edgeRoot[maxn];
set<pair<ll,int> > bestEdge[maxn],result; 
ll cost[maxn];
 
void dfsSz(int u,int p){
	subSz[u] = 1;
	for(auto [v,w] : adj[u]){
		if(v != p && !isCent[v]){
			dfsSz(v,u);
			subSz[u] += subSz[v];
		}
	}
}
int fnCent(int u,int p,int s){
	for(auto [v,w] : adj[u]){
		if(v != p && !isCent[v] && subSz[v] > s/2){
			return fnCent(v,u,s);
		}
	}
	return u;
}
void dfsTour(int c,int u,int p){
	for(auto [v,w] : adj[u]){
		if(v != p && !isCent[v]){
			partOf[w].emplace_back(c);
			tin[c][w] = timer[c]++;
			dfsTour(c,v,u);
			tout[c][w] = timer[c]++;
		}
	}
}
void dfsEdgeRoot(int c,int d,int u,int p){
	for(auto [v,w] : adj[u]){
		if(v != p && !isCent[v]){
			edgeRoot[c][w] = d;
			dfsEdgeRoot(c,d,v,u);
		}
	}
}
void dfsCent(int u,int p){
	dfsSz(u,p);
	int cent = fnCent(u,u,subSz[u]);
	isCent[cent] = true;
	if(p != -1){
		centRoot = cent;
	}
	dfsTour(cent,cent,cent);
	for(auto [v,w] : adj[cent]){
		if(!isCent[v]){
			bestEdge[cent].emplace(0,w);
			edgeRoot[cent][w] = w;
			dfsEdgeRoot(cent,w,v,cent);
		}
	}
	seg[cent].resize(4*timer[cent]);
	lazy[cent].resize(4*timer[cent]);
	for(auto [v,w] : adj[cent]){
		if(!isCent[v]){
			dfsCent(v,cent);
		}
	}
}
 
// Segment Tree + Lazy Propagation
void push(int c,int i){
	lazy[c][i<<1] += lazy[c][i];
	seg[c][i<<1] += lazy[c][i];
	lazy[c][i<<1|1] += lazy[c][i];
	seg[c][i<<1|1] += lazy[c][i];
	lazy[c][i] = 0;
}
void upd(int c,int i,int l,int r,int ul,int ur,ll v){
	if(ul <= l && r <= ur){
		seg[c][i] += v;
		lazy[c][i] += v;
	}else if(ul > r || ur < l){
		return;
	}else{
		int m = (l+r)/2;
		push(c,i);
		upd(c,i<<1,l,m,ul,ur,v);
		upd(c,i<<1|1,m+1,r,ul,ur,v);
		seg[c][i] = max(seg[c][i<<1],seg[c][i<<1|1]);
	}
}
ll qry(int c,int i,int l,int r,int ql,int qr){
	if(ql <= l && r <= qr){
		return seg[c][i];
	}else if(ql > r || qr < l){
		return 0;
	}else{
		int m = (l+r)/2;
		push(c,i);
		return max(qry(c,i<<1,l,m,ql,qr),qry(c,i<<1|1,m+1,r,ql,qr));
	}
}
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
 
	int n,q;
	ll w;
	cin >> n >> q >> w;
	for(int i=1;i<n;i++){
		int u,v;
		ll w;
		cin >> u >> v >> w;
		u--; v--;
		adj[u].emplace_back(v,i);
		adj[v].emplace_back(u,i);
		edges.emplace_back(u,v);
		cost[i] = w;
	}
	dfsCent(0,-1);
	for(int i=1;i<n;i++){
		for(int it : partOf[i]){
			bestEdge[it].erase(bestEdge[it].find(make_pair(qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]),edgeRoot[it][i])));
			upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,cost[i]);
			bestEdge[it].insert(make_pair(qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]),edgeRoot[it][i]));
		}
	}
	for(int i=0;i<n;i++){
		if(bestEdge[i].size() > 1){
			result.emplace((*prev(bestEdge[i].end())).first+(*prev(prev(bestEdge[i].end()))).first,i);
		}else if(bestEdge[i].size()){
			result.emplace((*prev(bestEdge[i].end())).first,i);
		}else{
			result.emplace(0,i);
		}
	}
	ll last = 0;
	while(q--){
		int i;
		ll j;
		cin >> i >> j;
		i = (i+last)%(n-1)+1;
		j = (j+last)%w;
		ll df = j-cost[i];
		for(int it : partOf[i]){
			if(bestEdge[it].size() > 1){
				result.erase(result.find(make_pair((*prev(bestEdge[it].end())).first+(*prev(prev(bestEdge[it].end()))).first,it)));
			}else if(bestEdge[it].size()){
				result.erase(result.find(make_pair((*prev(bestEdge[it].end())).first,it)));
			}else{
				result.erase(result.find(make_pair(0,it)));
			}
			bestEdge[it].erase(bestEdge[it].find(make_pair(qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]),edgeRoot[it][i])));
			upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,df);
			bestEdge[it].insert(make_pair(qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]),edgeRoot[it][i]));
			if(bestEdge[it].size() > 1){
				result.emplace((*prev(bestEdge[it].end())).first+(*prev(prev(bestEdge[it].end()))).first,it);
			}else if(bestEdge[it].size()){
				result.emplace((*prev(bestEdge[it].end())).first,it);
			}else{
				result.emplace(0,it);
			}
		}
		cost[i] = j;
		last = (*prev(result.end())).first;
		cout << (*prev(result.end())).first << "\n";
	}
}

Compilation message

diameter.cpp: In function 'void dfsSz(int, int)':
diameter.cpp:19:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   19 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'int fnCent(int, int, int)':
diameter.cpp:27:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   27 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsTour(int, int, int)':
diameter.cpp:35:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsEdgeRoot(int, int, int, int)':
diameter.cpp:45:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   45 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsCent(int, int)':
diameter.cpp:60:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   60 |  for(auto [v,w] : adj[cent]){
      |           ^
diameter.cpp:69:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   69 |  for(auto [v,w] : adj[cent]){
      |           ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 16 ms 28528 KB Output is correct
3 Correct 17 ms 28420 KB Output is correct
4 Correct 15 ms 28496 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 14 ms 28408 KB Output is correct
7 Correct 14 ms 28536 KB Output is correct
8 Correct 13 ms 28528 KB Output is correct
9 Correct 15 ms 28512 KB Output is correct
10 Correct 14 ms 28508 KB Output is correct
11 Correct 14 ms 28500 KB Output is correct
12 Correct 15 ms 28544 KB Output is correct
13 Correct 15 ms 28612 KB Output is correct
14 Correct 15 ms 28552 KB Output is correct
15 Correct 15 ms 28500 KB Output is correct
16 Correct 17 ms 28520 KB Output is correct
17 Correct 15 ms 28604 KB Output is correct
18 Correct 15 ms 28628 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 16 ms 28528 KB Output is correct
3 Correct 17 ms 28420 KB Output is correct
4 Correct 15 ms 28496 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 14 ms 28408 KB Output is correct
7 Correct 14 ms 28536 KB Output is correct
8 Correct 13 ms 28528 KB Output is correct
9 Correct 15 ms 28512 KB Output is correct
10 Correct 14 ms 28508 KB Output is correct
11 Correct 14 ms 28500 KB Output is correct
12 Correct 15 ms 28544 KB Output is correct
13 Correct 15 ms 28612 KB Output is correct
14 Correct 15 ms 28552 KB Output is correct
15 Correct 15 ms 28500 KB Output is correct
16 Correct 17 ms 28520 KB Output is correct
17 Correct 15 ms 28604 KB Output is correct
18 Correct 15 ms 28628 KB Output is correct
19 Correct 57 ms 30076 KB Output is correct
20 Correct 64 ms 30192 KB Output is correct
21 Correct 77 ms 30576 KB Output is correct
22 Correct 97 ms 30992 KB Output is correct
23 Correct 156 ms 37464 KB Output is correct
24 Correct 217 ms 40428 KB Output is correct
25 Correct 277 ms 42040 KB Output is correct
26 Correct 322 ms 44080 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28528 KB Output is correct
2 Correct 15 ms 28500 KB Output is correct
3 Correct 17 ms 28508 KB Output is correct
4 Correct 36 ms 28548 KB Output is correct
5 Correct 104 ms 28860 KB Output is correct
6 Correct 18 ms 28500 KB Output is correct
7 Correct 15 ms 28708 KB Output is correct
8 Correct 15 ms 28756 KB Output is correct
9 Correct 19 ms 28684 KB Output is correct
10 Correct 50 ms 28756 KB Output is correct
11 Correct 183 ms 29220 KB Output is correct
12 Correct 27 ms 30932 KB Output is correct
13 Correct 30 ms 30908 KB Output is correct
14 Correct 36 ms 30956 KB Output is correct
15 Correct 89 ms 31048 KB Output is correct
16 Correct 302 ms 31336 KB Output is correct
17 Correct 419 ms 76696 KB Output is correct
18 Correct 474 ms 76636 KB Output is correct
19 Correct 482 ms 76760 KB Output is correct
20 Correct 551 ms 76948 KB Output is correct
21 Correct 1221 ms 77348 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 30732 KB Output is correct
2 Correct 81 ms 30664 KB Output is correct
3 Correct 314 ms 30880 KB Output is correct
4 Correct 610 ms 31192 KB Output is correct
5 Correct 214 ms 59216 KB Output is correct
6 Correct 320 ms 59356 KB Output is correct
7 Correct 859 ms 59612 KB Output is correct
8 Correct 1603 ms 59884 KB Output is correct
9 Correct 1251 ms 213856 KB Output is correct
10 Correct 1442 ms 214064 KB Output is correct
11 Correct 2481 ms 214324 KB Output is correct
12 Correct 3694 ms 214540 KB Output is correct
13 Correct 2881 ms 425920 KB Output is correct
14 Correct 3063 ms 426176 KB Output is correct
15 Correct 4262 ms 426312 KB Output is correct
16 Execution timed out 5116 ms 426460 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5103 ms 321048 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 16 ms 28528 KB Output is correct
3 Correct 17 ms 28420 KB Output is correct
4 Correct 15 ms 28496 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 14 ms 28408 KB Output is correct
7 Correct 14 ms 28536 KB Output is correct
8 Correct 13 ms 28528 KB Output is correct
9 Correct 15 ms 28512 KB Output is correct
10 Correct 14 ms 28508 KB Output is correct
11 Correct 14 ms 28500 KB Output is correct
12 Correct 15 ms 28544 KB Output is correct
13 Correct 15 ms 28612 KB Output is correct
14 Correct 15 ms 28552 KB Output is correct
15 Correct 15 ms 28500 KB Output is correct
16 Correct 17 ms 28520 KB Output is correct
17 Correct 15 ms 28604 KB Output is correct
18 Correct 15 ms 28628 KB Output is correct
19 Correct 57 ms 30076 KB Output is correct
20 Correct 64 ms 30192 KB Output is correct
21 Correct 77 ms 30576 KB Output is correct
22 Correct 97 ms 30992 KB Output is correct
23 Correct 156 ms 37464 KB Output is correct
24 Correct 217 ms 40428 KB Output is correct
25 Correct 277 ms 42040 KB Output is correct
26 Correct 322 ms 44080 KB Output is correct
27 Correct 16 ms 28528 KB Output is correct
28 Correct 15 ms 28500 KB Output is correct
29 Correct 17 ms 28508 KB Output is correct
30 Correct 36 ms 28548 KB Output is correct
31 Correct 104 ms 28860 KB Output is correct
32 Correct 18 ms 28500 KB Output is correct
33 Correct 15 ms 28708 KB Output is correct
34 Correct 15 ms 28756 KB Output is correct
35 Correct 19 ms 28684 KB Output is correct
36 Correct 50 ms 28756 KB Output is correct
37 Correct 183 ms 29220 KB Output is correct
38 Correct 27 ms 30932 KB Output is correct
39 Correct 30 ms 30908 KB Output is correct
40 Correct 36 ms 30956 KB Output is correct
41 Correct 89 ms 31048 KB Output is correct
42 Correct 302 ms 31336 KB Output is correct
43 Correct 419 ms 76696 KB Output is correct
44 Correct 474 ms 76636 KB Output is correct
45 Correct 482 ms 76760 KB Output is correct
46 Correct 551 ms 76948 KB Output is correct
47 Correct 1221 ms 77348 KB Output is correct
48 Correct 29 ms 30732 KB Output is correct
49 Correct 81 ms 30664 KB Output is correct
50 Correct 314 ms 30880 KB Output is correct
51 Correct 610 ms 31192 KB Output is correct
52 Correct 214 ms 59216 KB Output is correct
53 Correct 320 ms 59356 KB Output is correct
54 Correct 859 ms 59612 KB Output is correct
55 Correct 1603 ms 59884 KB Output is correct
56 Correct 1251 ms 213856 KB Output is correct
57 Correct 1442 ms 214064 KB Output is correct
58 Correct 2481 ms 214324 KB Output is correct
59 Correct 3694 ms 214540 KB Output is correct
60 Correct 2881 ms 425920 KB Output is correct
61 Correct 3063 ms 426176 KB Output is correct
62 Correct 4262 ms 426312 KB Output is correct
63 Execution timed out 5116 ms 426460 KB Time limit exceeded
64 Halted 0 ms 0 KB -