oj.uz

Submission #619218

# Submission time Handle Problem Language Result Execution time Memory
619218 2022-08-02T10:33:56 Z HappyPacMan Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 486428 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];
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;
			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,tin[it][z],tout[it][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];
		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,tin[it][z],tout[it][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";
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 34772 KB Output is correct
2 Correct 21 ms 34696 KB Output is correct
3 Correct 26 ms 34764 KB Output is correct
4 Correct 23 ms 34672 KB Output is correct
5 Correct 28 ms 34844 KB Output is correct
6 Correct 28 ms 34684 KB Output is correct
7 Correct 23 ms 34764 KB Output is correct
8 Correct 23 ms 34772 KB Output is correct
9 Correct 22 ms 34788 KB Output is correct
10 Correct 20 ms 34828 KB Output is correct
11 Correct 21 ms 34840 KB Output is correct
12 Correct 22 ms 34752 KB Output is correct
13 Correct 26 ms 34836 KB Output is correct
14 Correct 29 ms 34900 KB Output is correct
15 Correct 21 ms 34896 KB Output is correct
16 Correct 30 ms 34892 KB Output is correct
17 Correct 28 ms 34892 KB Output is correct
18 Correct 28 ms 34904 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 34772 KB Output is correct
2 Correct 21 ms 34696 KB Output is correct
3 Correct 26 ms 34764 KB Output is correct
4 Correct 23 ms 34672 KB Output is correct
5 Correct 28 ms 34844 KB Output is correct
6 Correct 28 ms 34684 KB Output is correct
7 Correct 23 ms 34764 KB Output is correct
8 Correct 23 ms 34772 KB Output is correct
9 Correct 22 ms 34788 KB Output is correct
10 Correct 20 ms 34828 KB Output is correct
11 Correct 21 ms 34840 KB Output is correct
12 Correct 22 ms 34752 KB Output is correct
13 Correct 26 ms 34836 KB Output is correct
14 Correct 29 ms 34900 KB Output is correct
15 Correct 21 ms 34896 KB Output is correct
16 Correct 30 ms 34892 KB Output is correct
17 Correct 28 ms 34892 KB Output is correct
18 Correct 28 ms 34904 KB Output is correct
19 Correct 81 ms 36776 KB Output is correct
20 Correct 83 ms 36992 KB Output is correct
21 Correct 85 ms 37312 KB Output is correct
22 Correct 78 ms 38028 KB Output is correct
23 Correct 141 ms 44620 KB Output is correct
24 Correct 181 ms 47944 KB Output is correct
25 Correct 188 ms 50376 KB Output is correct
26 Correct 208 ms 52780 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 34896 KB Output is correct
2 Correct 21 ms 34792 KB Output is correct
3 Correct 22 ms 34724 KB Output is correct
4 Correct 37 ms 34972 KB Output is correct
5 Correct 116 ms 35608 KB Output is correct
6 Correct 22 ms 34772 KB Output is correct
7 Correct 20 ms 34900 KB Output is correct
8 Correct 21 ms 34956 KB Output is correct
9 Correct 22 ms 34992 KB Output is correct
10 Correct 42 ms 35380 KB Output is correct
11 Correct 135 ms 36408 KB Output is correct
12 Correct 26 ms 36976 KB Output is correct
13 Correct 27 ms 37040 KB Output is correct
14 Correct 30 ms 37064 KB Output is correct
15 Correct 51 ms 37488 KB Output is correct
16 Correct 160 ms 38284 KB Output is correct
17 Correct 168 ms 81872 KB Output is correct
18 Correct 166 ms 81936 KB Output is correct
19 Correct 164 ms 81896 KB Output is correct
20 Correct 194 ms 82156 KB Output is correct
21 Correct 363 ms 90336 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 37156 KB Output is correct
2 Correct 62 ms 37672 KB Output is correct
3 Correct 233 ms 39364 KB Output is correct
4 Correct 437 ms 41520 KB Output is correct
5 Correct 152 ms 66708 KB Output is correct
6 Correct 225 ms 67584 KB Output is correct
7 Correct 594 ms 70968 KB Output is correct
8 Correct 973 ms 75544 KB Output is correct
9 Correct 813 ms 225472 KB Output is correct
10 Correct 941 ms 226312 KB Output is correct
11 Correct 1439 ms 228888 KB Output is correct
12 Correct 2053 ms 233448 KB Output is correct
13 Correct 1576 ms 442796 KB Output is correct
14 Correct 1832 ms 444248 KB Output is correct
15 Correct 2531 ms 449028 KB Output is correct
16 Correct 3075 ms 449700 KB Output is correct
17 Correct 4390 ms 486428 KB Output is correct

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 34772 KB Output is correct
2 Correct 21 ms 34696 KB Output is correct
3 Correct 26 ms 34764 KB Output is correct
4 Correct 23 ms 34672 KB Output is correct
5 Correct 28 ms 34844 KB Output is correct
6 Correct 28 ms 34684 KB Output is correct
7 Correct 23 ms 34764 KB Output is correct
8 Correct 23 ms 34772 KB Output is correct
9 Correct 22 ms 34788 KB Output is correct
10 Correct 20 ms 34828 KB Output is correct
11 Correct 21 ms 34840 KB Output is correct
12 Correct 22 ms 34752 KB Output is correct
13 Correct 26 ms 34836 KB Output is correct
14 Correct 29 ms 34900 KB Output is correct
15 Correct 21 ms 34896 KB Output is correct
16 Correct 30 ms 34892 KB Output is correct
17 Correct 28 ms 34892 KB Output is correct
18 Correct 28 ms 34904 KB Output is correct
19 Correct 81 ms 36776 KB Output is correct
20 Correct 83 ms 36992 KB Output is correct
21 Correct 85 ms 37312 KB Output is correct
22 Correct 78 ms 38028 KB Output is correct
23 Correct 141 ms 44620 KB Output is correct
24 Correct 181 ms 47944 KB Output is correct
25 Correct 188 ms 50376 KB Output is correct
26 Correct 208 ms 52780 KB Output is correct
27 Correct 20 ms 34896 KB Output is correct
28 Correct 21 ms 34792 KB Output is correct
29 Correct 22 ms 34724 KB Output is correct
30 Correct 37 ms 34972 KB Output is correct
31 Correct 116 ms 35608 KB Output is correct
32 Correct 22 ms 34772 KB Output is correct
33 Correct 20 ms 34900 KB Output is correct
34 Correct 21 ms 34956 KB Output is correct
35 Correct 22 ms 34992 KB Output is correct
36 Correct 42 ms 35380 KB Output is correct
37 Correct 135 ms 36408 KB Output is correct
38 Correct 26 ms 36976 KB Output is correct
39 Correct 27 ms 37040 KB Output is correct
40 Correct 30 ms 37064 KB Output is correct
41 Correct 51 ms 37488 KB Output is correct
42 Correct 160 ms 38284 KB Output is correct
43 Correct 168 ms 81872 KB Output is correct
44 Correct 166 ms 81936 KB Output is correct
45 Correct 164 ms 81896 KB Output is correct
46 Correct 194 ms 82156 KB Output is correct
47 Correct 363 ms 90336 KB Output is correct
48 Correct 30 ms 37156 KB Output is correct
49 Correct 62 ms 37672 KB Output is correct
50 Correct 233 ms 39364 KB Output is correct
51 Correct 437 ms 41520 KB Output is correct
52 Correct 152 ms 66708 KB Output is correct
53 Correct 225 ms 67584 KB Output is correct
54 Correct 594 ms 70968 KB Output is correct
55 Correct 973 ms 75544 KB Output is correct
56 Correct 813 ms 225472 KB Output is correct
57 Correct 941 ms 226312 KB Output is correct
58 Correct 1439 ms 228888 KB Output is correct
59 Correct 2053 ms 233448 KB Output is correct
60 Correct 1576 ms 442796 KB Output is correct
61 Correct 1832 ms 444248 KB Output is correct
62 Correct 2531 ms 449028 KB Output is correct
63 Correct 3075 ms 449700 KB Output is correct
64 Correct 4390 ms 486428 KB Output is correct
65 Execution timed out 5083 ms 361432 KB Time limit exceeded
66 Halted 0 ms 0 KB -