oj.uz

답안 #872820

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872820 2023-11-13T21:17:57 Z rainboy Feast (NOI19_feast) C
100 / 100
 58 ms 40532 KB 
#include <stdio.h>

#define N	300000
#define H_	19	/* H_ = ceil(log2(N + 1)) */
#define N_	(1 << H_)
#define INF	0x3f3f3f3f3f3f3f3fLL

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

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

long long ppmn[N_ * 2], ppmx[N_ * 2], ssmn[N_ * 2], ssmx[N_ * 2]; int n_;

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

	ppmn[i] = min(ppmn[l], ppmn[r]);
	ppmx[i] = max(ppmx[l], ppmx[r]);
	ssmn[i] = min(ssmn[l], ssmn[r]);
	if (ppmx[l] != -INF && ppmn[r] != INF)
		ssmn[i] = min(ssmn[i], ppmn[r] - ppmx[l]);
	ssmx[i] = max(ssmx[l], ssmx[r]);
	if (ppmn[l] != INF && ppmx[r] != -INF)
		ssmx[i] = max(ssmx[i], ppmx[r] - ppmn[l]);
}

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

	n_ = 1;
	while (n_ < n)
		n_ <<= 1;
	for (i = 0; i < n_; i++) {
		if (i < n)
			ppmn[n_ + i] = aa[i], ppmx[n_ + i] = aa[i];
		else
			ppmn[n_ + i] = INF, ppmx[n_ + i] = -INF;
		ssmn[n_ + i] = ssmx[n_ + i] = 0;
	}
	for (i = n_ - 1; i > 0; i--)
		pul(i);
}

long long query_mn(int l, int r, int *l_, int *r_) {
	static int qu[(H_ + 1) * 2], qu_[H_ + 1];
	int cnt, cnt_, hl, hr, hl_, hr_, i;
	long long s_;

	cnt = cnt_ = 0;
	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			qu[cnt++] = l++;
		if ((r & 1) == 0)
			qu_[cnt_++] = r--;
	}
	while (cnt_--)
		qu[cnt++] = qu_[cnt_];
	s_ = INF, hl_ = hr_ = -1;
	for (hr = 0, hl = -1, l = -1; hr < cnt; hr++) {
		r = qu[hr];
		if (s_ > ssmn[r])
			s_ = ssmn[r], hl_ = hr_ = hr;
		if (l != -1 && s_ > ppmn[r] - ppmx[l])
			s_ = ppmn[r] - ppmx[l], hl_ = hl, hr_ = hr;
		if (ppmx[r] != -INF && (hl == -1 || ppmx[l] < ppmx[r]))
			hl = hr, l = r;
	}
	if (hl_ == hr_) {
		i = qu[hl_];
		while (i < n_)
			if (ssmn[i << 1 | 0] == ssmn[i])
				i = i << 1 | 0;
			else if (ssmn[i << 1 | 1] == ssmn[i])
				i = i << 1 | 1;
			else {
				l = i << 1 | 0, r = i << 1 | 1;
				break;
			}
		if (i >= n_)
			l = r = i;
	} else
		l = qu[hl_], r = qu[hr_];
	while (l < n_)
		l = ppmx[l << 1 | 0] == ppmx[l] ? l << 1 | 0 : l << 1 | 1;
	while (r < n_)
		r = ppmn[r << 1 | 0] == ppmn[r] ? r << 1 | 0 : r << 1 | 1;
	*l_ = l - n_, *r_ = r - n_;
	return s_;
}

