oj.uz

Submission #545928

# Submission time Handle Problem Language Result Execution time Memory
545928 2022-04-05T16:11:47 Z rainboy Dynamic Diameter (CEOI19_diameter) C
100 / 100
 427 ms 50824 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	100000
#define N_	(1 << 18)	/* N_ = pow2(ceil(log2((N - 1) * 2))) */

long long max(long long a, long long b) { return a > b ? a : b; }

int *eh[N], eo[N];

void append(int i, int h) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		eh[i] = (int *) realloc(eh[i], o * 2 * sizeof *eh[i]);
	eh[i][o] = h;
}

int ii[N - 1], jj[N - 1], ta[N - 1], tb[N - 1]; long long ww[N - 1], aa[(N - 1) * 2];

void dfs(int p, int i) {
	static int time;
	int o;

	for (o = eo[i]; o--; ) {
		int h = eh[i][o], j = i ^ ii[h] ^ jj[h];

		if (j != p) {
			ii[h] = i, jj[h] = j;
			ta[h] = time++;
			dfs(i, j);
			tb[h] = time++;
			aa[ta[h]] = ww[h], aa[tb[h]] = -ww[h];
		}
	}
}

long long st1[N_ * 2], st2[N_ * 2], st01[N_ * 2], st12[N_ * 2], st23[N_ * 2], st02[N_ * 2], st13[N_ * 2], st03[N_ * 2]; int n_;

void pul(int i) {
	int l = i << 1 | 0, r = l | 1;

	st1[i] = st1[l] + st1[r];
	st2[i] = st2[l] + st2[r];
	st01[i] = max(st01[r], st01[l] + st1[r]);
	st12[i] = max(st1[l] + st12[r], st12[l] + st2[r]);
	st23[i] = max(st2[l] + st23[r], st23[l]);
	st02[i] = max(max(st02[r], st01[l] + st12[r]), st02[l] + st2[r]);
	st13[i] = max(max(st1[l] + st13[r], st12[l] + st23[r]), st13[l]);
	st03[i] = max(max(max(st03[r], st01[l] + st13[r]), st02[l] + st23[r]), st03[l]);
}

void build(long long *aa, int n) {
	int i;

	n_ = 1;
	while (n_ < n)
		n_ <<= 1;
	for (i = 0; i < n; i++) {
		st1[n_ + i] = -aa[i];
		st2[n_ + i] = aa[i];
		st01[n_ + i] = max(0, -aa[i]);
		st23[n_ + i] = max(aa[i], 0);
		st12[n_ + i] = st02[n_ + i] = st13[n_ + i] = st03[n_ + i] = max(-aa[i], aa[i]);
	}
	for (i = n_ - 1; i > 0; i--)
		pul(i);
}

void update(int i, long long w) {
	i += n_;
	st1[i] = -w;
	st2[i] = w;
	st01[i] = max(0, -w);
	st23[i] = max(w, 0);
	st12[i] = st02[i] = st13[i] = st03[i] = max(-w, w);
	while (i > 1)
		pul(i >>= 1);
}

int main() {
	int n, q, h, i;
	long long w_, last;

	scanf("%d%d%lld", &n, &q, &w_);
	for (i = 0; i < n; i++)
		eh[i] = (int *) malloc(2 * sizeof *eh[i]);
	for (h = 0; h < n - 1; h++) {
		scanf("%d%d%lld", &ii[h], &jj[h], &ww[h]), ii[h]--, jj[h]--;
		append(ii[h], h), append(jj[h], h);
	}
	dfs(-1, 0);
	build(aa, (n - 1) * 2);
	last = 0;
	while (q--) {
		int h;
		long long w;

		scanf("%d%lld", &h, &w), h = (h + last) % (n - 1), w = (w + last) % w_;
		ww[h] = w;
		update(ta[h], ww[h]), update(tb[h], -ww[h]);
		printf("%lld\n", last = st03[1]);
	}
	return 0;
}

