oj.uz

Submission #716485

# Submission time Handle Problem Language Result Execution time Memory
716485 2023-03-30T07:15:22 Z faribourz Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 928 ms 28876 KB 
// Only GOD
// Believe in yourself!
// -o Sango zadam be shishe 
// -o Comeback bezan hamishe!
 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
 
#define pb push_back
#define F first
#define S second
#define bit(x, y) (x >> y)&1
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define kill(x) return cout << x << '\n', void()
#define KILL(x) return cout << x << '\n', 0
#define int ll
#define mid ((l+r)>>1)
#define lid (id << 1)
#define rid (lid | 1)
const int N = 3e5+10;
const int INF = 1e9+10;
 
int n, q, W;
vector<pii> G[N];
int edge[N], dp[N], maxout[N], lst, h[N];
pii EDGE[N];
map<pii, int> E;
// chinese seg:)
void upd(int id){
	for(; id; id >>= 1){
		int mx1 = maxout[2*id] + E[{id, 2*id}], mx2 = maxout[2*id+1] + E[{id, 2*id+1}];
		maxout[id] = max(mx1, mx2);
		dp[id] = max({dp[lid], dp[rid], maxout[id], mx1+mx2, maxout[lid], maxout[rid]});
		lst = max({dp[id], lst, maxout[id]});
	}
}
void DFS(int v, int p = -1){
	int mx1 = 0, mx2 = 0;
	for(auto x : G[v]){
		if(x.F == p)
			continue;
		DFS(x.F, v);
		if(edge[x.S] + maxout[x.F] >= mx1){
			swap(mx1, mx2);
			mx1 = edge[x.S] + maxout[x.F]; 
		}
		else if(edge[x.S] + maxout[x.F] > mx2){
			mx2 = edge[x.S] + maxout[x.F]; 
		}
	}
	maxout[v] = mx1;
	dp[v] = mx1 + mx2;
}
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 v, u, w;
		cin >> v >> u >> w;
		G[v].pb({u, i});
		G[u].pb({v, i});
		edge[i] = w;
		if(u < v)
			swap(v, u);
		EDGE[i]={v, u};
		E[{v, u}]=w;
	}	
	lst = 0;
	if(n <= 5001 && q <= 5001){
		while(q--){
			int d, e;
			cin >> d >> e;
			edge[(d+lst)%(n-1)] = (e+lst)%W;
			DFS(1);
			lst = 0;
			for(int i = 1; i <= n; i++)
				lst = max({lst, dp[i], maxout[i]});
			cout << lst << '\n';
		}
	}
	else if(sz(G[1]) == n-1){
		set<pii , greater<pii>> s;
		for(int i = 0; i < n-1; i++){
			s.insert({edge[i], i});
		}
		while(q--){
			int d, e;
			cin >> d >> e;
			s.erase({edge[(d+lst)%(n-1)], (d+lst)%(n-1)});
			edge[(d+lst)%(n-1)] = (e+lst)%W;
			s.insert({edge[(d+lst)%(n-1)], (d+lst)%(n-1)});
			if(sz(s)==1){
				lst = (*s.begin()).F;
			}
			else{
				auto itr = s.begin();
				lst = (*itr).F;
				itr++;
				lst += (*itr).F;
			}
			cout << lst << '\n';
		}
	}
	else{
		DFS(1);
		while(q--){
			int d, e;
			cin >> d >> e;
			int v = EDGE[(d+lst)%(n-1)].F, u = EDGE[(d+lst)%(n-1)].S;
			if(u < v)
				swap(v, u);
			E[{v, u}] = (e+lst)%W;
			lst = 0;
			upd(v);
			cout << lst << '\n';
		}
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 6 ms 7380 KB Output is correct
6 Correct 4 ms 7276 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 6 ms 7380 KB Output is correct
13 Correct 6 ms 7380 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 6 ms 7372 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 100 ms 7532 KB Output is correct
20 Correct 99 ms 7520 KB Output is correct
21 Correct 96 ms 7544 KB Output is correct
22 Correct 115 ms 7700 KB Output is correct
23 Correct 721 ms 8168 KB Output is correct
24 Correct 789 ms 8156 KB Output is correct
25 Correct 791 ms 8264 KB Output is correct
26 Correct 928 ms 8500 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 10 ms 7380 KB Output is correct
5 Correct 40 ms 7796 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 6 ms 7364 KB Output is correct
9 Correct 15 ms 7380 KB Output is correct
10 Correct 13 ms 7504 KB Output is correct
11 Correct 48 ms 7852 KB Output is correct
12 Correct 8 ms 7960 KB Output is correct
13 Correct 16 ms 8020 KB Output is correct
14 Correct 105 ms 8060 KB Output is correct
15 Correct 20 ms 8404 KB Output is correct
16 Correct 63 ms 8620 KB Output is correct
17 Correct 112 ms 23728 KB Output is correct
18 Correct 102 ms 23744 KB Output is correct
19 Correct 107 ms 23820 KB Output is correct
20 Correct 118 ms 23876 KB Output is correct
21 Correct 263 ms 24380 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 7532 KB Output is correct
2 Correct 10 ms 7508 KB Output is correct
3 Correct 32 ms 7668 KB Output is correct
4 Correct 63 ms 8024 KB Output is correct
5 Correct 15 ms 8656 KB Output is correct
6 Incorrect 32 ms 8788 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 6 ms 7380 KB Output is correct
6 Correct 4 ms 7276 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 6 ms 7380 KB Output is correct
13 Correct 6 ms 7380 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 6 ms 7372 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 100 ms 7532 KB Output is correct
20 Correct 99 ms 7520 KB Output is correct
21 Correct 96 ms 7544 KB Output is correct
22 Correct 115 ms 7700 KB Output is correct
23 Correct 721 ms 8168 KB Output is correct
24 Correct 789 ms 8156 KB Output is correct
25 Correct 791 ms 8264 KB Output is correct
26 Correct 928 ms 8500 KB Output is correct
27 Correct 5 ms 7380 KB Output is correct
28 Correct 5 ms 7380 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 10 ms 7380 KB Output is correct
31 Correct 40 ms 7796 KB Output is correct
32 Correct 4 ms 7380 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 6 ms 7364 KB Output is correct
35 Correct 15 ms 7380 KB Output is correct
36 Correct 13 ms 7504 KB Output is correct
37 Correct 48 ms 7852 KB Output is correct
38 Correct 8 ms 7960 KB Output is correct
39 Correct 16 ms 8020 KB Output is correct
40 Correct 105 ms 8060 KB Output is correct
41 Correct 20 ms 8404 KB Output is correct
42 Correct 63 ms 8620 KB Output is correct
43 Correct 112 ms 23728 KB Output is correct
44 Correct 102 ms 23744 KB Output is correct
45 Correct 107 ms 23820 KB Output is correct
46 Correct 118 ms 23876 KB Output is correct
47 Correct 263 ms 24380 KB Output is correct
48 Correct 22 ms 7532 KB Output is correct
49 Correct 10 ms 7508 KB Output is correct
50 Correct 32 ms 7668 KB Output is correct
51 Correct 63 ms 8024 KB Output is correct
52 Correct 15 ms 8656 KB Output is correct
53 Incorrect 32 ms 8788 KB Output isn't correct
54 Halted 0 ms 0 KB -