oj.uz

Submission #855167

# Submission time Handle Problem Language Result Execution time Memory
855167 2023-09-30T11:24:45 Z mbfibat Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 574296 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

typedef pair<int, int> ii;

const LL INF = 2e18;
const int N = 1e5 + 11;

vector<ii> adj[N];

bool is_c[N];

int totChild = 0;
int nChild[N];
int parCentroid[N];
void cal_child(int u, int p = 0) {
	nChild[u] = 1;
	for (auto [v, w] : adj[u])
		if (!is_c[v] && v != p) {
			cal_child(v, u);
			nChild[u] += nChild[v];
		}	
}
int find_c(int u, int p = 0) {
	for (auto [v, w] : adj[u])
		if (v != p && !is_c[v] && nChild[v] > totChild / 2)
			return find_c(v, u);
	return u;	
}

unordered_map<int, LL> dist;

struct Node {
	LL val = 0, lazy = 0;
	Node* l = nullptr, *r = nullptr;
	Node(){}
};

Node* Seg[N];

void build(Node *cur, int l, int r) {
	if (l == r) {
		cur -> val = dist[l];
		return;
	}
	cur -> l = new Node();
	cur -> r = new Node();
	int mi = (l + r) / 2;
	build(cur -> l, l, mi);
	build(cur -> r, mi + 1, r);
	cur -> val = max(cur -> l -> val, cur -> r -> val);
}

void diffuse(Node *cur, int l, int r) {
	if (cur -> lazy) {
		cur -> val += cur -> lazy;
		if (l != r) {
			cur -> l -> lazy += cur -> lazy;
			cur -> r -> lazy += cur -> lazy;
		}
		cur -> lazy = 0;
	}
}

void upd(Node *cur, int l, int r, int L, int R, LL val) {
	diffuse(cur, l, r);
	if (r < L || R < l) return;
	if (L <= l && r <= R) {
		cur -> lazy += val;
		diffuse(cur, l, r);
		return;
	}

	int mi = (l + r) / 2;
	upd(cur -> l, l, mi, L, R, val);
	upd(cur -> r, mi + 1, r, L, R, val);
	cur -> val = max(cur -> l -> val, cur -> r -> val);
}

LL query(Node *cur, int l, int r, int L, int R) {
	diffuse(cur, l, r);
	if (r < L || R < l) return 0LL;
	if (L <= l && r <= R) return cur -> val;

	int mi = (l + r) / 2;
	LL val_l = query(cur -> l, l, mi, L, R);
	LL val_r = query(cur -> r, mi + 1, r, L, R);
	return max(val_l, val_r);
}

int cur_root;
unordered_map<int, int> top;
map<ii, int> st, ed;

multiset<LL> val_ms[N];
vector<pair<int, LL>> val_ord[N];

void dfs(int u, LL d = 0, int p = 0) {
	st[ii(cur_root, u)] = ++top[cur_root];
	dist[top[cur_root]] = d;

	for (auto [v, w] : adj[u]) {
		if (is_c[v] || v == p) continue;
		dfs(v, d + w, u);
	}
	ed[ii(cur_root, u)] = top[cur_root];
}

LL sol[N];
multiset<LL> ans;

void prep(int root) {
	cur_root = root;

	Seg[root] = new Node();
	dist[root] = 0;
	dfs(root);
	build(Seg[root], 1, top[root]);

	for (auto [v, w] : adj[root]) {
		if (is_c[v]) continue;

		int l = st[ii(root, v)], r = ed[ii(root, v)];
		LL val = query(Seg[root], 1, top[root], l, r);

		val_ms[root].insert(val);
		val_ord[root].emplace_back(l, val);
	}
	sort(val_ord[root].begin(), val_ord[root].end());

	val_ms[root].insert(0); val_ms[root].insert(0);
	val_ord[root].emplace_back(top[root] + 1, 0);

	auto it = val_ms[root].rbegin();
	LL v1 = *it; ++it; LL v2 = *it;
	sol[root] = v1 + v2; ans.insert(sol[root]);
}