Compilation message

diameter.c: In function 'append':
diameter.c:14:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   14 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
diameter.c: In function 'main':
diameter.c:85:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |  scanf("%d%d%lld", &n, &q, &w_);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.c:89:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |   scanf("%d%d%lld", &ii[h], &jj[h], &ww[h]), ii[h]--, jj[h]--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.c:99:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |   scanf("%d%lld", &h, &w), h = (h + last) % (n - 1), w = (w + last) % w_;
      |   ^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 424 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 356 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 424 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 356 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 9 ms 824 KB Output is correct
20 Correct 6 ms 812 KB Output is correct
21 Correct 5 ms 768 KB Output is correct
22 Correct 6 ms 816 KB Output is correct
23 Correct 9 ms 2516 KB Output is correct
24 Correct 9 ms 2516 KB Output is correct
25 Correct 9 ms 2644 KB Output is correct
26 Correct 10 ms 2956 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 11 ms 596 KB Output is correct
5 Correct 68 ms 1476 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 26 ms 820 KB Output is correct
11 Correct 65 ms 1776 KB Output is correct
12 Correct 3 ms 2480 KB Output is correct
13 Correct 4 ms 2480 KB Output is correct
14 Correct 8 ms 2532 KB Output is correct
15 Correct 36 ms 2764 KB Output is correct
16 Correct 101 ms 3944 KB Output is correct
17 Correct 55 ms 39100 KB Output is correct
18 Correct 72 ms 39056 KB Output is correct
19 Correct 66 ms 39124 KB Output is correct
20 Correct 101 ms 39420 KB Output is correct
21 Correct 247 ms 40744 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 10 ms 816 KB Output is correct
3 Correct 41 ms 1392 KB Output is correct
4 Correct 90 ms 2108 KB Output is correct
5 Correct 8 ms 4656 KB Output is correct
6 Correct 26 ms 4764 KB Output is correct
7 Correct 75 ms 5348 KB Output is correct
8 Correct 136 ms 6156 KB Output is correct
9 Correct 33 ms 19612 KB Output is correct
10 Correct 47 ms 19832 KB Output is correct
11 Correct 116 ms 20524 KB Output is correct
12 Correct 228 ms 21300 KB Output is correct
13 Correct 79 ms 39004 KB Output is correct
14 Correct 96 ms 39128 KB Output is correct
15 Correct 167 ms 39744 KB Output is correct
16 Correct 283 ms 40660 KB Output is correct
17 Correct 243 ms 40512 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 295 ms 43216 KB Output is correct
2 Correct 337 ms 43296 KB Output is correct
3 Correct 309 ms 43200 KB Output is correct
4 Correct 303 ms 43280 KB Output is correct
5 Correct 360 ms 43308 KB Output is correct
6 Correct 298 ms 43384 KB Output is correct
7 Correct 341 ms 46048 KB Output is correct
8 Correct 315 ms 46100 KB Output is correct
9 Correct 295 ms 46064 KB Output is correct
10 Correct 345 ms 46164 KB Output is correct
11 Correct 342 ms 46028 KB Output is correct
12 Correct 310 ms 45548 KB Output is correct
13 Correct 363 ms 50772 KB Output is correct
14 Correct 351 ms 50824 KB Output is correct
15 Correct 354 ms 50820 KB Output is correct
16 Correct 341 ms 50716 KB Output is correct
17 Correct 345 ms 50120 KB Output is correct
18 Correct 352 ms 47332 KB Output is correct
19 Correct 376 ms 50740 KB Output is correct
20 Correct 331 ms 50704 KB Output is correct
21 Correct 365 ms 50812 KB Output is correct
22 Correct 324 ms 50728 KB Output is correct
23 Correct 332 ms 50096 KB Output is correct
24 Correct 317 ms 47360 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 424 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 356 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 9 ms 824 KB Output is correct
20 Correct 6 ms 812 KB Output is correct
21 Correct 5 ms 768 KB Output is correct
22 Correct 6 ms 816 KB Output is correct
23 Correct 9 ms 2516 KB Output is correct
24 Correct 9 ms 2516 KB Output is correct
25 Correct 9 ms 2644 KB Output is correct
26 Correct 10 ms 2956 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 11 ms 596 KB Output is correct
31 Correct 68 ms 1476 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 2 ms 564 KB Output is correct
36 Correct 26 ms 820 KB Output is correct
37 Correct 65 ms 1776 KB Output is correct
38 Correct 3 ms 2480 KB Output is correct
39 Correct 4 ms 2480 KB Output is correct
40 Correct 8 ms 2532 KB Output is correct
41 Correct 36 ms 2764 KB Output is correct
42 Correct 101 ms 3944 KB Output is correct
43 Correct 55 ms 39100 KB Output is correct
44 Correct 72 ms 39056 KB Output is correct
45 Correct 66 ms 39124 KB Output is correct
46 Correct 101 ms 39420 KB Output is correct
47 Correct 247 ms 40744 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 10 ms 816 KB Output is correct
50 Correct 41 ms 1392 KB Output is correct
51 Correct 90 ms 2108 KB Output is correct
52 Correct 8 ms 4656 KB Output is correct
53 Correct 26 ms 4764 KB Output is correct
54 Correct 75 ms 5348 KB Output is correct
55 Correct 136 ms 6156 KB Output is correct
56 Correct 33 ms 19612 KB Output is correct
57 Correct 47 ms 19832 KB Output is correct
58 Correct 116 ms 20524 KB Output is correct
59 Correct 228 ms 21300 KB Output is correct
60 Correct 79 ms 39004 KB Output is correct
61 Correct 96 ms 39128 KB Output is correct
62 Correct 167 ms 39744 KB Output is correct
63 Correct 283 ms 40660 KB Output is correct
64 Correct 243 ms 40512 KB Output is correct
65 Correct 295 ms 43216 KB Output is correct
66 Correct 337 ms 43296 KB Output is correct
67 Correct 309 ms 43200 KB Output is correct
68 Correct 303 ms 43280 KB Output is correct
69 Correct 360 ms 43308 KB Output is correct
70 Correct 298 ms 43384 KB Output is correct
71 Correct 341 ms 46048 KB Output is correct
72 Correct 315 ms 46100 KB Output is correct
73 Correct 295 ms 46064 KB Output is correct
74 Correct 345 ms 46164 KB Output is correct
75 Correct 342 ms 46028 KB Output is correct
76 Correct 310 ms 45548 KB Output is correct
77 Correct 363 ms 50772 KB Output is correct
78 Correct 351 ms 50824 KB Output is correct
79 Correct 354 ms 50820 KB Output is correct
80 Correct 341 ms 50716 KB Output is correct
81 Correct 345 ms 50120 KB Output is correct
82 Correct 352 ms 47332 KB Output is correct
83 Correct 376 ms 50740 KB Output is correct
84 Correct 331 ms 50704 KB Output is correct
85 Correct 365 ms 50812 KB Output is correct
86 Correct 324 ms 50728 KB Output is correct
87 Correct 332 ms 50096 KB Output is correct
88 Correct 317 ms 47360 KB Output is correct
89 Correct 333 ms 42300 KB Output is correct
90 Correct 363 ms 42652 KB Output is correct
91 Correct 335 ms 44116 KB Output is correct
92 Correct 316 ms 44024 KB Output is correct
93 Correct 384 ms 46844 KB Output is correct
94 Correct 383 ms 45764 KB Output is correct
95 Correct 415 ms 47740 KB Output is correct
96 Correct 394 ms 46548 KB Output is correct
97 Correct 417 ms 47668 KB Output is correct
98 Correct 427 ms 49956 KB Output is correct
99 Correct 362 ms 47356 KB Output is correct
100 Correct 361 ms 47264 KB Output is correct