oj.uz

Submission #619363

# Submission time Handle Problem Language Result Execution time Memory
619363 2022-08-02T11:25:32 Z HappyPacMan Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 488052 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];
 
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: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 25 ms 34688 KB Output is correct
2 Correct 23 ms 34772 KB Output is correct
3 Correct 26 ms 34704 KB Output is correct
4 Correct 18 ms 34776 KB Output is correct
5 Correct 18 ms 34784 KB Output is correct
6 Correct 18 ms 34772 KB Output is correct
7 Correct 18 ms 34808 KB Output is correct
8 Correct 24 ms 34772 KB Output is correct
9 Correct 18 ms 34764 KB Output is correct
10 Correct 18 ms 34824 KB Output is correct
11 Correct 18 ms 34772 KB Output is correct
12 Correct 18 ms 34788 KB Output is correct
13 Correct 18 ms 34892 KB Output is correct
14 Correct 18 ms 34776 KB Output is correct
15 Correct 20 ms 34928 KB Output is correct
16 Correct 20 ms 34900 KB Output is correct
17 Correct 20 ms 34900 KB Output is correct
18 Correct 21 ms 34900 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 34688 KB Output is correct
2 Correct 23 ms 34772 KB Output is correct
3 Correct 26 ms 34704 KB Output is correct
4 Correct 18 ms 34776 KB Output is correct
5 Correct 18 ms 34784 KB Output is correct
6 Correct 18 ms 34772 KB Output is correct
7 Correct 18 ms 34808 KB Output is correct
8 Correct 24 ms 34772 KB Output is correct
9 Correct 18 ms 34764 KB Output is correct
10 Correct 18 ms 34824 KB Output is correct
11 Correct 18 ms 34772 KB Output is correct
12 Correct 18 ms 34788 KB Output is correct
13 Correct 18 ms 34892 KB Output is correct
14 Correct 18 ms 34776 KB Output is correct
15 Correct 20 ms 34928 KB Output is correct
16 Correct 20 ms 34900 KB Output is correct
17 Correct 20 ms 34900 KB Output is correct
18 Correct 21 ms 34900 KB Output is correct
19 Correct 50 ms 36848 KB Output is correct
20 Correct 47 ms 37048 KB Output is correct
21 Correct 55 ms 37360 KB Output is correct
22 Correct 60 ms 38076 KB Output is correct
23 Correct 102 ms 44864 KB Output is correct
24 Correct 142 ms 48104 KB Output is correct
25 Correct 167 ms 50528 KB Output is correct
26 Correct 183 ms 52812 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 34772 KB Output is correct
2 Correct 27 ms 34772 KB Output is correct
3 Correct 30 ms 34772 KB Output is correct
4 Correct 38 ms 35020 KB Output is correct
5 Correct 104 ms 36092 KB Output is correct
6 Correct 19 ms 34724 KB Output is correct
7 Correct 19 ms 35028 KB Output is correct
8 Correct 19 ms 35040 KB Output is correct
9 Correct 22 ms 35060 KB Output is correct
10 Correct 41 ms 35640 KB Output is correct
11 Correct 129 ms 37100 KB Output is correct
12 Correct 24 ms 37100 KB Output is correct
13 Correct 29 ms 37132 KB Output is correct
14 Correct 32 ms 37184 KB Output is correct
15 Correct 51 ms 37748 KB Output is correct
16 Correct 150 ms 38852 KB Output is correct
17 Correct 166 ms 83292 KB Output is correct
18 Correct 160 ms 83320 KB Output is correct
19 Correct 159 ms 83300 KB Output is correct
20 Correct 193 ms 83768 KB Output is correct
21 Correct 370 ms 92236 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 37176 KB Output is correct
2 Correct 65 ms 37760 KB Output is correct
3 Correct 207 ms 39736 KB Output is correct
4 Correct 389 ms 41912 KB Output is correct
5 Correct 155 ms 66924 KB Output is correct
6 Correct 218 ms 67896 KB Output is correct
7 Correct 567 ms 71568 KB Output is correct
8 Correct 929 ms 76156 KB Output is correct
9 Correct 798 ms 226256 KB Output is correct
10 Correct 902 ms 227324 KB Output is correct
11 Correct 1371 ms 229776 KB Output is correct
12 Correct 1975 ms 234488 KB Output is correct
13 Correct 1762 ms 444216 KB Output is correct
14 Correct 1766 ms 445868 KB Output is correct
15 Correct 2350 ms 450844 KB Output is correct
16 Correct 3106 ms 451320 KB Output is correct
17 Correct 4604 ms 488052 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4862 ms 362588 KB Output is correct
2 Execution timed out 5047 ms 372848 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 34688 KB Output is correct
2 Correct 23 ms 34772 KB Output is correct
3 Correct 26 ms 34704 KB Output is correct
4 Correct 18 ms 34776 KB Output is correct
5 Correct 18 ms 34784 KB Output is correct
6 Correct 18 ms 34772 KB Output is correct
7 Correct 18 ms 34808 KB Output is correct
8 Correct 24 ms 34772 KB Output is correct
9 Correct 18 ms 34764 KB Output is correct
10 Correct 18 ms 34824 KB Output is correct
11 Correct 18 ms 34772 KB Output is correct
12 Correct 18 ms 34788 KB Output is correct
13 Correct 18 ms 34892 KB Output is correct
14 Correct 18 ms 34776 KB Output is correct
15 Correct 20 ms 34928 KB Output is correct
16 Correct 20 ms 34900 KB Output is correct
17 Correct 20 ms 34900 KB Output is correct
18 Correct 21 ms 34900 KB Output is correct
19 Correct 50 ms 36848 KB Output is correct
20 Correct 47 ms 37048 KB Output is correct
21 Correct 55 ms 37360 KB Output is correct
22 Correct 60 ms 38076 KB Output is correct
23 Correct 102 ms 44864 KB Output is correct
24 Correct 142 ms 48104 KB Output is correct
25 Correct 167 ms 50528 KB Output is correct
26 Correct 183 ms 52812 KB Output is correct
27 Correct 22 ms 34772 KB Output is correct
28 Correct 27 ms 34772 KB Output is correct
29 Correct 30 ms 34772 KB Output is correct
30 Correct 38 ms 35020 KB Output is correct
31 Correct 104 ms 36092 KB Output is correct
32 Correct 19 ms 34724 KB Output is correct
33 Correct 19 ms 35028 KB Output is correct
34 Correct 19 ms 35040 KB Output is correct
35 Correct 22 ms 35060 KB Output is correct
36 Correct 41 ms 35640 KB Output is correct
37 Correct 129 ms 37100 KB Output is correct
38 Correct 24 ms 37100 KB Output is correct
39 Correct 29 ms 37132 KB Output is correct
40 Correct 32 ms 37184 KB Output is correct
41 Correct 51 ms 37748 KB Output is correct
42 Correct 150 ms 38852 KB Output is correct
43 Correct 166 ms 83292 KB Output is correct
44 Correct 160 ms 83320 KB Output is correct
45 Correct 159 ms 83300 KB Output is correct
46 Correct 193 ms 83768 KB Output is correct
47 Correct 370 ms 92236 KB Output is correct
48 Correct 29 ms 37176 KB Output is correct
49 Correct 65 ms 37760 KB Output is correct
50 Correct 207 ms 39736 KB Output is correct
51 Correct 389 ms 41912 KB Output is correct
52 Correct 155 ms 66924 KB Output is correct
53 Correct 218 ms 67896 KB Output is correct
54 Correct 567 ms 71568 KB Output is correct
55 Correct 929 ms 76156 KB Output is correct
56 Correct 798 ms 226256 KB Output is correct
57 Correct 902 ms 227324 KB Output is correct
58 Correct 1371 ms 229776 KB Output is correct
59 Correct 1975 ms 234488 KB Output is correct
60 Correct 1762 ms 444216 KB Output is correct
61 Correct 1766 ms 445868 KB Output is correct
62 Correct 2350 ms 450844 KB Output is correct
63 Correct 3106 ms 451320 KB Output is correct
64 Correct 4604 ms 488052 KB Output is correct
65 Correct 4862 ms 362588 KB Output is correct
66 Execution timed out 5047 ms 372848 KB Time limit exceeded
67 Halted 0 ms 0 KB -