oj.uz

Submission #856238

# Submission time Handle Problem Language Result Execution time Memory
856238 2023-10-02T21:15:25 Z mbfibat Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 228 ms 83404 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 5e5 + 11;

typedef pair<int, int> ii;

int n, q, w;
int a[N];
int cost[N];
ii E[N];
vector<int> adj[N], pos[N];

int top = 0;
void dfs(int u, int id_edge, int p = 0) {
	for (int id : adj[u]) {
		int x = E[id].first, y = E[id].second;
		if (x == u) swap(x, y);
		if (x == p) continue;

		a[++top] = cost[id];
		pos[id].push_back(top);
		dfs(x, id, u);
	}
	if (p) {
		a[++top] = -cost[id_edge];
		pos[id_edge].push_back(top);
	}
}

struct Node {
	int pfix, sfix; // pfix get maximum prefix sum, sfix get maximum -suffix sum
	int ans_pre, ans_suf; // f but ans_pre touch left, ans_suf touch right
	int all; // f but touch left and touch right
	int sum, f;
	Node(){}
};

Node Seg[4 * N];

void merge(int node) {	
	Seg[node].pfix = max(Seg[node * 2].pfix, Seg[node * 2].sum + Seg[node * 2 + 1].pfix);
	Seg[node].sfix = max(Seg[node * 2 + 1].sfix, -Seg[node * 2 + 1].sum + Seg[node * 2].sfix);

	Seg[node].sum = Seg[node * 2].sum + Seg[node * 2 + 1].sum;

	Seg[node].all = max(Seg[node * 2].all + Seg[node * 2 + 1].sum, -Seg[node * 2].sum + Seg[node * 2 + 1].all);

	Seg[node].ans_pre = max(max(Seg[node * 2].ans_pre, Seg[node * 2].all + Seg[node * 2 + 1].pfix), -Seg[node * 2].sum + Seg[node * 2 + 1].ans_pre);
	Seg[node].ans_suf = max(max(Seg[node * 2 + 1].ans_suf, Seg[node * 2 + 1].all + Seg[node * 2].sfix), Seg[node * 2 + 1].sum + Seg[node * 2].ans_suf);

	Seg[node].f = max(Seg[node * 2].f, Seg[node * 2 + 1].f);
	Seg[node].f = max(Seg[node].f, Seg[node * 2].ans_suf + Seg[node * 2 + 1].pfix);
	Seg[node].f = max(Seg[node].f, Seg[node * 2].sfix + Seg[node * 2 + 1].ans_pre);
}

void build(int node, int l, int r) {
	if (l == r) {
		Seg[node].pfix = max(0LL, a[l]); Seg[node].sfix = max(0LL, -a[l]);
		Seg[node].f = Seg[node].ans_pre = Seg[node].ans_suf = Seg[node].all = abs(a[l]);
		Seg[node].sum = a[l];
		return;		
	}

	int mi = (l + r) / 2;
	build(node * 2, l, mi);
	build(node * 2 + 1, mi + 1, r);

	merge(node);
}

