oj.uz

Submission #620251

# Submission time Handle Problem Language Result Execution time Memory
620251 2022-08-03T04:21:22 Z Zanite Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 377 ms 62416 KB 
#include <bits/stdc++.h>
using namespace std;

using ll	= long long;
using pll	= pair<ll, ll>;
using Edge	= pair<ll, pll>;

#define fi	first
#define se	second

const int maxN	= 1e5 + 5;

const ll INF	= 1e18;

ll n, q, w;
vector<pll> adj[maxN];
vector<Edge> edges;

ll timer;
ll dist[maxN], tin[maxN], tout[maxN];
vector<ll> Euler(1);

void dfs(ll cur, ll par, ll cdist) {
	dist[cur] = cdist;
	Euler.push_back(cur);
	tin[cur] = (ll)Euler.size() - 1;

	for (auto &[nxt, w] : adj[cur]) {
		if (nxt == par) continue;
		dfs(nxt, cur, cdist+w);

		Euler.push_back(cur);
	}

	tout[cur] = (ll)Euler.size() - 1;
}

struct Segtree {
	struct Node {
		ll A, B, AB, BA, ABA, lazy;

		Node() {}

		Node(ll val) {
			A = val;
			B = -2ll * val;
			AB = BA = ABA = -INF;
			lazy = 0;
		}
	};

	ll sz;
	vector<Node> seg;

	Segtree(ll sz) : sz(sz) {
		seg.assign((sz << 2) + 1, Node());
	}

	void updateNode(ll pos, ll val) {
		Node &C = seg[pos];

		C.A += val;
		C.B -= 2ll * val;
		C.AB -= val;
		C.BA -= val;
		C.lazy += val;
	}

	void checkLazy(ll pos) {
		if (seg[pos].lazy != 0) {
			ll lc = pos << 1, rc = lc | 1;
			updateNode(lc, seg[pos].lazy);
			updateNode(rc, seg[pos].lazy);
			seg[pos].lazy = 0;
		}
	}

	Node merge(Node L, Node R) {
		Node N = Node(0);

		N.A = max(L.A, R.A);
		N.B = max(L.B, R.B);

		N.AB = max({
			L.AB,
			R.AB,
			L.A + R.B
		});

		N.BA = max({
			L.BA,
			R.BA,
			L.B + R.A
		});

		N.ABA = max({
			L.ABA,
			R.ABA,
			L.A + R.BA,
			L.AB + R.A
		});

		return N;
	}

	void build(ll pos, ll l, ll r) {
		if (l == r) {
			seg[pos] = Node(dist[Euler[l]]);
			return;
		}

		ll m = (l+r) >> 1, lc = pos << 1, rc = lc | 1;
		build(lc, l, m);
		build(rc, m+1, r);
		seg[pos] = merge(seg[lc], seg[rc]);
	}
	void build() {build(1, 1, sz);}

	void update(ll pos, ll l, ll r, ll ul, ll ur, ll val) {
		if (l > r || ul > ur || l > ur || ul > r) return;
		if (ul <= l && r <= ur) {
			updateNode(pos, val);
			return;
		}

		checkLazy(pos);

		ll m = (l+r) >> 1, lc = pos << 1, rc = lc | 1;
		update(lc, l, m, ul, ur, val);
		update(rc, m+1, r, ul, ur, val);
		seg[pos] = merge(seg[lc], seg[rc]);
	}
	void update(ll ul, ll ur, ll val) {update(1, 1, sz, ul, ur, val);}

	ll query() {
		return max({seg[1].ABA, seg[1].AB, seg[1].BA});
	}
};