void centroid_decompose(int u, int p = 0) {
	cal_child(u); totChild = nChild[u];
	int c = find_c(u);

	parCentroid[c] = p;
	prep(c);

	is_c[c] = true;
	for (auto [v, w] : adj[c])
		if (!is_c[v])
			centroid_decompose(v, c);
}

void upd_edge(int root, int u1, int u2, LL inc) {
	int u = ((st[ii(root, u1)] > st[ii(root, u2)]) ? u1 : u2);
	upd(Seg[root], 1, top[root], st[ii(root, u)], ed[ii(root, u)], inc);

	int p = upper_bound(val_ord[root].begin(), val_ord[root].end(), make_pair(st[ii(root, u)], INF)) - val_ord[root].begin() - 1;
	int l = val_ord[root][p].first, r = val_ord[root][p + 1].first - 1;

	LL old_val = val_ord[root][p].second;
	LL new_val = query(Seg[root], 1, top[root], l, r); 

	val_ms[root].erase(val_ms[root].find(old_val));
	val_ms[root].insert(new_val);
	val_ord[root][p].second = new_val;

	auto it = val_ms[root].rbegin();
	LL v1 = *it; ++it; LL v2 = *it;

	ans.erase(ans.find(sol[root]));
	sol[root] = v1 + v2; ans.insert(sol[root]);

	if (parCentroid[root])
		upd_edge(parCentroid[root], u1, u2, inc);
}

