oj.uz

Submission #672955

# Submission time Handle Problem Language Result Execution time Memory
672955 2022-12-19T07:53:10 Z pavement Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 392 ms 63572 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int n, q, w, idx, a[100005], b[100005], c[100005], dep[100005], st[100005], ed[100005], seq[200005];
vector<ii> adj[100005];

void dfs(int n, int e = -1) {
	idx++;
	seq[idx] = n;
	st[n] = ed[n] = idx;
	for (auto [u, w] : adj[n]) if (u != e) {
		dep[u] = dep[n] + w;
		dfs(u, n);
		idx++;
		seq[idx] = n;
		ed[n] = idx;
	}
}

struct node {
	node *left, *right;
	int S, E, pv, val[6];
	void combine() {
		for (int k = 0; k < 6; k++)
			val[k] = max(left->val[k], right->val[k]);
		val[3] = max(val[3], left->val[0] + right->val[1]);
		val[4] = max(val[4], left->val[1] + right->val[2]);
		val[5] = max({val[5], left->val[3] + right->val[2], left->val[0] + right->val[4]});
	}
	node(int _s, int _e) : S(_s), E(_e), pv(0) {
		if (S == E) {
			val[0] = val[2] = dep[seq[S]];
			val[1] = -2 * dep[seq[S]];
			val[3] = val[4] = -dep[seq[S]];
			val[5] = 0;
			return;
		}
		int M = (S + E) >> 1;
		left = new node(S, M);
		right = new node(M + 1, E);
		combine();
	}
	void prop() {
		if (S == E || !pv) return;
		for (auto i : {left, right}) {
			for (int k = 0; k < 5; k++)
				if (k == 0 || k == 2) i->val[k] += pv;
				else if (k == 1) i->val[k] -= 2 * pv;
				else if (k == 3 || k == 4) i->val[k] -= pv;
			i->pv += pv;
		}
		pv = 0;
	}
	void upd(int l, int r, int v) {
		if (l > E || r < S) return;
		if (l <= S && E <= r) {
			for (int k = 0; k < 5; k++)
				if (k == 0 || k == 2) val[k] += v;
				else if (k == 1) val[k] -= 2 * v;
				else if (k == 3 || k == 4) val[k] -= v;
			pv += v;
			return;
		}
		prop();
		left->upd(l, r, v);
		right->upd(l, r, v);
		combine();
	}
} *root;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> q >> w;
	for (int i = 1; i < n; i++) {
		cin >> a[i] >> b[i] >> c[i];
		adj[a[i]].eb(b[i], c[i]);
		adj[b[i]].eb(a[i], c[i]);
	}
	dfs(1);
	for (int i = 1; i < n; i++) {
		if (dep[a[i]] > dep[b[i]]) swap(a[i], b[i]);
	}
	root = new node(1, idx);
	for (int d, e, last = 0; q--; ) {
		cin >> d >> e;
		d = (d + last) % (n - 1);
		e = (e + last) % w;
		d++;
		root->upd(st[b[d]], ed[b[d]], e - c[d]);
		c[d] = e;
		cout << (last = root->val[5]) << '\n';
	}
}

Compilation message