int main() {
	scanf("%lld %lld %lld", &n, &q, &w);
	for (ll a, b, c, i = 1; i < n; i++) {
		scanf("%lld %lld %lld", &a, &b, &c);
		adj[a].push_back({b, c});
		adj[b].push_back({a, c});

		edges.push_back({c, {a, b}});
	}
	dfs(1, 0, 0);

	ll ES = (ll)Euler.size() - 1;

	Segtree S(ES);
	S.build();
	for (auto &[cw, p] : edges) {
		if (tin[p.se] < tin[p.fi]) {swap(p.fi, p.se);}
	}

	ll last = 0;
	for (ll d, e, i = 1; i <= q; i++) {
		scanf("%lld %lld", &d, &e);
		d = (d + last) % (n - 1);
		e = (e + last) % w;

		auto &[cw, p] = edges[d];

		S.update(tin[p.se], tout[p.se], e - cw);
		cw = e;

		last = S.query();
		printf("%lld\n", last);
	}
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:141:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  141 |  scanf("%lld %lld %lld", &n, &q, &w);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:143:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  143 |   scanf("%lld %lld %lld", &a, &b, &c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:161:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  161 |   scanf("%lld %lld", &d, &e);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

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 2644 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 1 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 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 2 ms 2644 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 2644 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 1 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 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 5 ms 3168 KB Output is correct
20 Correct 5 ms 3156 KB Output is correct
21 Correct 6 ms 3284 KB Output is correct
22 Correct 6 ms 3276 KB Output is correct
23 Correct 8 ms 5400 KB Output is correct
24 Correct 8 ms 5332 KB Output is correct
25 Correct 9 ms 5588 KB Output is correct
26 Correct 10 ms 5716 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 3 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 10 ms 2900 KB Output is correct
5 Correct 38 ms 3392 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 3 ms 2952 KB Output is correct
10 Correct 15 ms 3140 KB Output is correct
11 Correct 66 ms 3736 KB Output is correct
12 Correct 5 ms 5208 KB Output is correct
13 Correct 4 ms 5268 KB Output is correct
14 Correct 6 ms 5268 KB Output is correct
15 Correct 21 ms 5504 KB Output is correct
16 Correct 66 ms 5976 KB Output is correct
17 Correct 76 ms 53580 KB Output is correct
18 Correct 55 ms 53544 KB Output is correct
19 Correct 69 ms 53548 KB Output is correct
20 Correct 80 ms 53652 KB Output is correct
21 Correct 169 ms 54272 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3172 KB Output is correct
2 Correct 9 ms 3284 KB Output is correct
3 Correct 36 ms 3596 KB Output is correct
4 Correct 72 ms 3912 KB Output is correct
5 Correct 12 ms 7980 KB Output is correct
6 Correct 15 ms 8080 KB Output is correct
7 Correct 51 ms 8360 KB Output is correct
8 Correct 118 ms 8660 KB Output is correct
9 Correct 47 ms 28540 KB Output is correct
10 Correct 52 ms 28644 KB Output is correct
11 Correct 95 ms 29100 KB Output is correct
12 Correct 172 ms 29492 KB Output is correct
13 Correct 79 ms 55064 KB Output is correct
14 Correct 95 ms 55064 KB Output is correct
15 Correct 183 ms 55496 KB Output is correct
16 Correct 170 ms 56064 KB Output is correct
17 Correct 196 ms 56156 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 56836 KB Output is correct
2 Correct 264 ms 56768 KB Output is correct
3 Correct 258 ms 56188 KB Output is correct
4 Correct 237 ms 56172 KB Output is correct
5 Correct 247 ms 55976 KB Output is correct
6 Correct 206 ms 55852 KB Output is correct
7 Correct 280 ms 58612 KB Output is correct
8 Correct 255 ms 58652 KB Output is correct
9 Correct 254 ms 58620 KB Output is correct
10 Correct 262 ms 58628 KB Output is correct
11 Correct 255 ms 58352 KB Output is correct
12 Correct 230 ms 57496 KB Output is correct
13 Correct 364 ms 62400 KB Output is correct
14 Correct 315 ms 62332 KB Output is correct
15 Correct 377 ms 62392 KB Output is correct
16 Correct 304 ms 62372 KB Output is correct
17 Correct 273 ms 61812 KB Output is correct
18 Correct 352 ms 58908 KB Output is correct
19 Correct 335 ms 62352 KB Output is correct
20 Correct 339 ms 62388 KB Output is correct
21 Correct 337 ms 62416 KB Output is correct
22 Correct 284 ms 62324 KB Output is correct
23 Correct 284 ms 61804 KB Output is correct
24 Correct 270 ms 58892 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 2644 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 1 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 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 5 ms 3168 KB Output is correct
20 Correct 5 ms 3156 KB Output is correct
21 Correct 6 ms 3284 KB Output is correct
22 Correct 6 ms 3276 KB Output is correct
23 Correct 8 ms 5400 KB Output is correct
24 Correct 8 ms 5332 KB Output is correct
25 Correct 9 ms 5588 KB Output is correct
26 Correct 10 ms 5716 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 3 ms 2644 KB Output is correct
29 Correct 3 ms 2644 KB Output is correct
30 Correct 10 ms 2900 KB Output is correct
31 Correct 38 ms 3392 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 2 ms 2900 KB Output is correct
35 Correct 3 ms 2952 KB Output is correct
36 Correct 15 ms 3140 KB Output is correct
37 Correct 66 ms 3736 KB Output is correct
38 Correct 5 ms 5208 KB Output is correct
39 Correct 4 ms 5268 KB Output is correct
40 Correct 6 ms 5268 KB Output is correct
41 Correct 21 ms 5504 KB Output is correct
42 Correct 66 ms 5976 KB Output is correct
43 Correct 76 ms 53580 KB Output is correct
44 Correct 55 ms 53544 KB Output is correct
45 Correct 69 ms 53548 KB Output is correct
46 Correct 80 ms 53652 KB Output is correct
47 Correct 169 ms 54272 KB Output is correct
48 Correct 4 ms 3172 KB Output is correct
49 Correct 9 ms 3284 KB Output is correct
50 Correct 36 ms 3596 KB Output is correct
51 Correct 72 ms 3912 KB Output is correct
52 Correct 12 ms 7980 KB Output is correct
53 Correct 15 ms 8080 KB Output is correct
54 Correct 51 ms 8360 KB Output is correct
55 Correct 118 ms 8660 KB Output is correct
56 Correct 47 ms 28540 KB Output is correct
57 Correct 52 ms 28644 KB Output is correct
58 Correct 95 ms 29100 KB Output is correct
59 Correct 172 ms 29492 KB Output is correct
60 Correct 79 ms 55064 KB Output is correct
61 Correct 95 ms 55064 KB Output is correct
62 Correct 183 ms 55496 KB Output is correct
63 Correct 170 ms 56064 KB Output is correct
64 Correct 196 ms 56156 KB Output is correct
65 Correct 265 ms 56836 KB Output is correct
66 Correct 264 ms 56768 KB Output is correct
67 Correct 258 ms 56188 KB Output is correct
68 Correct 237 ms 56172 KB Output is correct
69 Correct 247 ms 55976 KB Output is correct
70 Correct 206 ms 55852 KB Output is correct
71 Correct 280 ms 58612 KB Output is correct
72 Correct 255 ms 58652 KB Output is correct
73 Correct 254 ms 58620 KB Output is correct
74 Correct 262 ms 58628 KB Output is correct
75 Correct 255 ms 58352 KB Output is correct
76 Correct 230 ms 57496 KB Output is correct
77 Correct 364 ms 62400 KB Output is correct
78 Correct 315 ms 62332 KB Output is correct
79 Correct 377 ms 62392 KB Output is correct
80 Correct 304 ms 62372 KB Output is correct
81 Correct 273 ms 61812 KB Output is correct
82 Correct 352 ms 58908 KB Output is correct
83 Correct 335 ms 62352 KB Output is correct
84 Correct 339 ms 62388 KB Output is correct
85 Correct 337 ms 62416 KB Output is correct
86 Correct 284 ms 62324 KB Output is correct
87 Correct 284 ms 61804 KB Output is correct
88 Correct 270 ms 58892 KB Output is correct
89 Correct 228 ms 55844 KB Output is correct
90 Correct 275 ms 56184 KB Output is correct
91 Correct 228 ms 57500 KB Output is correct
92 Correct 250 ms 57440 KB Output is correct
93 Correct 261 ms 59700 KB Output is correct
94 Correct 280 ms 59044 KB Output is correct
95 Correct 277 ms 60404 KB Output is correct
96 Correct 297 ms 59456 KB Output is correct
97 Correct 316 ms 60252 KB Output is correct
98 Correct 312 ms 62200 KB Output is correct
99 Correct 288 ms 60088 KB Output is correct
100 Correct 265 ms 60144 KB Output is correct