oj.uz

Submission #716484

# Submission time Handle Problem Language Result Execution time Memory
716484 2023-03-30T07:12:12 Z ajab_01 Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 1710 ms 46972 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int N = 1e5 + 5;
vector<pair<pair<int , int> , int> > edge;
vector<pair<int , int> > g[N];
int dp[N] , val[N] , level[N] , d , e , n , q , w , last , star = -1;
bool ch = 1;
multiset<int , greater<int>> st;
priority_queue<pair<int , int>> pq;

void dfs(int ver , int par){
	for(auto i : g[ver]){
		int uu = i.first , ww = i.second;
		if(uu == par) continue;
		level[uu] = level[ver] + ww;
		dfs(uu , ver);
	}
}

void cal(){
	for(int i = 1 ; i <= n ; i++) g[i].clear();
	for(auto i : edge){
		int U = i.first.first , V = i.first.second , W = i.second;
		g[U].push_back({V , W});
		g[V].push_back({U , W});
	}

	dfs(1 , 0);

	int mx = 0 , vr = 1;

	for(int i = 1 ; i <= n ; i++){
		if(mx < level[i]){
			mx = level[i];
			vr = i;
		}
	}

	level[vr] = 0;

	dfs(vr , 0);

	mx = 0;
	for(int i = 1 ; i <= n ; i++)
		mx = max(mx , level[i]);

	cout << mx << '\n';
	last = mx;
	return;
}

void solve1(){
	while(q--){
		cin >> d >> e;
		d = (d + last) % (n - 1);
		e = (e + last) % w;
		pair<pair<int , int> , int> p;
		p = edge[d];
		p.second = e;
		swap(edge[d] , p);
		cal();
	}
}

void solve2(){
	for(auto i : edge)
		st.insert(i.second);
	while(q--){
		cin >> d >> e;
		d = (d + last) % (n - 1);
		e = (e + last) % w;
		st.erase(st.find(edge[d].second));
		pair<pair<int , int> , int> p;
		p = edge[d];
		p.second = e;
		swap(edge[d] , p);
		st.insert(e);
		last = *st.begin() + *next(st.begin());
		cout << last << '\n';
	}
}

void solve3(){
	for(int i = n / 2 ; i >= 1 ; i--){
		dp[i] = max(dp[i << 1] + val[i << 1] , dp[i << 1 | 1] + val[i << 1 | 1]);
		pq.push({dp[i << 1] + dp[i << 1 | 1] + val[i << 1] + val[i << 1 | 1] , i});
	}
	while(q--){
		cin >> d >> e;
		d = (d + last) % (n - 1);
		e = (e + last) % w;
		int ver = edge[d].first.second;
		val[ver] = e;
		while(ver != 1){
			ver >>= 1;
			dp[ver] = max(dp[ver << 1] + val[ver << 1] , dp[ver <<  1 | 1] + val[ver << 1 | 1]);
			pq.push({dp[ver << 1] + dp[ver << 1 | 1] + val[ver << 1] + val[ver << 1 | 1] , ver});
		}
		while(!pq.empty()){
			pair<int , int> p = pq.top();
			int vl = p.first , vr = p.second;
			if(dp[vr << 1] + dp[vr << 1 | 1] + val[vr << 1] + val[vr << 1 | 1] == vl) break;
			pq.pop();
		}
		last = pq.top().first;
		cout << last << '\n';
	}
}

int32_t main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> q >> w;
	for(int i = 0 ; i < n - 1 ; i++){
		int U , V , W;
		cin >> U >> V >> W;
		g[U].push_back({V , W});
		g[V].push_back({U , W});
		if(U > V) swap(U , V);
		edge.push_back({{U , V} , W});
		if(g[U].size() == n - 1) star = U;
		if(g[V].size() == n - 1) star = V;
		if(abs(V - 2 * U) > 1) ch = 0;
		val[V] = W;
	}
	if(n <= 5000 && q <= 5000){
	  	solve1();
	 	return 0;
	}
	if(star != -1){
		solve2();
		return 0;
	}
	if(ch){
		solve3();
		return 0;
	}
	return 0;
}

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:123:18: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  123 |   if(g[U].size() == n - 1) star = U;
      |      ~~~~~~~~~~~~^~~~~~~~
diameter.cpp:124:18: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  124 |   if(g[V].size() == n - 1) star = V;
      |      ~~~~~~~~~~~~^~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 261 ms 2892 KB Output is correct
