oj.uz

Submission #619077

# Submission time Handle Problem Language Result Execution time Memory
619077 2022-08-02T09:43:32 Z HappyPacMan Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 5000 ms 416076 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];
set<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));
	}
}
 
int 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]){
			bestEdge[it].erase(bestEdge[it].find(make_pair(qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]),edgeRoot[it][i])));
			upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,cost[i]);
			bestEdge[it].insert(make_pair(qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]),edgeRoot[it][i]));
		}
	}
	for(int i=0;i<n;i++){
		if(bestEdge[i].size() > 1){
			result.emplace((*prev(bestEdge[i].end())).first+(*prev(prev(bestEdge[i].end()))).first,i);
		}else if(bestEdge[i].size()){
			result.emplace((*prev(bestEdge[i].end())).first,i);
		}else{
			result.emplace(0,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]){
			if(bestEdge[it].size() > 1){
				result.erase(result.find(make_pair((*prev(bestEdge[it].end())).first+(*prev(prev(bestEdge[it].end()))).first,it)));
			}else if(bestEdge[it].size()){
				result.erase(result.find(make_pair((*prev(bestEdge[it].end())).first,it)));
			}else{
				result.erase(result.find(make_pair(0,it)));
			}
			bestEdge[it].erase(bestEdge[it].find(make_pair(qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]),edgeRoot[it][i])));
			upd(it,1,0,timer[it]-1,tin[it][i],tout[it][i]-1,df);
			bestEdge[it].insert(make_pair(qry(it,1,0,timer[it]-1,tin[it][edgeRoot[it][i]],tout[it][edgeRoot[it][i]]),edgeRoot[it][i]));
			if(bestEdge[it].size() > 1){
				result.emplace((*prev(bestEdge[it].end())).first+(*prev(prev(bestEdge[it].end()))).first,it);
			}else if(bestEdge[it].size()){
				result.emplace((*prev(bestEdge[it].end())).first,it);
			}else{
				result.emplace(0,it);
			}
		}
		cost[i] = j;
		last = (*prev(result.end())).first;
		cout << (*prev(result.end())).first << "\n";
	}
}

Compilation message

