oj.uz

Submission #854243

# Submission time Handle Problem Language Result Execution time Memory
854243 2023-09-26T13:10:55 Z daoquanglinh2007 Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 438208 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pil pair <int, ll>
#define fi first
#define se second
#define mp make_pair
#define isz(a) (int)(a).size()

const int NM = 1e5;

int n, q;
ll w, last = 0;
int a[NM+1], b[NM+1];
ll c[NM+1];
vector <pil> adj[NM+1];
int sz[NM+1], parent_cen[NM+1], sub[NM+1];
bool del[NM+1];
int timer;
unordered_map <int, int> tin[NM+1], tout[NM+1], f[NM+1];
unordered_map <int, ll> d[NM+1];
vector <int> tour[NM+1];
vector <ll> st[NM+1], lazy[NM+1];
multiset <ll, greater <ll> > S[NM+1];
multiset <ll, greater <ll> > diam;
unordered_map <int, bool> modified;

void dfs_sz(int u, int par){
	sz[u] = 1;
	int v;
	for (int i = 0; i < isz(adj[u]); i++){
		v = adj[u][i].fi;
		if (v == par || del[v]) continue;
		dfs_sz(v, u);
		sz[u] += sz[v];
	}
}

int dfs_fc(int rt, int u, int par){
	int v;
	for (int i = 0; i < isz(adj[u]); i++){
		v = adj[u][i].fi;
		if (v == par || del[v]) continue;
		if (sz[v] > sz[rt]/2) return dfs_fc(rt, v, u);
	}
	return u;
}

void dfs(int rt, int u, int par){
	tin[rt][u] = ++timer;
	tour[rt].push_back(u);
	int v; ll c;
	for (int i = 0; i < isz(adj[u]); i++){
		v = adj[u][i].fi;
		c = adj[u][i].se;
		if (v == par || del[v]) continue;
		d[rt][v] = d[rt][u]+c;
		dfs(rt, v, u);
	}
	tout[rt][u] = timer;
}

void build(int rt, int id, int l, int r){
	lazy[rt][id] = 0LL;
	if (l == r){
		st[rt][id] = d[rt][tour[rt][l]];
		return;
	}
	int mid = (l+r)/2;
	build(rt, 2*id, l, mid);
	build(rt, 2*id+1, mid+1, r);
	st[rt][id] = max(st[rt][2*id], st[rt][2*id+1]);
}

void down(int rt, int id){
	st[rt][2*id] += lazy[rt][id], st[rt][2*id+1] += lazy[rt][id];
	lazy[rt][2*id] += lazy[rt][id], lazy[rt][2*id+1] += lazy[rt][id];
	lazy[rt][id] = 0LL;
}

void update(int rt, int id, int l, int r, int u, int v, ll val){
	if (v < l || u > r) return;
	if (l >= u && r <= v){
		st[rt][id] += val;
		lazy[rt][id] += val;
		return;
	}
	down(rt, id);
	int mid = (l+r)/2;
	update(rt, 2*id, l, mid, u, v, val);
	update(rt, 2*id+1, mid+1, r, u, v, val);
	st[rt][id] = max(st[rt][2*id], st[rt][2*id+1]);
}

ll get(int rt, int id, int l, int r, int u, int v){
	if (v < l || u > r) return 0LL;
	if (l >= u && r <= v) return st[rt][id];
	down(rt, id);
	int mid = (l+r)/2;
	return max(get(rt, 2*id, l, mid, u, v), get(rt, 2*id+1, mid+1, r, u, v));
}

ll get_diam(int rt){
	if (S[rt].empty()) return 0LL;
	if (isz(S[rt]) == 1) return *S[rt].begin();
	return *S[rt].begin() + *(++S[rt].begin());
}

void centroid_dec(int u, int par){
	dfs_sz(u, -1);
	int pre_u = u;
	u = dfs_fc(u, u, -1);
	parent_cen[u] = par;
	sub[u] = sz[pre_u];
	del[u] = 1;
	
	d[u][u] = 0LL;
	timer = 0;
	tour[u].push_back(0);
	dfs(u, u, -1);
	int cur = tour[u][2];
	int i;
	for (i = 2; i <= sub[u]; i++){
		if (i > tout[u][cur]) cur = tour[u][i];
		f[u][tour[u][i]] = cur;
	}
	
	st[u].resize(4*sub[u]);
	lazy[u].resize(4*sub[u]);
	build(u, 1, 1, sub[u]);
	int v;
	for (i = 0; i < isz(adj[u]); i++){
		v = adj[u][i].fi;
		if (del[v]) continue;
		S[u].insert(get(u, 1, 1, sub[u], tin[u][v], tout[u][v]));
	}
	diam.insert(get_diam(u));
	
	for (i = 0; i < isz(adj[u]); i++){
		v = adj[u][i].fi;
		if (del[v]) continue;
		centroid_dec(v, u);
	}
}