void upd(int node, int l, int r, int pos) {
	if (l == r) {
		Seg[node].pfix = max(0LL, a[l]); Seg[node].sfix = max(0LL, -a[l]);
		Seg[node].f = Seg[node].ans_pre = Seg[node].ans_suf = Seg[node].all = abs(a[l]);
		Seg[node].sum = a[l];
		return;		
	}

	int mi = (l + r) / 2;
	if (pos <= mi) upd(node * 2, l, mi, pos);
	else upd(node * 2 + 1, mi + 1, r, pos);

	merge(node);
}

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

	cin >> n >> q >> w;
	for (int i = 0; i < n - 1; i++) {
		int u, v; 
		cin >> u >> v >> cost[i];
		E[i] = ii(u, v);

		adj[u].emplace_back(i);		
		adj[v].emplace_back(i);		
	}
	dfs(1, -1);

	build(1, 1, 2 * (n - 1));

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

  		a[pos[d][0]] = e;
  		upd(1, 1, 2 * (n - 1), pos[d][0]);
  		a[pos[d][1]] = -e;
  		upd(1, 1, 2 * (n - 1), pos[d][1]);

  		last = Seg[1].f;
		cout << last << '\n';
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29016 KB Output is correct
2 Correct 5 ms 29020 KB Output is correct
3 Correct 5 ms 29188 KB Output is correct
4 Correct 6 ms 29020 KB Output is correct
5 Correct 6 ms 29020 KB Output is correct
6 Correct 6 ms 29016 KB Output is correct
7 Correct 5 ms 29020 KB Output is correct
8 Correct 6 ms 29020 KB Output is correct
9 Correct 6 ms 29020 KB Output is correct
10 Correct 6 ms 29140 KB Output is correct
11 Correct 5 ms 29020 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 6 ms 29020 KB Output is correct
14 Correct 7 ms 29016 KB Output is correct
15 Correct 6 ms 29020 KB Output is correct
16 Correct 6 ms 29224 KB Output is correct
17 Correct 6 ms 29020 KB Output is correct
18 Correct 5 ms 29020 KB Output is correct
19 Correct 9 ms 31508 KB Output is correct
20 Correct 9 ms 31524 KB Output is correct
21 Correct 8 ms 31504 KB Output is correct
22 Correct 9 ms 31324 KB Output is correct
23 Correct 11 ms 31668 KB Output is correct
24 Correct 11 ms 31580 KB Output is correct
25 Correct 11 ms 31836 KB Output is correct
26 Correct 11 ms 32092 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 29148 KB Output is correct
2 Correct 5 ms 29020 KB Output is correct
3 Correct 6 ms 29020 KB Output is correct
4 Correct 11 ms 29128 KB Output is correct
5 Correct 33 ms 29432 KB Output is correct
6 Correct 5 ms 29016 KB Output is correct
7 Correct 6 ms 29272 KB Output is correct
8 Correct 7 ms 29276 KB Output is correct
9 Correct 8 ms 29276 KB Output is correct
10 Correct 18 ms 29628 KB Output is correct
11 Correct 45 ms 29612 KB Output is correct
12 Correct 7 ms 31576 KB Output is correct
13 Correct 7 ms 31580 KB Output is correct
14 Correct 9 ms 31704 KB Output is correct
15 Correct 18 ms 32036 KB Output is correct
16 Correct 57 ms 32196 KB Output is correct
17 Correct 38 ms 69224 KB Output is correct
18 Correct 40 ms 69072 KB Output is correct
19 Correct 40 ms 69060 KB Output is correct
20 Correct 54 ms 69316 KB Output is correct
21 Correct 137 ms 69828 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31320 KB Output is correct
2 Correct 12 ms 31516 KB Output is correct
3 Correct 28 ms 31580 KB Output is correct
4 Correct 48 ms 31836 KB Output is correct
5 Correct 10 ms 34140 KB Output is correct
6 Correct 15 ms 34020 KB Output is correct
7 Correct 36 ms 34416 KB Output is correct
8 Correct 61 ms 34636 KB Output is correct
9 Correct 31 ms 49236 KB Output is correct
10 Correct 32 ms 49244 KB Output is correct
11 Correct 59 ms 49396 KB Output is correct
12 Correct 88 ms 49684 KB Output is correct
13 Correct 44 ms 69204 KB Output is correct
14 Correct 51 ms 69052 KB Output is correct
15 Correct 80 ms 69456 KB Output is correct
16 Correct 117 ms 69644 KB Output is correct
17 Correct 145 ms 69712 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 74580 KB Output is correct
2 Correct 171 ms 74432 KB Output is correct
3 Correct 171 ms 74664 KB Output is correct
4 Correct 172 ms 74668 KB Output is correct
5 Correct 192 ms 74664 KB Output is correct
6 Correct 147 ms 74696 KB Output is correct
7 Correct 184 ms 77908 KB Output is correct
8 Correct 175 ms 77904 KB Output is correct
9 Correct 182 ms 78112 KB Output is correct
10 Correct 198 ms 77908 KB Output is correct
11 Correct 176 ms 77904 KB Output is correct
12 Correct 176 ms 77200 KB Output is correct
13 Correct 228 ms 83324 KB Output is correct
14 Correct 188 ms 83280 KB Output is correct
15 Correct 186 ms 83228 KB Output is correct
16 Correct 184 ms 83284 KB Output is correct
17 Correct 211 ms 82508 KB Output is correct
18 Correct 185 ms 79304 KB Output is correct
19 Correct 200 ms 83280 KB Output is correct
20 Correct 184 ms 83132 KB Output is correct
21 Correct 208 ms 83404 KB Output is correct
22 Correct 185 ms 83284 KB Output is correct
23 Correct 200 ms 82488 KB Output is correct
24 Correct 154 ms 79188 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29016 KB Output is correct
2 Correct 5 ms 29020 KB Output is correct
3 Correct 5 ms 29188 KB Output is correct
4 Correct 6 ms 29020 KB Output is correct
5 Correct 6 ms 29020 KB Output is correct
6 Correct 6 ms 29016 KB Output is correct
7 Correct 5 ms 29020 KB Output is correct
8 Correct 6 ms 29020 KB Output is correct
9 Correct 6 ms 29020 KB Output is correct
10 Correct 6 ms 29140 KB Output is correct
11 Correct 5 ms 29020 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 6 ms 29020 KB Output is correct
14 Correct 7 ms 29016 KB Output is correct
15 Correct 6 ms 29020 KB Output is correct
16 Correct 6 ms 29224 KB Output is correct
17 Correct 6 ms 29020 KB Output is correct
18 Correct 5 ms 29020 KB Output is correct
19 Correct 9 ms 31508 KB Output is correct
20 Correct 9 ms 31524 KB Output is correct
21 Correct 8 ms 31504 KB Output is correct
22 Correct 9 ms 31324 KB Output is correct
23 Correct 11 ms 31668 KB Output is correct
24 Correct 11 ms 31580 KB Output is correct
25 Correct 11 ms 31836 KB Output is correct
26 Correct 11 ms 32092 KB Output is correct
27 Correct 5 ms 29148 KB Output is correct
28 Correct 5 ms 29020 KB Output is correct
29 Correct 6 ms 29020 KB Output is correct
30 Correct 11 ms 29128 KB Output is correct
31 Correct 33 ms 29432 KB Output is correct
32 Correct 5 ms 29016 KB Output is correct
33 Correct 6 ms 29272 KB Output is correct
34 Correct 7 ms 29276 KB Output is correct
35 Correct 8 ms 29276 KB Output is correct
36 Correct 18 ms 29628 KB Output is correct
37 Correct 45 ms 29612 KB Output is correct
38 Correct 7 ms 31576 KB Output is correct
39 Correct 7 ms 31580 KB Output is correct
40 Correct 9 ms 31704 KB Output is correct
41 Correct 18 ms 32036 KB Output is correct
42 Correct 57 ms 32196 KB Output is correct
43 Correct 38 ms 69224 KB Output is correct
44 Correct 40 ms 69072 KB Output is correct
45 Correct 40 ms 69060 KB Output is correct
46 Correct 54 ms 69316 KB Output is correct
47 Correct 137 ms 69828 KB Output is correct
48 Correct 7 ms 31320 KB Output is correct
49 Correct 12 ms 31516 KB Output is correct
50 Correct 28 ms 31580 KB Output is correct
51 Correct 48 ms 31836 KB Output is correct
52 Correct 10 ms 34140 KB Output is correct
53 Correct 15 ms 34020 KB Output is correct
54 Correct 36 ms 34416 KB Output is correct
55 Correct 61 ms 34636 KB Output is correct
56 Correct 31 ms 49236 KB Output is correct
57 Correct 32 ms 49244 KB Output is correct
58 Correct 59 ms 49396 KB Output is correct
59 Correct 88 ms 49684 KB Output is correct
60 Correct 44 ms 69204 KB Output is correct
61 Correct 51 ms 69052 KB Output is correct
62 Correct 80 ms 69456 KB Output is correct
63 Correct 117 ms 69644 KB Output is correct
64 Correct 145 ms 69712 KB Output is correct
65 Correct 174 ms 74580 KB Output is correct
66 Correct 171 ms 74432 KB Output is correct
67 Correct 171 ms 74664 KB Output is correct
68 Correct 172 ms 74668 KB Output is correct
69 Correct 192 ms 74664 KB Output is correct
70 Correct 147 ms 74696 KB Output is correct
71 Correct 184 ms 77908 KB Output is correct
72 Correct 175 ms 77904 KB Output is correct
73 Correct 182 ms 78112 KB Output is correct
74 Correct 198 ms 77908 KB Output is correct
75 Correct 176 ms 77904 KB Output is correct
76 Correct 176 ms 77200 KB Output is correct
77 Correct 228 ms 83324 KB Output is correct
78 Correct 188 ms 83280 KB Output is correct
79 Correct 186 ms 83228 KB Output is correct
80 Correct 184 ms 83284 KB Output is correct
81 Correct 211 ms 82508 KB Output is correct
82 Correct 185 ms 79304 KB Output is correct
83 Correct 200 ms 83280 KB Output is correct
84 Correct 184 ms 83132 KB Output is correct
85 Correct 208 ms 83404 KB Output is correct
86 Correct 185 ms 83284 KB Output is correct
87 Correct 200 ms 82488 KB Output is correct
88 Correct 154 ms 79188 KB Output is correct
89 Correct 208 ms 73480 KB Output is correct
90 Correct 166 ms 73996 KB Output is correct
91 Correct 187 ms 75860 KB Output is correct
92 Correct 178 ms 75600 KB Output is correct
93 Correct 193 ms 78928 KB Output is correct
94 Correct 197 ms 77476 KB Output is correct
95 Correct 182 ms 79688 KB Output is correct
96 Correct 196 ms 78672 KB Output is correct
97 Correct 192 ms 79696 KB Output is correct
98 Correct 191 ms 82512 KB Output is correct
99 Correct 197 ms 79420 KB Output is correct
100 Correct 194 ms 79188 KB Output is correct