diameter.cpp: In function 'void dfsSz(int, int)':
diameter.cpp:19:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   19 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'int fnCent(int, int, int)':
diameter.cpp:27:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   27 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsTour(int, int, int)':
diameter.cpp:35:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsEdgeRoot(int, int, int, int)':
diameter.cpp:45:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   45 |  for(auto [v,w] : adj[u]){
      |           ^
diameter.cpp: In function 'void dfsCent(int, int)':
diameter.cpp:60:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   60 |  for(auto [v,w] : adj[cent]){
      |           ^
diameter.cpp:69:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   69 |  for(auto [v,w] : adj[cent]){
      |           ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 30796 KB Output is correct
2 Correct 23 ms 30840 KB Output is correct
3 Correct 19 ms 30860 KB Output is correct
4 Correct 17 ms 30864 KB Output is correct
5 Correct 16 ms 30804 KB Output is correct
6 Correct 16 ms 30804 KB Output is correct
7 Correct 21 ms 30888 KB Output is correct
8 Correct 19 ms 30904 KB Output is correct
9 Correct 19 ms 30868 KB Output is correct
10 Correct 18 ms 30824 KB Output is correct
11 Correct 17 ms 30860 KB Output is correct
12 Correct 17 ms 30844 KB Output is correct
13 Correct 16 ms 30932 KB Output is correct
14 Correct 17 ms 30936 KB Output is correct
15 Correct 16 ms 30984 KB Output is correct
16 Correct 17 ms 30996 KB Output is correct
17 Correct 21 ms 30928 KB Output is correct
18 Correct 19 ms 30968 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 30796 KB Output is correct
2 Correct 23 ms 30840 KB Output is correct
3 Correct 19 ms 30860 KB Output is correct
4 Correct 17 ms 30864 KB Output is correct
5 Correct 16 ms 30804 KB Output is correct
6 Correct 16 ms 30804 KB Output is correct
7 Correct 21 ms 30888 KB Output is correct
8 Correct 19 ms 30904 KB Output is correct
9 Correct 19 ms 30868 KB Output is correct
10 Correct 18 ms 30824 KB Output is correct
11 Correct 17 ms 30860 KB Output is correct
12 Correct 17 ms 30844 KB Output is correct
13 Correct 16 ms 30932 KB Output is correct
14 Correct 17 ms 30936 KB Output is correct
15 Correct 16 ms 30984 KB Output is correct
16 Correct 17 ms 30996 KB Output is correct
17 Correct 21 ms 30928 KB Output is correct
18 Correct 19 ms 30968 KB Output is correct
19 Correct 45 ms 32460 KB Output is correct
20 Correct 49 ms 32676 KB Output is correct
21 Correct 57 ms 32920 KB Output is correct
22 Correct 65 ms 33356 KB Output is correct
23 Correct 108 ms 39944 KB Output is correct
24 Correct 144 ms 42804 KB Output is correct
25 Correct 179 ms 44480 KB Output is correct
26 Correct 210 ms 46576 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 30804 KB Output is correct
2 Correct 20 ms 30864 KB Output is correct
3 Correct 21 ms 30804 KB Output is correct
4 Correct 48 ms 31068 KB Output is correct
5 Correct 110 ms 31432 KB Output is correct
6 Correct 21 ms 30804 KB Output is correct
7 Correct 17 ms 30996 KB Output is correct
8 Correct 17 ms 31124 KB Output is correct
9 Correct 20 ms 31132 KB Output is correct
10 Correct 41 ms 31316 KB Output is correct
11 Correct 149 ms 31696 KB Output is correct
12 Correct 28 ms 33156 KB Output is correct
13 Correct 28 ms 33144 KB Output is correct
14 Correct 39 ms 33260 KB Output is correct
15 Correct 57 ms 33468 KB Output is correct
16 Correct 191 ms 34076 KB Output is correct
17 Correct 267 ms 78744 KB Output is correct
18 Correct 296 ms 78860 KB Output is correct
19 Correct 373 ms 78952 KB Output is correct
20 Correct 444 ms 78976 KB Output is correct
21 Correct 703 ms 79408 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 32928 KB Output is correct
2 Correct 68 ms 33244 KB Output is correct
3 Correct 205 ms 33492 KB Output is correct
4 Correct 397 ms 33804 KB Output is correct
5 Correct 174 ms 60848 KB Output is correct
6 Correct 240 ms 60960 KB Output is correct
7 Correct 616 ms 61272 KB Output is correct
8 Correct 1099 ms 61704 KB Output is correct
9 Correct 888 ms 210668 KB Output is correct
10 Correct 1020 ms 210660 KB Output is correct
11 Correct 1703 ms 210832 KB Output is correct
12 Correct 2345 ms 211176 KB Output is correct
13 Correct 2052 ms 415060 KB Output is correct
14 Correct 2161 ms 415120 KB Output is correct
15 Correct 2758 ms 415600 KB Output is correct
16 Correct 4191 ms 415824 KB Output is correct
17 Execution timed out 5100 ms 416076 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 5112 ms 319740 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 30796 KB Output is correct
2 Correct 23 ms 30840 KB Output is correct
3 Correct 19 ms 30860 KB Output is correct
4 Correct 17 ms 30864 KB Output is correct
5 Correct 16 ms 30804 KB Output is correct
6 Correct 16 ms 30804 KB Output is correct
7 Correct 21 ms 30888 KB Output is correct
8 Correct 19 ms 30904 KB Output is correct
9 Correct 19 ms 30868 KB Output is correct
10 Correct 18 ms 30824 KB Output is correct
11 Correct 17 ms 30860 KB Output is correct
12 Correct 17 ms 30844 KB Output is correct
13 Correct 16 ms 30932 KB Output is correct
14 Correct 17 ms 30936 KB Output is correct
15 Correct 16 ms 30984 KB Output is correct
16 Correct 17 ms 30996 KB Output is correct
17 Correct 21 ms 30928 KB Output is correct
18 Correct 19 ms 30968 KB Output is correct
19 Correct 45 ms 32460 KB Output is correct
20 Correct 49 ms 32676 KB Output is correct
21 Correct 57 ms 32920 KB Output is correct
22 Correct 65 ms 33356 KB Output is correct
23 Correct 108 ms 39944 KB Output is correct
24 Correct 144 ms 42804 KB Output is correct
25 Correct 179 ms 44480 KB Output is correct
26 Correct 210 ms 46576 KB Output is correct
27 Correct 22 ms 30804 KB Output is correct
28 Correct 20 ms 30864 KB Output is correct
29 Correct 21 ms 30804 KB Output is correct
30 Correct 48 ms 31068 KB Output is correct
31 Correct 110 ms 31432 KB Output is correct
32 Correct 21 ms 30804 KB Output is correct
33 Correct 17 ms 30996 KB Output is correct
34 Correct 17 ms 31124 KB Output is correct
35 Correct 20 ms 31132 KB Output is correct
36 Correct 41 ms 31316 KB Output is correct
37 Correct 149 ms 31696 KB Output is correct
38 Correct 28 ms 33156 KB Output is correct
39 Correct 28 ms 33144 KB Output is correct
40 Correct 39 ms 33260 KB Output is correct
41 Correct 57 ms 33468 KB Output is correct
42 Correct 191 ms 34076 KB Output is correct
43 Correct 267 ms 78744 KB Output is correct
44 Correct 296 ms 78860 KB Output is correct
45 Correct 373 ms 78952 KB Output is correct
46 Correct 444 ms 78976 KB Output is correct
47 Correct 703 ms 79408 KB Output is correct
48 Correct 32 ms 32928 KB Output is correct
49 Correct 68 ms 33244 KB Output is correct
50 Correct 205 ms 33492 KB Output is correct
51 Correct 397 ms 33804 KB Output is correct
52 Correct 174 ms 60848 KB Output is correct
53 Correct 240 ms 60960 KB Output is correct
54 Correct 616 ms 61272 KB Output is correct
55 Correct 1099 ms 61704 KB Output is correct
56 Correct 888 ms 210668 KB Output is correct
57 Correct 1020 ms 210660 KB Output is correct
58 Correct 1703 ms 210832 KB Output is correct
59 Correct 2345 ms 211176 KB Output is correct
60 Correct 2052 ms 415060 KB Output is correct
61 Correct 2161 ms 415120 KB Output is correct
62 Correct 2758 ms 415600 KB Output is correct
63 Correct 4191 ms 415824 KB Output is correct
64 Execution timed out 5100 ms 416076 KB Time limit exceeded
65 Halted 0 ms 0 KB -