oj.uz

Submission #619371

# Submission time Handle Problem Language Result Execution time Memory
619371 2022-08-02T11:28:32 Z HappyPacMan Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 5000 ms 497192 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],tinz[maxn],toutz[maxn];
map<int,int> tin[maxn],tout[maxn],edgeRoot[maxn];
map<int,ll> costEdge[maxn];
ll tempResult[maxn];
priority_queue<pair<ll,int> > bestEdge[maxn],result; 
ll cost[maxn];
 
inline 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];
		}
	}
}
inline 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;
}
inline 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]++;
		}
	}
}
inline 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);
		}
	}
}
inline 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;
			tinz[w] = tin[cent][w];
			toutz[w] = tout[cent][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
inline 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;
}
inline 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]);
	}
}
inline 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));
	}
}
 
int32_t 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]){
			int z = edgeRoot[it][i];
			upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,cost[i]);
			costEdge[it][z] = qry(it,1,0,timer[it]-1,tinz[z],toutz[z]);
			bestEdge[it].emplace(costEdge[it][z],z);
		}
	}
	for(int i=0;i<n;i++){
		vector<pair<ll,int> > best;
		while(!bestEdge[i].empty() && best.size() < 2){
			auto [u,v] = bestEdge[i].top();
			bestEdge[i].pop();
			if(costEdge[i][v] == u && (best.empty() || best.back() != make_pair(u,v))){
				best.emplace_back(u,v);
			}
		}
		ll sum = 0;
		for(auto it : best){
			sum += it.first;
		}
		for(auto it : best){
			bestEdge[i].emplace(it);
		}
		tempResult[i] = sum;
		result.emplace(tempResult[i],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];
		assert(partOf[i].size() <= 20);
		for(int it : partOf[i]){
			int z = edgeRoot[it][i];
			upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,df);
			costEdge[it][z] = qry(it,1,0,timer[it]-1,tinz[z],toutz[z]);
			bestEdge[it].emplace(costEdge[it][z],z);
			vector<pair<ll,int> > best;
			while(!bestEdge[it].empty() && best.size() < 2){
				auto [u,v] = bestEdge[it].top();
				bestEdge[it].pop();
				if(costEdge[it][v] == u && (best.empty() || best.back() != make_pair(u,v))){
					best.emplace_back(u,v);
				}
			}
			ll sum = 0;
			for(auto it2 : best){
				sum += it2.first;
			}
			for(auto it2 : best){
				bestEdge[it].emplace(it2);
			}
			tempResult[it] = sum;
			result.emplace(tempResult[it],it);
		}
		cost[i] = j;
		while(true){
			auto [u,v] = result.top();
			if(tempResult[v] == u){
				break;
			}
			result.pop();
		}
		last = result.top().first;
		cout << result.top().first << "\n";
	}
}

Compilation message

