oj.uz

Submission #343649

# Submission time Handle Problem Language Result Execution time Memory
343649 2021-01-04T10:32:30 Z parsabahrami Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 758 ms 49356 KB 
//! The Leader Of Retards Bemola
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<ll, ll> pll;
 
#define sz(x)                       (ll) x.size()
#define all(x)                      (x).begin(),(x).end()
#define F                           first
#define S                           second
#define lc 							id << 1
#define rc 							lc | 1

ll Pow(ll a, ll b, ll md, ll ans = 1) {
    for (; b; b >>= 1, a = a * a % md)
        if (b & 1)
            ans = ans * a % md;
    return ans % md;
}
const ll MAXN = 2e5 + 10;
const ll INF  = 8e18;
const ll MOD  = 1e9 + 7;
struct Node {
	ll a, b, ab, bc, abc;
};

Node operator+(const Node &x, const Node &y) {
	Node sg; sg.abc = max({x.a + y.bc, x.abc, y.abc, x.ab + y.a});
	sg.a = max(x.a, y.a);
	sg.b = min(x.b, y.b);
	sg.bc = max({x.bc, y.bc, y.a - 2 * x.b});
	sg.ab = max({x.ab, y.ab, x.a - 2 * y.b});
	return sg;
}

ll lazy[MAXN << 2], L[MAXN], R[MAXN], W[MAXN], last, n, q, timer, w;
vector<pll> adj[MAXN]; Node seg[MAXN << 2];

void DFS(ll v, ll p = -1) {
	for (pll u : adj[v]) {
		if (u.F == p) continue;
		L[u.S] = ++timer;
		DFS(u.F, v);
		R[u.S] = ++timer;
	}
}

void shift(ll id, ll l, ll r) {
	seg[id].a += lazy[id];
	seg[id].b += lazy[id];
	seg[id].ab -= lazy[id];
	seg[id].bc -= lazy[id];
	if (r - l > 1) {
		lazy[lc] += lazy[id];
		lazy[rc] += lazy[id];
	}
	lazy[id] = 0;
}

void update(ll ql, ll qr, ll x, ll id = 1, ll l = 0, ll r = timer) {
	shift(id, l, r);
	if (qr <= l || r <= ql) return;
	if (ql <= l && r <= qr) {
		lazy[id] += x;
		return shift(id, l, r);
	}
	ll mid = (l + r) >> 1;
	shift(lc, l, mid), shift(rc, mid, r);
	update(ql, qr, x, lc, l, mid);
	update(ql, qr, x, rc, mid, r);
	seg[id] = seg[lc] + seg[rc];
}