20 Correct 240 ms 2780 KB Output is correct
21 Correct 248 ms 2784 KB Output is correct
22 Correct 253 ms 2828 KB Output is correct
23 Correct 1543 ms 3332 KB Output is correct
24 Correct 1672 ms 3340 KB Output is correct
25 Correct 1698 ms 3356 KB Output is correct
26 Correct 1710 ms 3356 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 4 ms 2644 KB Output is correct
4 Correct 8 ms 2708 KB Output is correct
5 Correct 31 ms 3028 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 5 ms 2732 KB Output is correct
9 Correct 36 ms 2644 KB Output is correct
10 Correct 8 ms 2744 KB Output is correct
11 Correct 36 ms 3156 KB Output is correct
12 Correct 3 ms 3284 KB Output is correct
13 Correct 4 ms 3284 KB Output is correct
14 Correct 5 ms 3284 KB Output is correct
15 Correct 12 ms 3416 KB Output is correct
16 Correct 45 ms 3724 KB Output is correct
17 Correct 88 ms 15144 KB Output is correct
18 Correct 57 ms 15184 KB Output is correct
19 Correct 56 ms 15188 KB Output is correct
20 Correct 73 ms 15312 KB Output is correct
21 Correct 176 ms 15800 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 2772 KB Output is correct
2 Correct 9 ms 3408 KB Output is correct
3 Correct 36 ms 5064 KB Output is correct
4 Correct 82 ms 7268 KB Output is correct
5 Correct 8 ms 3984 KB Output is correct
6 Correct 18 ms 4876 KB Output is correct
7 Correct 54 ms 8200 KB Output is correct
8 Correct 95 ms 12556 KB Output is correct
9 Correct 19 ms 8152 KB Output is correct
10 Correct 29 ms 10264 KB Output is correct
11 Correct 67 ms 12408 KB Output is correct
12 Correct 128 ms 16796 KB Output is correct
13 Correct 41 ms 13500 KB Output is correct
14 Correct 45 ms 15220 KB Output is correct
15 Correct 93 ms 17956 KB Output is correct
16 Correct 163 ms 22156 KB Output is correct
17 Correct 140 ms 46972 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 10924 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 261 ms 2892 KB Output is correct
20 Correct 240 ms 2780 KB Output is correct
21 Correct 248 ms 2784 KB Output is correct
22 Correct 253 ms 2828 KB Output is correct
23 Correct 1543 ms 3332 KB Output is correct
24 Correct 1672 ms 3340 KB Output is correct
25 Correct 1698 ms 3356 KB Output is correct
26 Correct 1710 ms 3356 KB Output is correct
27 Correct 1 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 4 ms 2644 KB Output is correct
30 Correct 8 ms 2708 KB Output is correct
31 Correct 31 ms 3028 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 5 ms 2732 KB Output is correct
35 Correct 36 ms 2644 KB Output is correct
36 Correct 8 ms 2744 KB Output is correct
37 Correct 36 ms 3156 KB Output is correct
38 Correct 3 ms 3284 KB Output is correct
39 Correct 4 ms 3284 KB Output is correct
40 Correct 5 ms 3284 KB Output is correct
41 Correct 12 ms 3416 KB Output is correct
42 Correct 45 ms 3724 KB Output is correct
43 Correct 88 ms 15144 KB Output is correct
44 Correct 57 ms 15184 KB Output is correct
45 Correct 56 ms 15188 KB Output is correct
46 Correct 73 ms 15312 KB Output is correct
47 Correct 176 ms 15800 KB Output is correct
48 Correct 37 ms 2772 KB Output is correct
49 Correct 9 ms 3408 KB Output is correct
50 Correct 36 ms 5064 KB Output is correct
51 Correct 82 ms 7268 KB Output is correct
52 Correct 8 ms 3984 KB Output is correct
53 Correct 18 ms 4876 KB Output is correct
54 Correct 54 ms 8200 KB Output is correct
55 Correct 95 ms 12556 KB Output is correct
56 Correct 19 ms 8152 KB Output is correct
57 Correct 29 ms 10264 KB Output is correct
58 Correct 67 ms 12408 KB Output is correct
59 Correct 128 ms 16796 KB Output is correct
60 Correct 41 ms 13500 KB Output is correct
61 Correct 45 ms 15220 KB Output is correct
62 Correct 93 ms 17956 KB Output is correct
63 Correct 163 ms 22156 KB Output is correct
64 Correct 140 ms 46972 KB Output is correct
65 Incorrect 63 ms 10924 KB Output isn't correct
66 Halted 0 ms 0 KB -