diameter.cpp: In function 'void dfsSz(int, int)':
diameter.cpp:21:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'int fnCent(int, int, int)':
diameter.cpp:29:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsTour(int, int, int)':
diameter.cpp:37:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   37 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsEdgeRoot(int, int, int, int)':
diameter.cpp:47:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   47 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsCent(int, int)':
diameter.cpp:62:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   62 |  for(auto [v,w] : adj[cent]){
      |           ^
diameter.cpp:73:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   73 |  for(auto [v,w] : adj[cent]){
      |           ^
diameter.cpp: In function 'int32_t main()':
diameter.cpp:143:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  143 |    auto [u,v] = bestEdge[i].top();
      |         ^
diameter.cpp:175:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  175 |     auto [u,v] = bestEdge[it].top();
      |          ^
diameter.cpp:193:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  193 |    auto [u,v] = result.top();
      |         ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31580 KB Output is correct
2 Correct 18 ms 31668 KB Output is correct
3 Correct 15 ms 31576 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 16 ms 31608 KB Output is correct
6 Correct 16 ms 31640 KB Output is correct
7 Correct 17 ms 31672 KB Output is correct
8 Correct 16 ms 31616 KB Output is correct
9 Correct 17 ms 31700 KB Output is correct
10 Correct 16 ms 31700 KB Output is correct
11 Correct 16 ms 31636 KB Output is correct
12 Correct 16 ms 31648 KB Output is correct
13 Correct 16 ms 31704 KB Output is correct
14 Correct 16 ms 31700 KB Output is correct
15 Correct 16 ms 31700 KB Output is correct
16 Correct 16 ms 31776 KB Output is correct
17 Correct 16 ms 31700 KB Output is correct
18 Correct 16 ms 31828 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31580 KB Output is correct
2 Correct 18 ms 31668 KB Output is correct
3 Correct 15 ms 31576 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 16 ms 31608 KB Output is correct
6 Correct 16 ms 31640 KB Output is correct
7 Correct 17 ms 31672 KB Output is correct
8 Correct 16 ms 31616 KB Output is correct
9 Correct 17 ms 31700 KB Output is correct
10 Correct 16 ms 31700 KB Output is correct
11 Correct 16 ms 31636 KB Output is correct
12 Correct 16 ms 31648 KB Output is correct
13 Correct 16 ms 31704 KB Output is correct
14 Correct 16 ms 31700 KB Output is correct
15 Correct 16 ms 31700 KB Output is correct
16 Correct 16 ms 31776 KB Output is correct
17 Correct 16 ms 31700 KB Output is correct
18 Correct 16 ms 31828 KB Output is correct
19 Correct 52 ms 33628 KB Output is correct
20 Correct 50 ms 33836 KB Output is correct
21 Correct 58 ms 34188 KB Output is correct
22 Correct 62 ms 34808 KB Output is correct
23 Correct 120 ms 41544 KB Output is correct
24 Correct 161 ms 44872 KB Output is correct
25 Correct 181 ms 47308 KB Output is correct
26 Correct 209 ms 49480 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31672 KB Output is correct
2 Correct 16 ms 31572 KB Output is correct
3 Correct 17 ms 31700 KB Output is correct
4 Correct 38 ms 31776 KB Output is correct
5 Correct 102 ms 32348 KB Output is correct
6 Correct 15 ms 31652 KB Output is correct
7 Correct 20 ms 31828 KB Output is correct
8 Correct 17 ms 31944 KB Output is correct
9 Correct 19 ms 31940 KB Output is correct
10 Correct 44 ms 32260 KB Output is correct
11 Correct 156 ms 33276 KB Output is correct
12 Correct 25 ms 34124 KB Output is correct
13 Correct 26 ms 34128 KB Output is correct
14 Correct 32 ms 34264 KB Output is correct
15 Correct 63 ms 34600 KB Output is correct
16 Correct 218 ms 35448 KB Output is correct
17 Correct 261 ms 81840 KB Output is correct
18 Correct 259 ms 81916 KB Output is correct
19 Correct 269 ms 81956 KB Output is correct
20 Correct 332 ms 82108 KB Output is correct
21 Correct 700 ms 86448 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 34004 KB Output is correct
2 Correct 64 ms 34568 KB Output is correct
3 Correct 230 ms 36184 KB Output is correct
4 Correct 433 ms 38416 KB Output is correct
5 Correct 161 ms 64384 KB Output is correct
6 Correct 258 ms 65280 KB Output is correct
7 Correct 663 ms 68900 KB Output is correct
8 Correct 1244 ms 73356 KB Output is correct
9 Correct 902 ms 228416 KB Output is correct
10 Correct 1098 ms 229192 KB Output is correct
11 Correct 1909 ms 231792 KB Output is correct
12 Correct 3076 ms 236452 KB Output is correct
13 Correct 1938 ms 453340 KB Output is correct
14 Correct 2147 ms 454952 KB Output is correct
15 Correct 3161 ms 459680 KB Output is correct
16 Correct 4392 ms 460228 KB Output is correct
17 Execution timed out 5044 ms 497192 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31580 KB Output is correct
2 Correct 18 ms 31668 KB Output is correct
3 Correct 15 ms 31576 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 16 ms 31608 KB Output is correct
6 Correct 16 ms 31640 KB Output is correct
7 Correct 17 ms 31672 KB Output is correct
8 Correct 16 ms 31616 KB Output is correct
9 Correct 17 ms 31700 KB Output is correct
10 Correct 16 ms 31700 KB Output is correct
11 Correct 16 ms 31636 KB Output is correct
12 Correct 16 ms 31648 KB Output is correct
13 Correct 16 ms 31704 KB Output is correct
14 Correct 16 ms 31700 KB Output is correct
15 Correct 16 ms 31700 KB Output is correct
16 Correct 16 ms 31776 KB Output is correct
17 Correct 16 ms 31700 KB Output is correct
18 Correct 16 ms 31828 KB Output is correct
19 Correct 52 ms 33628 KB Output is correct
20 Correct 50 ms 33836 KB Output is correct
21 Correct 58 ms 34188 KB Output is correct
22 Correct 62 ms 34808 KB Output is correct
23 Correct 120 ms 41544 KB Output is correct
24 Correct 161 ms 44872 KB Output is correct
25 Correct 181 ms 47308 KB Output is correct
26 Correct 209 ms 49480 KB Output is correct
27 Correct 18 ms 31672 KB Output is correct
28 Correct 16 ms 31572 KB Output is correct
29 Correct 17 ms 31700 KB Output is correct
30 Correct 38 ms 31776 KB Output is correct
31 Correct 102 ms 32348 KB Output is correct
32 Correct 15 ms 31652 KB Output is correct
33 Correct 20 ms 31828 KB Output is correct
34 Correct 17 ms 31944 KB Output is correct
35 Correct 19 ms 31940 KB Output is correct
36 Correct 44 ms 32260 KB Output is correct
37 Correct 156 ms 33276 KB Output is correct
38 Correct 25 ms 34124 KB Output is correct
39 Correct 26 ms 34128 KB Output is correct
40 Correct 32 ms 34264 KB Output is correct
41 Correct 63 ms 34600 KB Output is correct
42 Correct 218 ms 35448 KB Output is correct
43 Correct 261 ms 81840 KB Output is correct
44 Correct 259 ms 81916 KB Output is correct
45 Correct 269 ms 81956 KB Output is correct
46 Correct 332 ms 82108 KB Output is correct
47 Correct 700 ms 86448 KB Output is correct
48 Correct 29 ms 34004 KB Output is correct
49 Correct 64 ms 34568 KB Output is correct
50 Correct 230 ms 36184 KB Output is correct
51 Correct 433 ms 38416 KB Output is correct
52 Correct 161 ms 64384 KB Output is correct
53 Correct 258 ms 65280 KB Output is correct
54 Correct 663 ms 68900 KB Output is correct
55 Correct 1244 ms 73356 KB Output is correct
56 Correct 902 ms 228416 KB Output is correct
57 Correct 1098 ms 229192 KB Output is correct
58 Correct 1909 ms 231792 KB Output is correct
59 Correct 3076 ms 236452 KB Output is correct
60 Correct 1938 ms 453340 KB Output is correct
61 Correct 2147 ms 454952 KB Output is correct
62 Correct 3161 ms 459680 KB Output is correct
63 Correct 4392 ms 460228 KB Output is correct
64 Execution timed out 5044 ms 497192 KB Time limit exceeded
65 Halted 0 ms 0 KB -