long long query_mx(int l, int r, int *l_, int *r_) {
	static int qu[(H_ + 1) * 2], qu_[H_ + 1];
	int cnt, cnt_, hl, hr, hl_, hr_, i;
	long long s_;

	cnt = cnt_ = 0;
	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			qu[cnt++] = l++;
		if ((r & 1) == 0)
			qu_[cnt_++] = r--;
	}
	while (cnt_--)
		qu[cnt++] = qu_[cnt_];
	s_ = -INF, hl_ = hr_ = -1;
	for (hr = 0, hl = -1, l = -1; hr < cnt; hr++) {
		r = qu[hr];
		if (s_ < ssmx[r])
			s_ = ssmx[r], hl_ = hr_ = hr;
		if (l != -1 && s_ < ppmx[r] - ppmn[l])
			s_ = ppmx[r] - ppmn[l], hl_ = hl, hr_ = hr;
		if (ppmn[r] != INF && (hl == -1 || ppmn[l] > ppmn[r]))
			hl = hr, l = r;
	}
	if (hl_ == hr_) {
		i = qu[hl_];
		while (i < n_)
			if (ssmx[i << 1 | 0] == ssmx[i])
				i = i << 1 | 0;
			else if (ssmx[i << 1 | 1] == ssmx[i])
				i = i << 1 | 1;
			else {
				l = i << 1 | 0, r = i << 1 | 1;
				break;
			}
		if (i >= n_)
			l = r = i;
	} else
		l = qu[hl_], r = qu[hr_];
	while (l < n_)
		l = ppmn[l << 1 | 0] == ppmn[l] ? l << 1 | 0 : l << 1 | 1;
	while (r < n_)
		r = ppmx[r << 1 | 0] == ppmx[r] ? r << 1 | 0 : r << 1 | 1;
	*l_ = l - n_, *r_ = r - n_;
	return s_;
}

long long ss[N + 1]; int m;

void solve(int l, int r, int flip) {
	long long s;
	int l_, r_;

	s = !flip ? query_mx(l, r, &l_, &r_) : query_mn(l, r, &l_, &r_);
	if (s != 0) {
		ss[m++] = !flip ? s : -s;
		solve(l, l_, flip), solve(l_, r_, flip ^ 1), solve(r_, r, flip);
	}
}

