oj.uz

Submission #619266

# Submission time Handle Problem Language Result Execution time Memory
619266 2022-08-02T10:50:22 Z HappyPacMan Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 487636 KB 
#include <bits/stdc++.h>
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];
unordered_map<int,int> tin[maxn],tout[maxn],edgeRoot[maxn];
unordered_map<int,ll> costEdge[maxn];
ll tempResult[maxn];
priority_queue<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;
			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
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));
	}
}
 
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:18:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   18 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'int fnCent(int, int, int)':
diameter.cpp:26:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   26 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsTour(int, int, int)':
diameter.cpp:34:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsEdgeRoot(int, int, int, int)':
diameter.cpp:44:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsCent(int, int)':
diameter.cpp:59:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |  for(auto [v,w] : adj[cent]){
      |           ^
diameter.cpp:70:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   70 |  for(auto [v,w] : adj[cent]){
      |           ^
diameter.cpp: In function 'int32_t main()':
diameter.cpp:140:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  140 |    auto [u,v] = bestEdge[i].top();
      |         ^
diameter.cpp:172:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  172 |     auto [u,v] = bestEdge[it].top();
      |          ^
diameter.cpp:190:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  190 |    auto [u,v] = result.top();
      |         ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 34772 KB Output is correct
2 Correct 22 ms 34692 KB Output is correct
3 Correct 23 ms 34756 KB Output is correct
4 Correct 20 ms 34772 KB Output is correct
5 Correct 23 ms 34796 KB Output is correct
6 Correct 23 ms 34808 KB Output is correct
7 Correct 22 ms 34772 KB Output is correct
8 Correct 19 ms 34780 KB Output is correct
9 Correct 18 ms 34856 KB Output is correct
10 Correct 20 ms 34772 KB Output is correct
11 Correct 20 ms 34772 KB Output is correct
12 Correct 20 ms 34880 KB Output is correct
13 Correct 20 ms 34900 KB Output is correct
14 Correct 25 ms 34880 KB Output is correct
15 Correct 20 ms 34900 KB Output is correct
16 Correct 20 ms 34900 KB Output is correct
17 Correct 25 ms 34900 KB Output is correct
18 Correct 21 ms 34856 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 34772 KB Output is correct
2 Correct 22 ms 34692 KB Output is correct
3 Correct 23 ms 34756 KB Output is correct
4 Correct 20 ms 34772 KB Output is correct
5 Correct 23 ms 34796 KB Output is correct
6 Correct 23 ms 34808 KB Output is correct
7 Correct 22 ms 34772 KB Output is correct
8 Correct 19 ms 34780 KB Output is correct
9 Correct 18 ms 34856 KB Output is correct
10 Correct 20 ms 34772 KB Output is correct
11 Correct 20 ms 34772 KB Output is correct
12 Correct 20 ms 34880 KB Output is correct
13 Correct 20 ms 34900 KB Output is correct
14 Correct 25 ms 34880 KB Output is correct
15 Correct 20 ms 34900 KB Output is correct
16 Correct 20 ms 34900 KB Output is correct
17 Correct 25 ms 34900 KB Output is correct
18 Correct 21 ms 34856 KB Output is correct
19 Correct 49 ms 36836 KB Output is correct
20 Correct 54 ms 37028 KB Output is correct
21 Correct 61 ms 37340 KB Output is correct
22 Correct 67 ms 38000 KB Output is correct
23 Correct 109 ms 44712 KB Output is correct
24 Correct 137 ms 47976 KB Output is correct
25 Correct 175 ms 50504 KB Output is correct
26 Correct 185 ms 53024 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 34772 KB Output is correct
2 Correct 20 ms 34772 KB Output is correct
3 Correct 22 ms 34828 KB Output is correct
4 Correct 36 ms 34984 KB Output is correct
5 Correct 109 ms 35532 KB Output is correct
6 Correct 19 ms 34772 KB Output is correct
7 Correct 20 ms 34940 KB Output is correct
8 Correct 20 ms 35052 KB Output is correct
9 Correct 21 ms 35056 KB Output is correct
10 Correct 40 ms 35388 KB Output is correct
11 Correct 141 ms 36396 KB Output is correct
12 Correct 31 ms 37072 KB Output is correct
13 Correct 25 ms 37056 KB Output is correct
14 Correct 29 ms 37140 KB Output is correct
15 Correct 53 ms 37556 KB Output is correct
16 Correct 146 ms 38284 KB Output is correct
17 Correct 163 ms 82664 KB Output is correct
18 Correct 169 ms 82668 KB Output is correct
19 Correct 175 ms 82648 KB Output is correct
20 Correct 196 ms 82992 KB Output is correct
21 Correct 384 ms 91244 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 37076 KB Output is correct
2 Correct 63 ms 37700 KB Output is correct
3 Correct 210 ms 39740 KB Output is correct
4 Correct 404 ms 42024 KB Output is correct
5 Correct 152 ms 66948 KB Output is correct
6 Correct 256 ms 67880 KB Output is correct
7 Correct 539 ms 71548 KB Output is correct
8 Correct 928 ms 76300 KB Output is correct
9 Correct 824 ms 226536 KB Output is correct
10 Correct 944 ms 227324 KB Output is correct
11 Correct 1410 ms 230024 KB Output is correct
12 Correct 2025 ms 234408 KB Output is correct
13 Correct 1703 ms 444132 KB Output is correct
14 Correct 1817 ms 445564 KB Output is correct
15 Correct 2392 ms 450300 KB Output is correct
16 Correct 3305 ms 450916 KB Output is correct
17 Correct 4689 ms 487636 KB Output is correct

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 34772 KB Output is correct
2 Correct 22 ms 34692 KB Output is correct
3 Correct 23 ms 34756 KB Output is correct
4 Correct 20 ms 34772 KB Output is correct
5 Correct 23 ms 34796 KB Output is correct
6 Correct 23 ms 34808 KB Output is correct
7 Correct 22 ms 34772 KB Output is correct
8 Correct 19 ms 34780 KB Output is correct
9 Correct 18 ms 34856 KB Output is correct
10 Correct 20 ms 34772 KB Output is correct
11 Correct 20 ms 34772 KB Output is correct
12 Correct 20 ms 34880 KB Output is correct
13 Correct 20 ms 34900 KB Output is correct
14 Correct 25 ms 34880 KB Output is correct
15 Correct 20 ms 34900 KB Output is correct
16 Correct 20 ms 34900 KB Output is correct
17 Correct 25 ms 34900 KB Output is correct
18 Correct 21 ms 34856 KB Output is correct
19 Correct 49 ms 36836 KB Output is correct
20 Correct 54 ms 37028 KB Output is correct
21 Correct 61 ms 37340 KB Output is correct
22 Correct 67 ms 38000 KB Output is correct
23 Correct 109 ms 44712 KB Output is correct
24 Correct 137 ms 47976 KB Output is correct
25 Correct 175 ms 50504 KB Output is correct
26 Correct 185 ms 53024 KB Output is correct
27 Correct 20 ms 34772 KB Output is correct
28 Correct 20 ms 34772 KB Output is correct
29 Correct 22 ms 34828 KB Output is correct
30 Correct 36 ms 34984 KB Output is correct
31 Correct 109 ms 35532 KB Output is correct
32 Correct 19 ms 34772 KB Output is correct
33 Correct 20 ms 34940 KB Output is correct
34 Correct 20 ms 35052 KB Output is correct
35 Correct 21 ms 35056 KB Output is correct
36 Correct 40 ms 35388 KB Output is correct
37 Correct 141 ms 36396 KB Output is correct
38 Correct 31 ms 37072 KB Output is correct
39 Correct 25 ms 37056 KB Output is correct
40 Correct 29 ms 37140 KB Output is correct
41 Correct 53 ms 37556 KB Output is correct
42 Correct 146 ms 38284 KB Output is correct
43 Correct 163 ms 82664 KB Output is correct
44 Correct 169 ms 82668 KB Output is correct
45 Correct 175 ms 82648 KB Output is correct
46 Correct 196 ms 82992 KB Output is correct
47 Correct 384 ms 91244 KB Output is correct
48 Correct 31 ms 37076 KB Output is correct
49 Correct 63 ms 37700 KB Output is correct
50 Correct 210 ms 39740 KB Output is correct
51 Correct 404 ms 42024 KB Output is correct
52 Correct 152 ms 66948 KB Output is correct
53 Correct 256 ms 67880 KB Output is correct
54 Correct 539 ms 71548 KB Output is correct
55 Correct 928 ms 76300 KB Output is correct
56 Correct 824 ms 226536 KB Output is correct
57 Correct 944 ms 227324 KB Output is correct
58 Correct 1410 ms 230024 KB Output is correct
59 Correct 2025 ms 234408 KB Output is correct
60 Correct 1703 ms 444132 KB Output is correct
61 Correct 1817 ms 445564 KB Output is correct
62 Correct 2392 ms 450300 KB Output is correct
63 Correct 3305 ms 450916 KB Output is correct
64 Correct 4689 ms 487636 KB Output is correct
65 Execution timed out 5083 ms 362432 KB Time limit exceeded
66 Halted 0 ms 0 KB -