diameter.cpp:93:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   93 | main() {
      | ^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2684 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2772 KB Output is correct
16 Correct 1 ms 2772 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 5 ms 3284 KB Output is correct
20 Correct 5 ms 3204 KB Output is correct
21 Correct 7 ms 3308 KB Output is correct
22 Correct 6 ms 3300 KB Output is correct
23 Correct 8 ms 5260 KB Output is correct
24 Correct 9 ms 5332 KB Output is correct
25 Correct 9 ms 5304 KB Output is correct
26 Correct 9 ms 5588 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 7 ms 2848 KB Output is correct
5 Correct 38 ms 3844 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 2 ms 2948 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 10 ms 3156 KB Output is correct
11 Correct 43 ms 4164 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5204 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct
15 Correct 14 ms 5460 KB Output is correct
16 Correct 72 ms 6556 KB Output is correct
17 Correct 58 ms 52332 KB Output is correct
18 Correct 52 ms 52408 KB Output is correct
19 Correct 58 ms 52432 KB Output is correct
20 Correct 71 ms 52664 KB Output is correct
21 Correct 171 ms 53988 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3156 KB Output is correct
2 Correct 11 ms 3376 KB Output is correct
3 Correct 33 ms 3844 KB Output is correct
4 Correct 65 ms 4528 KB Output is correct
5 Correct 8 ms 7804 KB Output is correct
6 Correct 16 ms 7892 KB Output is correct
7 Correct 48 ms 8524 KB Output is correct
8 Correct 86 ms 9308 KB Output is correct
9 Correct 31 ms 28024 KB Output is correct
10 Correct 41 ms 28236 KB Output is correct
11 Correct 88 ms 29040 KB Output is correct
12 Correct 143 ms 29696 KB Output is correct
13 Correct 61 ms 53556 KB Output is correct
14 Correct 73 ms 53648 KB Output is correct
15 Correct 130 ms 54292 KB Output is correct
16 Correct 200 ms 55192 KB Output is correct
17 Correct 183 ms 54952 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 57368 KB Output is correct
2 Correct 235 ms 57292 KB Output is correct
3 Correct 264 ms 57356 KB Output is correct
4 Correct 231 ms 57340 KB Output is correct
5 Correct 253 ms 57160 KB Output is correct
6 Correct 217 ms 57120 KB Output is correct
7 Correct 270 ms 59752 KB Output is correct
8 Correct 265 ms 59816 KB Output is correct
9 Correct 261 ms 59724 KB Output is correct
10 Correct 294 ms 59764 KB Output is correct
11 Correct 341 ms 59644 KB Output is correct
12 Correct 275 ms 58772 KB Output is correct
13 Correct 321 ms 63392 KB Output is correct
14 Correct 327 ms 63432 KB Output is correct
15 Correct 392 ms 63432 KB Output is correct
16 Correct 304 ms 63444 KB Output is correct
17 Correct 293 ms 62860 KB Output is correct
18 Correct 301 ms 60112 KB Output is correct
19 Correct 314 ms 63516 KB Output is correct
20 Correct 356 ms 63468 KB Output is correct
21 Correct 304 ms 63572 KB Output is correct
22 Correct 305 ms 63508 KB Output is correct
23 Correct 339 ms 62868 KB Output is correct
24 Correct 326 ms 60168 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2684 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2772 KB Output is correct
16 Correct 1 ms 2772 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 5 ms 3284 KB Output is correct
20 Correct 5 ms 3204 KB Output is correct
21 Correct 7 ms 3308 KB Output is correct
22 Correct 6 ms 3300 KB Output is correct
23 Correct 8 ms 5260 KB Output is correct
24 Correct 9 ms 5332 KB Output is correct
25 Correct 9 ms 5304 KB Output is correct
26 Correct 9 ms 5588 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 7 ms 2848 KB Output is correct
31 Correct 38 ms 3844 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 2 ms 2948 KB Output is correct
35 Correct 3 ms 2900 KB Output is correct
36 Correct 10 ms 3156 KB Output is correct
37 Correct 43 ms 4164 KB Output is correct
38 Correct 4 ms 5212 KB Output is correct
39 Correct 4 ms 5204 KB Output is correct
40 Correct 5 ms 5204 KB Output is correct
41 Correct 14 ms 5460 KB Output is correct
42 Correct 72 ms 6556 KB Output is correct
43 Correct 58 ms 52332 KB Output is correct
44 Correct 52 ms 52408 KB Output is correct
45 Correct 58 ms 52432 KB Output is correct
46 Correct 71 ms 52664 KB Output is correct
47 Correct 171 ms 53988 KB Output is correct
48 Correct 3 ms 3156 KB Output is correct
49 Correct 11 ms 3376 KB Output is correct
50 Correct 33 ms 3844 KB Output is correct
51 Correct 65 ms 4528 KB Output is correct
52 Correct 8 ms 7804 KB Output is correct
53 Correct 16 ms 7892 KB Output is correct
54 Correct 48 ms 8524 KB Output is correct
55 Correct 86 ms 9308 KB Output is correct
56 Correct 31 ms 28024 KB Output is correct
57 Correct 41 ms 28236 KB Output is correct
58 Correct 88 ms 29040 KB Output is correct
59 Correct 143 ms 29696 KB Output is correct
60 Correct 61 ms 53556 KB Output is correct
61 Correct 73 ms 53648 KB Output is correct
62 Correct 130 ms 54292 KB Output is correct
63 Correct 200 ms 55192 KB Output is correct
64 Correct 183 ms 54952 KB Output is correct
65 Correct 283 ms 57368 KB Output is correct
66 Correct 235 ms 57292 KB Output is correct
67 Correct 264 ms 57356 KB Output is correct
68 Correct 231 ms 57340 KB Output is correct
69 Correct 253 ms 57160 KB Output is correct
70 Correct 217 ms 57120 KB Output is correct
71 Correct 270 ms 59752 KB Output is correct
72 Correct 265 ms 59816 KB Output is correct
73 Correct 261 ms 59724 KB Output is correct
74 Correct 294 ms 59764 KB Output is correct
75 Correct 341 ms 59644 KB Output is correct
76 Correct 275 ms 58772 KB Output is correct
77 Correct 321 ms 63392 KB Output is correct
78 Correct 327 ms 63432 KB Output is correct
79 Correct 392 ms 63432 KB Output is correct
80 Correct 304 ms 63444 KB Output is correct
81 Correct 293 ms 62860 KB Output is correct
82 Correct 301 ms 60112 KB Output is correct
83 Correct 314 ms 63516 KB Output is correct
84 Correct 356 ms 63468 KB Output is correct
85 Correct 304 ms 63572 KB Output is correct
86 Correct 305 ms 63508 KB Output is correct
87 Correct 339 ms 62868 KB Output is correct
88 Correct 326 ms 60168 KB Output is correct
89 Correct 266 ms 56316 KB Output is correct
90 Correct 289 ms 56652 KB Output is correct
91 Correct 259 ms 58072 KB Output is correct
92 Correct 292 ms 58044 KB Output is correct
93 Correct 264 ms 60396 KB Output is correct
94 Correct 286 ms 59456 KB Output is correct
95 Correct 279 ms 60888 KB Output is correct
96 Correct 302 ms 59896 KB Output is correct
97 Correct 298 ms 60840 KB Output is correct
98 Correct 338 ms 62696 KB Output is correct
99 Correct 291 ms 60680 KB Output is correct
100 Correct 289 ms 60600 KB Output is correct