int32_t main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	int n, q; LL w; 
	cin >> n >> q >> w;

	vector<LL> W(n);
	vector<ii> edges;
	for (int i = 0; i < n - 1; i++) {
		int u, v; LL c; 
		cin >> u >> v >> c;

		W[i] = c;
		edges.emplace_back(u, v);

		adj[u].emplace_back(v, c);
		adj[v].emplace_back(u, c);
	}
	centroid_decompose(1);

	int last = 0;
	while (q--) {
		int d; LL e; 
		cin >> d >> e;
		d = (d + last) % (n - 1);
		e = (e + last) % w;		

		LL dif = e - W[d]; W[d] = e;

		auto [u, v] = edges[d];
		if (top[u] < top[v]) swap(u, v);

		upd_edge(u, u, v, dif);

		last = *ans.rbegin();
		cout << last << '\n';
	}

}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Correct 3 ms 12120 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 2 ms 12120 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 2 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12120 KB Output is correct
11 Correct 3 ms 12104 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 4 ms 12120 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 3 ms 12208 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 3 ms 12124 KB Output is correct
19 Correct 30 ms 13760 KB Output is correct
20 Correct 34 ms 13916 KB Output is correct
21 Correct 41 ms 14172 KB Output is correct
22 Correct 48 ms 14424 KB Output is correct
23 Correct 66 ms 21080 KB Output is correct
24 Correct 102 ms 23736 KB Output is correct
25 Correct 107 ms 24788 KB Output is correct
26 Correct 146 ms 26636 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 3 ms 12412 KB Output is correct
3 Correct 4 ms 12124 KB Output is correct
4 Correct 13 ms 12232 KB Output is correct
5 Correct 51 ms 12456 KB Output is correct
6 Correct 2 ms 12120 KB Output is correct
7 Correct 3 ms 12376 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 5 ms 12380 KB Output is correct
10 Correct 23 ms 12580 KB Output is correct
11 Correct 92 ms 12884 KB Output is correct
12 Correct 11 ms 15964 KB Output is correct
13 Correct 12 ms 15936 KB Output is correct
14 Correct 15 ms 16008 KB Output is correct
15 Correct 42 ms 15960 KB Output is correct
16 Correct 141 ms 16464 KB Output is correct
17 Correct 253 ms 89176 KB Output is correct
18 Correct 255 ms 89344 KB Output is correct
19 Correct 260 ms 89140 KB Output is correct
20 Correct 318 ms 89496 KB Output is correct
21 Correct 691 ms 89976 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14428 KB Output is correct
2 Correct 49 ms 14428 KB Output is correct
3 Correct 215 ms 14484 KB Output is correct
4 Correct 424 ms 14952 KB Output is correct
5 Correct 97 ms 40460 KB Output is correct
6 Correct 193 ms 40504 KB Output is correct
7 Correct 692 ms 40884 KB Output is correct
8 Correct 1236 ms 41048 KB Output is correct
9 Correct 486 ms 180084 KB Output is correct
10 Correct 712 ms 180208 KB Output is correct
11 Correct 1754 ms 180584 KB Output is correct
12 Correct 3075 ms 180620 KB Output is correct
13 Correct 1032 ms 369704 KB Output is correct
14 Correct 1341 ms 369764 KB Output is correct
15 Correct 2747 ms 370372 KB Output is correct
16 Correct 4429 ms 370324 KB Output is correct
17 Execution timed out 5043 ms 369924 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 1235 ms 574296 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Correct 3 ms 12120 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 2 ms 12120 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 2 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12120 KB Output is correct
11 Correct 3 ms 12104 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 4 ms 12120 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 3 ms 12208 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 3 ms 12124 KB Output is correct
19 Correct 30 ms 13760 KB Output is correct
20 Correct 34 ms 13916 KB Output is correct
21 Correct 41 ms 14172 KB Output is correct
22 Correct 48 ms 14424 KB Output is correct
23 Correct 66 ms 21080 KB Output is correct
24 Correct 102 ms 23736 KB Output is correct
25 Correct 107 ms 24788 KB Output is correct
26 Correct 146 ms 26636 KB Output is correct
27 Correct 3 ms 12120 KB Output is correct
28 Correct 3 ms 12412 KB Output is correct
29 Correct 4 ms 12124 KB Output is correct
30 Correct 13 ms 12232 KB Output is correct
31 Correct 51 ms 12456 KB Output is correct
32 Correct 2 ms 12120 KB Output is correct
33 Correct 3 ms 12376 KB Output is correct
34 Correct 3 ms 12380 KB Output is correct
35 Correct 5 ms 12380 KB Output is correct
36 Correct 23 ms 12580 KB Output is correct
37 Correct 92 ms 12884 KB Output is correct
38 Correct 11 ms 15964 KB Output is correct
39 Correct 12 ms 15936 KB Output is correct
40 Correct 15 ms 16008 KB Output is correct
41 Correct 42 ms 15960 KB Output is correct
42 Correct 141 ms 16464 KB Output is correct
43 Correct 253 ms 89176 KB Output is correct
44 Correct 255 ms 89344 KB Output is correct
45 Correct 260 ms 89140 KB Output is correct
46 Correct 318 ms 89496 KB Output is correct
47 Correct 691 ms 89976 KB Output is correct
48 Correct 12 ms 14428 KB Output is correct
49 Correct 49 ms 14428 KB Output is correct
50 Correct 215 ms 14484 KB Output is correct
51 Correct 424 ms 14952 KB Output is correct
52 Correct 97 ms 40460 KB Output is correct
53 Correct 193 ms 40504 KB Output is correct
54 Correct 692 ms 40884 KB Output is correct
55 Correct 1236 ms 41048 KB Output is correct
56 Correct 486 ms 180084 KB Output is correct
57 Correct 712 ms 180208 KB Output is correct
58 Correct 1754 ms 180584 KB Output is correct
59 Correct 3075 ms 180620 KB Output is correct
60 Correct 1032 ms 369704 KB Output is correct
61 Correct 1341 ms 369764 KB Output is correct
62 Correct 2747 ms 370372 KB Output is correct
63 Correct 4429 ms 370324 KB Output is correct
64 Execution timed out 5043 ms 369924 KB Time limit exceeded
65 Halted 0 ms 0 KB -