oj.uz

Submission #619170

# Submission time Handle Problem Language Result Execution time Memory
619170 2022-08-02T10:21:44 Z HappyPacMan Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 486492 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]){
			upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,cost[i]);
			costEdge[it][edgeRoot[it][i]] = qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]);
			bestEdge[it].emplace(costEdge[it][edgeRoot[it][i]],edgeRoot[it][i]);
		}
	}
	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]){
			upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,df);
			costEdge[it][edgeRoot[it][i]] = qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]);
			bestEdge[it].emplace(costEdge[it][edgeRoot[it][i]],edgeRoot[it][i]);
			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 19 ms 34772 KB Output is correct
2 Correct 18 ms 34756 KB Output is correct
3 Correct 20 ms 34696 KB Output is correct
4 Correct 19 ms 34788 KB Output is correct
5 Correct 22 ms 34900 KB Output is correct
6 Correct 23 ms 34772 KB Output is correct
7 Correct 19 ms 34784 KB Output is correct
8 Correct 19 ms 34940 KB Output is correct
9 Correct 20 ms 34832 KB Output is correct
10 Correct 19 ms 34812 KB Output is correct
11 Correct 20 ms 34772 KB Output is correct
12 Correct 20 ms 34872 KB Output is correct
13 Correct 20 ms 34892 KB Output is correct
14 Correct 19 ms 34900 KB Output is correct
15 Correct 20 ms 34900 KB Output is correct
16 Correct 20 ms 34924 KB Output is correct
17 Correct 21 ms 34848 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 19 ms 34772 KB Output is correct
2 Correct 18 ms 34756 KB Output is correct
3 Correct 20 ms 34696 KB Output is correct
4 Correct 19 ms 34788 KB Output is correct
5 Correct 22 ms 34900 KB Output is correct
6 Correct 23 ms 34772 KB Output is correct
7 Correct 19 ms 34784 KB Output is correct
8 Correct 19 ms 34940 KB Output is correct
9 Correct 20 ms 34832 KB Output is correct
10 Correct 19 ms 34812 KB Output is correct
11 Correct 20 ms 34772 KB Output is correct
12 Correct 20 ms 34872 KB Output is correct
13 Correct 20 ms 34892 KB Output is correct
14 Correct 19 ms 34900 KB Output is correct
15 Correct 20 ms 34900 KB Output is correct
16 Correct 20 ms 34924 KB Output is correct
17 Correct 21 ms 34848 KB Output is correct
18 Correct 21 ms 34900 KB Output is correct
19 Correct 49 ms 36772 KB Output is correct
20 Correct 52 ms 36972 KB Output is correct
21 Correct 59 ms 37300 KB Output is correct
22 Correct 62 ms 38008 KB Output is correct
23 Correct 121 ms 44676 KB Output is correct
24 Correct 147 ms 48024 KB Output is correct
25 Correct 188 ms 50356 KB Output is correct
26 Correct 205 ms 52768 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 22 ms 34796 KB Output is correct
3 Correct 25 ms 34840 KB Output is correct
4 Correct 40 ms 34928 KB Output is correct
5 Correct 111 ms 35448 KB Output is correct
6 Correct 19 ms 34788 KB Output is correct
7 Correct 19 ms 34900 KB Output is correct
8 Correct 19 ms 35028 KB Output is correct
9 Correct 21 ms 35012 KB Output is correct
10 Correct 39 ms 35400 KB Output is correct
11 Correct 123 ms 36412 KB Output is correct
12 Correct 24 ms 37072 KB Output is correct
13 Correct 26 ms 37060 KB Output is correct
14 Correct 30 ms 37104 KB Output is correct
15 Correct 51 ms 37412 KB Output is correct
16 Correct 153 ms 38200 KB Output is correct
17 Correct 160 ms 81940 KB Output is correct
18 Correct 159 ms 81948 KB Output is correct
19 Correct 155 ms 82104 KB Output is correct
20 Correct 207 ms 82124 KB Output is correct
21 Correct 365 ms 90372 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 37128 KB Output is correct
2 Correct 69 ms 37628 KB Output is correct
3 Correct 218 ms 39276 KB Output is correct
4 Correct 414 ms 41560 KB Output is correct
5 Correct 163 ms 66684 KB Output is correct
6 Correct 239 ms 67764 KB Output is correct
7 Correct 621 ms 70972 KB Output is correct
8 Correct 1071 ms 75544 KB Output is correct
9 Correct 858 ms 225576 KB Output is correct
10 Correct 988 ms 226340 KB Output is correct
11 Correct 1554 ms 228888 KB Output is correct
12 Correct 2616 ms 233520 KB Output is correct
13 Correct 1781 ms 443032 KB Output is correct
14 Correct 1964 ms 444252 KB Output is correct
15 Correct 2619 ms 449184 KB Output is correct
16 Correct 3471 ms 449752 KB Output is correct
17 Execution timed out 5043 ms 486492 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 5095 ms 359160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 34772 KB Output is correct
2 Correct 18 ms 34756 KB Output is correct
3 Correct 20 ms 34696 KB Output is correct
4 Correct 19 ms 34788 KB Output is correct
5 Correct 22 ms 34900 KB Output is correct
6 Correct 23 ms 34772 KB Output is correct
7 Correct 19 ms 34784 KB Output is correct
8 Correct 19 ms 34940 KB Output is correct
9 Correct 20 ms 34832 KB Output is correct
10 Correct 19 ms 34812 KB Output is correct
11 Correct 20 ms 34772 KB Output is correct
12 Correct 20 ms 34872 KB Output is correct
13 Correct 20 ms 34892 KB Output is correct
14 Correct 19 ms 34900 KB Output is correct
15 Correct 20 ms 34900 KB Output is correct
16 Correct 20 ms 34924 KB Output is correct
17 Correct 21 ms 34848 KB Output is correct
18 Correct 21 ms 34900 KB Output is correct
19 Correct 49 ms 36772 KB Output is correct
20 Correct 52 ms 36972 KB Output is correct
21 Correct 59 ms 37300 KB Output is correct
22 Correct 62 ms 38008 KB Output is correct
23 Correct 121 ms 44676 KB Output is correct
24 Correct 147 ms 48024 KB Output is correct
25 Correct 188 ms 50356 KB Output is correct
26 Correct 205 ms 52768 KB Output is correct
27 Correct 20 ms 34772 KB Output is correct
28 Correct 22 ms 34796 KB Output is correct
29 Correct 25 ms 34840 KB Output is correct
30 Correct 40 ms 34928 KB Output is correct
31 Correct 111 ms 35448 KB Output is correct
32 Correct 19 ms 34788 KB Output is correct
33 Correct 19 ms 34900 KB Output is correct
34 Correct 19 ms 35028 KB Output is correct
35 Correct 21 ms 35012 KB Output is correct
36 Correct 39 ms 35400 KB Output is correct
37 Correct 123 ms 36412 KB Output is correct
38 Correct 24 ms 37072 KB Output is correct
39 Correct 26 ms 37060 KB Output is correct
40 Correct 30 ms 37104 KB Output is correct
41 Correct 51 ms 37412 KB Output is correct
42 Correct 153 ms 38200 KB Output is correct
43 Correct 160 ms 81940 KB Output is correct
44 Correct 159 ms 81948 KB Output is correct
45 Correct 155 ms 82104 KB Output is correct
46 Correct 207 ms 82124 KB Output is correct
47 Correct 365 ms 90372 KB Output is correct
48 Correct 34 ms 37128 KB Output is correct
49 Correct 69 ms 37628 KB Output is correct
50 Correct 218 ms 39276 KB Output is correct
51 Correct 414 ms 41560 KB Output is correct
52 Correct 163 ms 66684 KB Output is correct
53 Correct 239 ms 67764 KB Output is correct
54 Correct 621 ms 70972 KB Output is correct
55 Correct 1071 ms 75544 KB Output is correct
56 Correct 858 ms 225576 KB Output is correct
57 Correct 988 ms 226340 KB Output is correct
58 Correct 1554 ms 228888 KB Output is correct
59 Correct 2616 ms 233520 KB Output is correct
60 Correct 1781 ms 443032 KB Output is correct
61 Correct 1964 ms 444252 KB Output is correct
62 Correct 2619 ms 449184 KB Output is correct
63 Correct 3471 ms 449752 KB Output is correct
64 Execution timed out 5043 ms 486492 KB Time limit exceeded
65 Halted 0 ms 0 KB -