int main() {
	scanf("%lld%lld%lld", &n, &q, &w);
	for (ll i = 1; i < n; i++) {
		ll u, v; scanf("%lld%lld%lld", &u, &v, &W[i]);
		adj[u].push_back({v, i});
		adj[v].push_back({u, i});
	}
	DFS(1);
	for (ll i = 1; i < n; i++) {
		update(L[i], R[i], W[i]);
	}
	while (q--) {
		ll d, e; scanf("%lld%lld", &d, &e);
		d = (d + last) % (n - 1) + 1;
		e = (e + last) % w;
		update(L[d], R[d], e - W[d]);
		W[d] = e;
		printf("%lld\n", last = seg[1].abc);
	}
    return 0;
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   77 |  scanf("%lld%lld%lld", &n, &q, &w);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:79:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   79 |   ll u, v; scanf("%lld%lld%lld", &u, &v, &W[i]);
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:88:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   88 |   ll d, e; scanf("%lld%lld", &d, &e);
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 3 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 3 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 5 ms 5088 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 11 ms 5356 KB Output is correct
20 Correct 11 ms 5504 KB Output is correct
21 Correct 12 ms 5484 KB Output is correct
22 Correct 16 ms 5484 KB Output is correct
23 Correct 18 ms 7148 KB Output is correct
24 Correct 20 ms 7148 KB Output is correct
25 Correct 21 ms 7276 KB Output is correct
26 Correct 23 ms 7532 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 5 ms 5100 KB Output is correct
4 Correct 16 ms 5356 KB Output is correct
5 Correct 63 ms 6252 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5228 KB Output is correct
8 Correct 4 ms 5228 KB Output is correct
9 Correct 7 ms 5228 KB Output is correct
10 Correct 22 ms 5484 KB Output is correct
11 Correct 93 ms 6636 KB Output is correct
12 Correct 10 ms 7020 KB Output is correct
13 Correct 12 ms 7020 KB Output is correct
14 Correct 12 ms 7148 KB Output is correct
15 Correct 34 ms 7412 KB Output is correct
16 Correct 134 ms 8652 KB Output is correct
17 Correct 144 ms 37980 KB Output is correct
18 Correct 141 ms 37980 KB Output is correct
19 Correct 147 ms 37980 KB Output is correct
20 Correct 180 ms 38364 KB Output is correct
21 Correct 362 ms 39844 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5356 KB Output is correct
2 Correct 18 ms 5484 KB Output is correct
3 Correct 67 ms 5996 KB Output is correct
4 Correct 129 ms 6764 KB Output is correct
5 Correct 20 ms 9196 KB Output is correct
6 Correct 35 ms 9196 KB Output is correct
7 Correct 101 ms 9836 KB Output is correct
8 Correct 190 ms 10732 KB Output is correct
9 Correct 88 ms 22124 KB Output is correct
10 Correct 105 ms 22252 KB Output is correct
11 Correct 200 ms 23020 KB Output is correct
12 Correct 301 ms 23812 KB Output is correct
13 Correct 170 ms 39148 KB Output is correct
14 Correct 190 ms 39276 KB Output is correct
15 Correct 291 ms 39916 KB Output is correct
16 Correct 442 ms 40752 KB Output is correct
17 Correct 384 ms 40556 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 529 ms 43116 KB Output is correct
2 Correct 531 ms 42988 KB Output is correct
3 Correct 553 ms 42924 KB Output is correct
4 Correct 531 ms 42988 KB Output is correct
5 Correct 520 ms 42880 KB Output is correct
6 Correct 442 ms 42636 KB Output is correct
7 Correct 603 ms 45420 KB Output is correct
8 Correct 600 ms 45560 KB Output is correct
9 Correct 614 ms 45420 KB Output is correct
10 Correct 597 ms 45512 KB Output is correct
11 Correct 590 ms 45184 KB Output is correct
12 Correct 524 ms 44328 KB Output is correct
13 Correct 758 ms 49080 KB Output is correct
14 Correct 758 ms 49208 KB Output is correct
15 Correct 755 ms 49344 KB Output is correct
16 Correct 738 ms 49260 KB Output is correct
17 Correct 709 ms 48744 KB Output is correct
18 Correct 576 ms 45920 KB Output is correct
19 Correct 757 ms 49176 KB Output is correct
20 Correct 726 ms 49132 KB Output is correct
21 Correct 736 ms 49356 KB Output is correct
22 Correct 726 ms 49132 KB Output is correct
23 Correct 729 ms 48752 KB Output is correct
24 Correct 577 ms 45664 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 3 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 3 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 5 ms 5088 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 11 ms 5356 KB Output is correct
20 Correct 11 ms 5504 KB Output is correct
21 Correct 12 ms 5484 KB Output is correct
22 Correct 16 ms 5484 KB Output is correct
23 Correct 18 ms 7148 KB Output is correct
24 Correct 20 ms 7148 KB Output is correct
25 Correct 21 ms 7276 KB Output is correct
26 Correct 23 ms 7532 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 4 ms 5100 KB Output is correct
29 Correct 5 ms 5100 KB Output is correct
30 Correct 16 ms 5356 KB Output is correct
31 Correct 63 ms 6252 KB Output is correct
32 Correct 4 ms 5100 KB Output is correct
33 Correct 4 ms 5228 KB Output is correct
34 Correct 4 ms 5228 KB Output is correct
35 Correct 7 ms 5228 KB Output is correct
36 Correct 22 ms 5484 KB Output is correct
37 Correct 93 ms 6636 KB Output is correct
38 Correct 10 ms 7020 KB Output is correct
39 Correct 12 ms 7020 KB Output is correct
40 Correct 12 ms 7148 KB Output is correct
41 Correct 34 ms 7412 KB Output is correct
42 Correct 134 ms 8652 KB Output is correct
43 Correct 144 ms 37980 KB Output is correct
44 Correct 141 ms 37980 KB Output is correct
45 Correct 147 ms 37980 KB Output is correct
46 Correct 180 ms 38364 KB Output is correct
47 Correct 362 ms 39844 KB Output is correct
48 Correct 6 ms 5356 KB Output is correct
49 Correct 18 ms 5484 KB Output is correct
50 Correct 67 ms 5996 KB Output is correct
51 Correct 129 ms 6764 KB Output is correct
52 Correct 20 ms 9196 KB Output is correct
53 Correct 35 ms 9196 KB Output is correct
54 Correct 101 ms 9836 KB Output is correct
55 Correct 190 ms 10732 KB Output is correct
56 Correct 88 ms 22124 KB Output is correct
57 Correct 105 ms 22252 KB Output is correct
58 Correct 200 ms 23020 KB Output is correct
59 Correct 301 ms 23812 KB Output is correct
60 Correct 170 ms 39148 KB Output is correct
61 Correct 190 ms 39276 KB Output is correct
62 Correct 291 ms 39916 KB Output is correct
63 Correct 442 ms 40752 KB Output is correct
64 Correct 384 ms 40556 KB Output is correct
65 Correct 529 ms 43116 KB Output is correct
66 Correct 531 ms 42988 KB Output is correct
67 Correct 553 ms 42924 KB Output is correct
68 Correct 531 ms 42988 KB Output is correct
69 Correct 520 ms 42880 KB Output is correct
70 Correct 442 ms 42636 KB Output is correct
71 Correct 603 ms 45420 KB Output is correct
72 Correct 600 ms 45560 KB Output is correct
73 Correct 614 ms 45420 KB Output is correct
74 Correct 597 ms 45512 KB Output is correct
75 Correct 590 ms 45184 KB Output is correct
76 Correct 524 ms 44328 KB Output is correct
77 Correct 758 ms 49080 KB Output is correct
78 Correct 758 ms 49208 KB Output is correct
79 Correct 755 ms 49344 KB Output is correct
80 Correct 738 ms 49260 KB Output is correct
81 Correct 709 ms 48744 KB Output is correct
82 Correct 576 ms 45920 KB Output is correct
83 Correct 757 ms 49176 KB Output is correct
84 Correct 726 ms 49132 KB Output is correct
85 Correct 736 ms 49356 KB Output is correct
86 Correct 726 ms 49132 KB Output is correct
87 Correct 729 ms 48752 KB Output is correct
88 Correct 577 ms 45664 KB Output is correct
89 Correct 513 ms 41964 KB Output is correct
90 Correct 522 ms 42476 KB Output is correct
91 Correct 551 ms 43628 KB Output is correct
92 Correct 588 ms 43628 KB Output is correct
93 Correct 628 ms 45804 KB Output is correct
94 Correct 646 ms 45064 KB Output is correct
95 Correct 704 ms 46572 KB Output is correct
96 Correct 710 ms 45704 KB Output is correct
97 Correct 710 ms 46572 KB Output is correct
98 Correct 717 ms 48472 KB Output is correct
99 Correct 710 ms 46316 KB Output is correct
100 Correct 714 ms 46316 KB Output is correct