void sort(long long *ss, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r;
		long long s = ss[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (ss[j] == s)
				j++;
			else if (ss[j] < s) {
				tmp = ss[i], ss[i] = ss[j], ss[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ss[j], ss[j] = ss[k], ss[k] = tmp;
			}
		sort(ss, l, i);
		l = k;
	}
}

int main() {
	static long long aa[N + 1];
	int n, k, h, i;
	long long ans;

	scanf("%d%d", &n, &k);
	for (i = 1; i <= n; i++)
		scanf("%lld", &aa[i]), aa[i] += aa[i - 1];
	build(aa, n + 1);
	solve(0, n, 0);
	sort(ss, 0, m);
	ans = 0;
	for (h = m - 1; h >= 0 && h >= m - k; h--)
		ans += ss[h];
	printf("%lld\n", ans);
	return 0;
}

Compilation message

feast.c: In function 'main':
feast.c:181:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  181 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
feast.c:183:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  183 |   scanf("%lld", &aa[i]), aa[i] += aa[i - 1];
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 39504 KB Output is correct
2 Correct 32 ms 39508 KB Output is correct
3 Correct 32 ms 39452 KB Output is correct
4 Correct 34 ms 39500 KB Output is correct
5 Correct 32 ms 39508 KB Output is correct
6 Correct 31 ms 39504 KB Output is correct
7 Correct 34 ms 39508 KB Output is correct
8 Correct 32 ms 39508 KB Output is correct
9 Correct 32 ms 39356 KB Output is correct
10 Correct 32 ms 39508 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 37716 KB Output is correct
2 Correct 26 ms 37716 KB Output is correct
3 Correct 25 ms 37604 KB Output is correct
4 Correct 30 ms 37976 KB Output is correct
5 Correct 38 ms 39428 KB Output is correct
6 Correct 25 ms 37816 KB Output is correct
7 Correct 27 ms 37788 KB Output is correct
8 Correct 40 ms 39596 KB Output is correct
9 Correct 39 ms 39484 KB Output is correct
10 Correct 28 ms 37724 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 40276 KB Output is correct
2 Correct 53 ms 40272 KB Output is correct
3 Correct 54 ms 40532 KB Output is correct
4 Correct 57 ms 40272 KB Output is correct
5 Correct 56 ms 40272 KB Output is correct
6 Correct 58 ms 40316 KB Output is correct
7 Correct 56 ms 40308 KB Output is correct
8 Correct 55 ms 40284 KB Output is correct
9 Correct 56 ms 40472 KB Output is correct
10 Correct 55 ms 40276 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 2 ms 10676 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 2 ms 10676 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10668 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 2 ms 10676 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10668 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 2 ms 10584 KB Output is correct
22 Correct 2 ms 10584 KB Output is correct
23 Correct 1 ms 10588 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 1 ms 10588 KB Output is correct
26 Correct 2 ms 10836 KB Output is correct
27 Correct 1 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 1 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 39504 KB Output is correct
2 Correct 32 ms 39508 KB Output is correct
3 Correct 32 ms 39452 KB Output is correct
4 Correct 34 ms 39500 KB Output is correct
5 Correct 32 ms 39508 KB Output is correct
6 Correct 31 ms 39504 KB Output is correct
7 Correct 34 ms 39508 KB Output is correct
8 Correct 32 ms 39508 KB Output is correct
9 Correct 32 ms 39356 KB Output is correct
10 Correct 32 ms 39508 KB Output is correct
11 Correct 26 ms 37716 KB Output is correct
12 Correct 26 ms 37716 KB Output is correct
13 Correct 25 ms 37604 KB Output is correct
14 Correct 30 ms 37976 KB Output is correct
15 Correct 38 ms 39428 KB Output is correct
16 Correct 25 ms 37816 KB Output is correct
17 Correct 27 ms 37788 KB Output is correct
18 Correct 40 ms 39596 KB Output is correct
19 Correct 39 ms 39484 KB Output is correct
20 Correct 28 ms 37724 KB Output is correct
21 Correct 53 ms 40276 KB Output is correct
22 Correct 53 ms 40272 KB Output is correct
23 Correct 54 ms 40532 KB Output is correct
24 Correct 57 ms 40272 KB Output is correct
25 Correct 56 ms 40272 KB Output is correct
26 Correct 58 ms 40316 KB Output is correct
27 Correct 56 ms 40308 KB Output is correct
28 Correct 55 ms 40284 KB Output is correct
29 Correct 56 ms 40472 KB Output is correct
30 Correct 55 ms 40276 KB Output is correct
31 Correct 1 ms 10584 KB Output is correct
32 Correct 1 ms 10588 KB Output is correct
33 Correct 1 ms 10588 KB Output is correct
34 Correct 1 ms 10588 KB Output is correct
35 Correct 1 ms 10588 KB Output is correct
36 Correct 1 ms 10584 KB Output is correct
37 Correct 1 ms 10588 KB Output is correct
38 Correct 2 ms 10676 KB Output is correct
39 Correct 1 ms 10588 KB Output is correct
40 Correct 1 ms 10588 KB Output is correct
41 Correct 1 ms 10588 KB Output is correct
42 Correct 1 ms 10588 KB Output is correct
43 Correct 1 ms 10588 KB Output is correct
44 Correct 1 ms 10588 KB Output is correct
45 Correct 1 ms 10588 KB Output is correct
46 Correct 1 ms 10588 KB Output is correct
47 Correct 1 ms 10668 KB Output is correct
48 Correct 1 ms 10588 KB Output is correct
49 Correct 2 ms 10588 KB Output is correct
50 Correct 1 ms 10588 KB Output is correct
51 Correct 2 ms 10584 KB Output is correct
52 Correct 2 ms 10584 KB Output is correct
53 Correct 1 ms 10588 KB Output is correct
54 Correct 2 ms 10588 KB Output is correct
55 Correct 1 ms 10588 KB Output is correct
56 Correct 2 ms 10836 KB Output is correct
57 Correct 1 ms 10588 KB Output is correct
58 Correct 2 ms 10588 KB Output is correct
59 Correct 1 ms 10588 KB Output is correct
60 Correct 2 ms 10588 KB Output is correct
61 Correct 55 ms 40136 KB Output is correct
62 Correct 54 ms 40404 KB Output is correct
63 Correct 55 ms 40096 KB Output is correct
64 Correct 53 ms 40220 KB Output is correct
65 Correct 53 ms 40276 KB Output is correct
66 Correct 53 ms 40276 KB Output is correct
67 Correct 53 ms 40164 KB Output is correct
68 Correct 53 ms 40272 KB Output is correct
69 Correct 54 ms 40184 KB Output is correct
70 Correct 52 ms 40020 KB Output is correct