void modify(int rt, int u, int v, ll x){
	if (rt == -1 || modified[rt]) return;
	if (tin[rt].count(u) && tin[rt].count(v)){
		modified[rt] = 1;
		if (tin[rt][u] > tin[rt][v]) swap(u, v);
		int l = tin[rt][f[rt][v]], r = tout[rt][f[rt][v]];
		diam.erase(diam.find(get_diam(rt)));
		S[rt].erase(S[rt].find(get(rt, 1, 1, sub[rt], l, r)));
		update(rt, 1, 1, sub[rt], tin[rt][v], tout[rt][v], x);
		S[rt].insert(get(rt, 1, 1, sub[rt], l, r));
		diam.insert(get_diam(rt));
	}
	modify(parent_cen[rt], u, v, x);
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> q >> w;
	for (int i = 1; i < n; i++){
		cin >> a[i] >> b[i] >> c[i];
		adj[a[i]].push_back(mp(b[i], c[i]));
		adj[b[i]].push_back(mp(a[i], c[i]));
	}
	centroid_dec(1, -1);
	while (q--){
		int d;
		ll e;
		cin >> d >> e;
		d = ((ll)d+last)%(n-1)+1;
		e = (e+last) % w;
		modified.clear();
		modify(a[d], a[d], b[d], e-c[d]);
		modify(b[d], a[d], b[d], e-c[d]);
		c[d] = e;
		last = *diam.begin();
		cout << last << '\n';
	}
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 37720 KB Output is correct
2 Correct 10 ms 37724 KB Output is correct
3 Correct 9 ms 37724 KB Output is correct
4 Correct 10 ms 37744 KB Output is correct
5 Correct 9 ms 37724 KB Output is correct
6 Correct 10 ms 37768 KB Output is correct
7 Correct 11 ms 37724 KB Output is correct
8 Correct 10 ms 37724 KB Output is correct
9 Correct 13 ms 37720 KB Output is correct
10 Correct 10 ms 37724 KB Output is correct
11 Correct 10 ms 37828 KB Output is correct
12 Correct 11 ms 37804 KB Output is correct
13 Correct 10 ms 37720 KB Output is correct
14 Correct 10 ms 37800 KB Output is correct
15 Correct 10 ms 37720 KB Output is correct
16 Correct 10 ms 37720 KB Output is correct
17 Correct 12 ms 38232 KB Output is correct
18 Correct 10 ms 37720 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 37720 KB Output is correct
2 Correct 10 ms 37724 KB Output is correct
3 Correct 9 ms 37724 KB Output is correct
4 Correct 10 ms 37744 KB Output is correct
5 Correct 9 ms 37724 KB Output is correct
6 Correct 10 ms 37768 KB Output is correct
7 Correct 11 ms 37724 KB Output is correct
8 Correct 10 ms 37724 KB Output is correct
9 Correct 13 ms 37720 KB Output is correct
10 Correct 10 ms 37724 KB Output is correct
11 Correct 10 ms 37828 KB Output is correct
12 Correct 11 ms 37804 KB Output is correct
13 Correct 10 ms 37720 KB Output is correct
14 Correct 10 ms 37800 KB Output is correct
15 Correct 10 ms 37720 KB Output is correct
16 Correct 10 ms 37720 KB Output is correct
17 Correct 12 ms 38232 KB Output is correct
18 Correct 10 ms 37720 KB Output is correct
19 Correct 32 ms 39552 KB Output is correct
20 Correct 33 ms 39772 KB Output is correct
21 Correct 40 ms 40016 KB Output is correct
22 Correct 42 ms 40284 KB Output is correct
23 Correct 69 ms 48160 KB Output is correct
24 Correct 81 ms 50512 KB Output is correct
25 Correct 91 ms 52268 KB Output is correct
26 Correct 101 ms 54144 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 37720 KB Output is correct
2 Correct 10 ms 37724 KB Output is correct
3 Correct 11 ms 37720 KB Output is correct
4 Correct 22 ms 37980 KB Output is correct
5 Correct 67 ms 38908 KB Output is correct
6 Correct 10 ms 37720 KB Output is correct
7 Correct 10 ms 38236 KB Output is correct
8 Correct 10 ms 38228 KB Output is correct
9 Correct 13 ms 38236 KB Output is correct
10 Correct 28 ms 38480 KB Output is correct
11 Correct 90 ms 39504 KB Output is correct
12 Correct 19 ms 42332 KB Output is correct
13 Correct 20 ms 42332 KB Output is correct
14 Correct 22 ms 42368 KB Output is correct
15 Correct 40 ms 42588 KB Output is correct
16 Correct 125 ms 43860 KB Output is correct
17 Correct 248 ms 133892 KB Output is correct
18 Correct 238 ms 133892 KB Output is correct
19 Correct 249 ms 133824 KB Output is correct
20 Correct 296 ms 134336 KB Output is correct
21 Correct 537 ms 135788 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 40028 KB Output is correct
2 Correct 44 ms 40204 KB Output is correct
3 Correct 168 ms 40532 KB Output is correct
4 Correct 326 ms 41516 KB Output is correct
5 Correct 92 ms 68720 KB Output is correct
6 Correct 175 ms 69080 KB Output is correct
7 Correct 454 ms 69456 KB Output is correct
8 Correct 798 ms 70448 KB Output is correct
9 Correct 534 ms 221652 KB Output is correct
10 Correct 645 ms 221836 KB Output is correct
11 Correct 1229 ms 222480 KB Output is correct
12 Correct 1994 ms 223448 KB Output is correct
13 Correct 1176 ms 429152 KB Output is correct
14 Correct 1364 ms 429300 KB Output is correct
15 Correct 2108 ms 430084 KB Output is correct
16 Correct 3080 ms 430788 KB Output is correct
17 Execution timed out 5036 ms 430480 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4517 ms 347412 KB Output is correct
2 Correct 4334 ms 356444 KB Output is correct
3 Correct 4258 ms 354524 KB Output is correct
4 Correct 4341 ms 359952 KB Output is correct
5 Correct 4237 ms 339172 KB Output is correct
6 Correct 3695 ms 253560 KB Output is correct
7 Execution timed out 5025 ms 438208 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 37720 KB Output is correct
2 Correct 10 ms 37724 KB Output is correct
3 Correct 9 ms 37724 KB Output is correct
4 Correct 10 ms 37744 KB Output is correct
5 Correct 9 ms 37724 KB Output is correct
6 Correct 10 ms 37768 KB Output is correct
7 Correct 11 ms 37724 KB Output is correct
8 Correct 10 ms 37724 KB Output is correct
9 Correct 13 ms 37720 KB Output is correct
10 Correct 10 ms 37724 KB Output is correct
11 Correct 10 ms 37828 KB Output is correct
12 Correct 11 ms 37804 KB Output is correct
13 Correct 10 ms 37720 KB Output is correct
14 Correct 10 ms 37800 KB Output is correct
15 Correct 10 ms 37720 KB Output is correct
16 Correct 10 ms 37720 KB Output is correct
17 Correct 12 ms 38232 KB Output is correct
18 Correct 10 ms 37720 KB Output is correct
19 Correct 32 ms 39552 KB Output is correct
20 Correct 33 ms 39772 KB Output is correct
21 Correct 40 ms 40016 KB Output is correct
22 Correct 42 ms 40284 KB Output is correct
23 Correct 69 ms 48160 KB Output is correct
24 Correct 81 ms 50512 KB Output is correct
25 Correct 91 ms 52268 KB Output is correct
26 Correct 101 ms 54144 KB Output is correct
27 Correct 11 ms 37720 KB Output is correct
28 Correct 10 ms 37724 KB Output is correct
29 Correct 11 ms 37720 KB Output is correct
30 Correct 22 ms 37980 KB Output is correct
31 Correct 67 ms 38908 KB Output is correct
32 Correct 10 ms 37720 KB Output is correct
33 Correct 10 ms 38236 KB Output is correct
34 Correct 10 ms 38228 KB Output is correct
35 Correct 13 ms 38236 KB Output is correct
36 Correct 28 ms 38480 KB Output is correct
37 Correct 90 ms 39504 KB Output is correct
38 Correct 19 ms 42332 KB Output is correct
39 Correct 20 ms 42332 KB Output is correct
40 Correct 22 ms 42368 KB Output is correct
41 Correct 40 ms 42588 KB Output is correct
42 Correct 125 ms 43860 KB Output is correct
43 Correct 248 ms 133892 KB Output is correct
44 Correct 238 ms 133892 KB Output is correct
45 Correct 249 ms 133824 KB Output is correct
46 Correct 296 ms 134336 KB Output is correct
47 Correct 537 ms 135788 KB Output is correct
48 Correct 18 ms 40028 KB Output is correct
49 Correct 44 ms 40204 KB Output is correct
50 Correct 168 ms 40532 KB Output is correct
51 Correct 326 ms 41516 KB Output is correct
52 Correct 92 ms 68720 KB Output is correct
53 Correct 175 ms 69080 KB Output is correct
54 Correct 454 ms 69456 KB Output is correct
55 Correct 798 ms 70448 KB Output is correct
56 Correct 534 ms 221652 KB Output is correct
57 Correct 645 ms 221836 KB Output is correct
58 Correct 1229 ms 222480 KB Output is correct
59 Correct 1994 ms 223448 KB Output is correct
60 Correct 1176 ms 429152 KB Output is correct
61 Correct 1364 ms 429300 KB Output is correct
62 Correct 2108 ms 430084 KB Output is correct
63 Correct 3080 ms 430788 KB Output is correct
64 Execution timed out 5036 ms 430480 KB Time limit exceeded
65 Halted 0 ms 0 KB -