oj.uz

Submission #716483

# Submission time Handle Problem Language Result Execution time Memory
716483 2023-03-30T07:11:07 Z faribourz Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 825 ms 24188 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 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;
set<pii , greater<pii>> ryan;
// chinese seg:)
void upd(int id){
	ryan.erase({maxout[id], id});
	ryan.erase({dp[id], id});
	int mx1 = maxout[lid] + E[{id, lid}], mx2 = maxout[rid] + E[{id, rid}];
	maxout[id] = max(mx1, mx2);
	dp[id] = max({mx1 + mx2, dp[lid], dp[rid], maxout[lid], maxout[rid], maxout[id]});
	ryan.insert({maxout[id], id});
	ryan.insert({dp[id], id});
	id >>= 1;
	for(; id; id >>= 1){
		mx1 = maxout[lid] + E[{id, lid}], mx2 = maxout[rid] + E[{id, rid}];
		ryan.erase({maxout[id], id});
		ryan.erase({dp[id], id});
		maxout[id] = max(mx1, mx2);
		dp[id] = max({mx1 + mx2, dp[lid], dp[rid], maxout[lid], maxout[rid], maxout[id]});
		ryan.insert({maxout[id], id});
		ryan.insert({dp[id], 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==-1 ? 0 : mx1);
	if(mx2 != -1){
		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;
			upd(v);
			lst = (*ryan.begin()).F;
			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 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 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 7396 KB Output is correct
17 Correct 5 ms 7380 KB Output is correct
18 Correct 4 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 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 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 7396 KB Output is correct
17 Correct 5 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 85 ms 7512 KB Output is correct
20 Correct 92 ms 7520 KB Output is correct
21 Correct 93 ms 7524 KB Output is correct
22 Correct 111 ms 7580 KB Output is correct
23 Correct 650 ms 7892 KB Output is correct
24 Correct 713 ms 8020 KB Output is correct
25 Correct 731 ms 8072 KB Output is correct
26 Correct 825 ms 8652 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 4 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 11 ms 7380 KB Output is correct
5 Correct 37 ms 7756 KB Output is correct
6 Correct 4 ms 7360 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 14 ms 7380 KB Output is correct
10 Correct 12 ms 7496 KB Output is correct
11 Correct 50 ms 7824 KB Output is correct
12 Correct 8 ms 7892 KB Output is correct
13 Correct 16 ms 7968 KB Output is correct
14 Correct 104 ms 8004 KB Output is correct
15 Correct 18 ms 8208 KB Output is correct
16 Correct 60 ms 8620 KB Output is correct
17 Correct 96 ms 23328 KB Output is correct
18 Correct 97 ms 23360 KB Output is correct
19 Correct 105 ms 23440 KB Output is correct
20 Correct 113 ms 23424 KB Output is correct
21 Correct 248 ms 24188 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 7516 KB Output is correct
2 Correct 31 ms 7508 KB Output is correct
3 Correct 128 ms 7792 KB Output is correct
4 Correct 251 ms 8012 KB Output is correct
5 Correct 19 ms 8676 KB Output is correct
6 Incorrect 94 ms 9072 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 62 ms 10476 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 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 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 7396 KB Output is correct
17 Correct 5 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 85 ms 7512 KB Output is correct
20 Correct 92 ms 7520 KB Output is correct
21 Correct 93 ms 7524 KB Output is correct
22 Correct 111 ms 7580 KB Output is correct
23 Correct 650 ms 7892 KB Output is correct
24 Correct 713 ms 8020 KB Output is correct
25 Correct 731 ms 8072 KB Output is correct
26 Correct 825 ms 8652 KB Output is correct
27 Correct 5 ms 7380 KB Output is correct
28 Correct 4 ms 7380 KB Output is correct
29 Correct 5 ms 7380 KB Output is correct
30 Correct 11 ms 7380 KB Output is correct
31 Correct 37 ms 7756 KB Output is correct
32 Correct 4 ms 7360 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 14 ms 7380 KB Output is correct
36 Correct 12 ms 7496 KB Output is correct
37 Correct 50 ms 7824 KB Output is correct
38 Correct 8 ms 7892 KB Output is correct
39 Correct 16 ms 7968 KB Output is correct
40 Correct 104 ms 8004 KB Output is correct
41 Correct 18 ms 8208 KB Output is correct
42 Correct 60 ms 8620 KB Output is correct
43 Correct 96 ms 23328 KB Output is correct
44 Correct 97 ms 23360 KB Output is correct
45 Correct 105 ms 23440 KB Output is correct
46 Correct 113 ms 23424 KB Output is correct
47 Correct 248 ms 24188 KB Output is correct
48 Correct 22 ms 7516 KB Output is correct
49 Correct 31 ms 7508 KB Output is correct
50 Correct 128 ms 7792 KB Output is correct
51 Correct 251 ms 8012 KB Output is correct
52 Correct 19 ms 8676 KB Output is correct
53 Incorrect 94 ms 9072 KB Output isn't correct
54 Halted 0 ms 0 KB -