oj.uz

답안 #557233

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557233 2022-05-04T22:20:21 Z lunchbox Cake 3 (JOI19_cake3) C++17
100 / 100
 726 ms 9548 KB 
/*
https://oj.uz/problem/view/JOI19_cake3
Cake 3
*/
#include <bits/stdc++.h>
using namespace std;

#define N	200000

namespace kactl {

	typedef long long ll;
#define sz(x)	int(x.size())

	/**
	 * Author: Lukas Polacek
	 * Date: 2009-10-30
	 * License: CC0
	 * Source: folklore/TopCoder
	 * Description: Computes partial sums a[0] + a[1] + ... + a[pos - 1], and updates single elements a[i],
	 * taking the difference between the old and new value.
	 * Time: Both operations are $O(\log N)$.
	 * Status: Stress-tested
	 */

	struct FT {
		vector<ll> s;
		vector<int> k;
		void init(int n) {
			s.assign(n, 0);
			k.assign(n, 0);
		}
		void update(int pos, ll dif, int c) { // a[pos] += dif
			// printf("upd[%d] {%lld, %d}\n", pos, dif, c);
			for (; pos < sz(s); pos |= pos + 1) {
				s[pos] += dif;
				k[pos] += c;
			}
		}
		ll query(int pos) { // sum of values in [0, pos)
			ll res = 0;
			for (; pos > 0; pos &= pos - 1) res += s[pos - 1];
			return res;
		}
		int lower_bound(int c) {// min pos st sum of [0, pos] >= sum
			// Returns n if no sum is >= sum, or -1 if empty sum is.
			if (c <= 0) return -1;
			int pos = 0; //ll sum = 0;
			for (int pw = 1 << 25; pw; pw >>= 1) {
				if (pos + pw <= sz(k) && k[pos + pw - 1] < c) {
					pos += pw, c -= k[pos - 1];
					// sum += s[pos-1];
				}
			}
			return pos;
		}
		ll q_(int c) {
			return query(lower_bound(c) + 1);
		}
	} ft;

}

array<int, 2> aa[N];
int ii[N];

int l_ = 0, r_ = -1, m_;

long long query(int l, int r) {
	if (r - l + 1 < m_)
		return -0x3f3f3f3f3f3f3f3f;
	// printf("QUERY [%d, %d]\n", l, r);
	while (l_ < l)
		kactl::ft.update(ii[l_], -aa[l_][1], -1), l_++;
	while (l_ > l)
		l_--, kactl::ft.update(ii[l_], +aa[l_][1], +1);
	while (r_ > r)
		kactl::ft.update(ii[r_], -aa[r_][1], -1), r_--;
	while (r_ < r)
		r_++, kactl::ft.update(ii[r_], +aa[r_][1], +1);
	// printf("%d | ", kactl::ft.lower_bound(m_));
	return kactl::ft.q_(m_) - (long long) 2 * (aa[r][0] - aa[l][0]);
}

long long ans = -0x3f3f3f3f3f3f3f3f;

void dnc(int lo, int ro, int l, int r) {
	long long tmp;
	int m, mo;

	if (l > r)
		return;
	m = (l + r) / 2, mo = lo;
	tmp = query(mo, m);
	// tmp = -0x3f3f3f3f3f3f3f3f;
	for (int i = lo; i <= ro; i++) {
		long long tmp_ = query(i, m);

		if (tmp_ > tmp) {
			tmp = tmp_;
			mo = i;
		}
	}
	ans = max(ans, tmp);
	if (mo == -1) {
		assert(0);
		dnc(lo, ro, m + 1, r);
	} else {
		dnc(lo, mo, l, m - 1);
		dnc(mo, ro, m + 1, r);
	}
}

int main() {
	static int ii_[N];
	int n;

	scanf("%d%d", &n, &m_);
	for (int i = 0; i < n; i++) {
		scanf("%d%d", &aa[i][1], &aa[i][0]);
		ii_[i] = i;
	}
	sort(aa, aa + n);
	sort(ii_, ii_ + n, [&](int i, int j) {
		return aa[i][1] > aa[j][1];
	});
	for (int i = 0; i < n; i++)
		ii[ii_[i]] = i;
	kactl::ft.init(n + 69);
	// for (int i = 0; i < n; i++)
	// 	printf("ii[%d]? = %d\n", i, ii[i]);
	// for (int i = 0; i < n; i++)
	// 	for (int j = i; j < n; j++)
	// 		ans = max(ans, query(i, j));
	// printf("q(%d, %d) = %lld\n", 0, 2, query(0, 2));
	dnc(0, n - 1, 0, n - 1);
	printf("%lld\n", ans);
	return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:118:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |  scanf("%d%d", &n, &m_);
      |  ~~~~~^~~~~~~~~~~~~~~~~
cake3.cpp:120:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |   scanf("%d%d", &aa[i][1], &aa[i][0]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 3 ms 408 KB Output is correct
39 Correct 3 ms 328 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 3 ms 340 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 3 ms 328 KB Output is correct
48 Correct 3 ms 328 KB Output is correct
49 Correct 2 ms 328 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 2 ms 328 KB Output is correct
52 Correct 2 ms 328 KB Output is correct
53 Correct 2 ms 328 KB Output is correct
54 Correct 2 ms 324 KB Output is correct
55 Correct 2 ms 340 KB Output is correct
56 Correct 2 ms 316 KB Output is correct
57 Correct 2 ms 320 KB Output is correct
58 Correct 2 ms 340 KB Output is correct
59 Correct 3 ms 468 KB Output is correct
60 Correct 2 ms 360 KB Output is correct
61 Correct 2 ms 328 KB Output is correct
62 Correct 2 ms 340 KB Output is correct
63 Correct 2 ms 340 KB Output is correct
64 Correct 2 ms 340 KB Output is correct
65 Correct 3 ms 340 KB Output is correct
66 Correct 2 ms 340 KB Output is correct
67 Correct 3 ms 340 KB Output is correct
68 Correct 3 ms 340 KB Output is correct
69 Correct 2 ms 340 KB Output is correct
70 Correct 2 ms 340 KB Output is correct
71 Correct 2 ms 340 KB Output is correct
72 Correct 2 ms 332 KB Output is correct
73 Correct 2 ms 340 KB Output is correct
74 Correct 1 ms 340 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 3 ms 408 KB Output is correct
39 Correct 3 ms 328 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 3 ms 340 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 3 ms 328 KB Output is correct
48 Correct 3 ms 328 KB Output is correct
49 Correct 2 ms 328 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 2 ms 328 KB Output is correct
52 Correct 2 ms 328 KB Output is correct
53 Correct 2 ms 328 KB Output is correct
54 Correct 2 ms 324 KB Output is correct
55 Correct 2 ms 340 KB Output is correct
56 Correct 2 ms 316 KB Output is correct
57 Correct 2 ms 320 KB Output is correct
58 Correct 2 ms 340 KB Output is correct
59 Correct 3 ms 468 KB Output is correct
60 Correct 2 ms 360 KB Output is correct
61 Correct 2 ms 328 KB Output is correct
62 Correct 2 ms 340 KB Output is correct
63 Correct 2 ms 340 KB Output is correct
64 Correct 2 ms 340 KB Output is correct
65 Correct 3 ms 340 KB Output is correct
66 Correct 2 ms 340 KB Output is correct
67 Correct 3 ms 340 KB Output is correct
68 Correct 3 ms 340 KB Output is correct
69 Correct 2 ms 340 KB Output is correct
70 Correct 2 ms 340 KB Output is correct
71 Correct 2 ms 340 KB Output is correct
72 Correct 2 ms 332 KB Output is correct
73 Correct 2 ms 340 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 599 ms 9032 KB Output is correct
76 Correct 704 ms 8828 KB Output is correct
77 Correct 470 ms 9040 KB Output is correct
78 Correct 556 ms 9100 KB Output is correct
79 Correct 113 ms 9160 KB Output is correct
80 Correct 147 ms 8936 KB Output is correct
81 Correct 566 ms 8360 KB Output is correct
82 Correct 627 ms 8524 KB Output is correct
83 Correct 705 ms 8748 KB Output is correct
84 Correct 726 ms 8780 KB Output is correct
85 Correct 558 ms 8396 KB Output is correct
86 Correct 325 ms 8016 KB Output is correct
87 Correct 337 ms 8004 KB Output is correct
88 Correct 496 ms 7952 KB Output is correct
89 Correct 491 ms 8412 KB Output is correct
90 Correct 341 ms 8664 KB Output is correct
91 Correct 212 ms 8060 KB Output is correct
92 Correct 220 ms 8016 KB Output is correct
93 Correct 261 ms 8336 KB Output is correct
94 Correct 194 ms 8780 KB Output is correct
95 Correct 326 ms 8668 KB Output is correct
96 Correct 361 ms 8128 KB Output is correct
97 Correct 410 ms 8696 KB Output is correct
98 Correct 413 ms 8496 KB Output is correct
99 Correct 351 ms 8472 KB Output is correct
100 Correct 260 ms 8124 KB Output is correct
101 Correct 274 ms 8248 KB Output is correct
102 Correct 461 ms 8208 KB Output is correct
103 Correct 442 ms 8044 KB Output is correct
104 Correct 511 ms 8460 KB Output is correct
105 Correct 385 ms 8332 KB Output is correct
106 Correct 407 ms 8524 KB Output is correct
107 Correct 330 ms 8400 KB Output is correct
108 Correct 503 ms 8988 KB Output is correct
109 Correct 405 ms 9416 KB Output is correct
110 Correct 272 ms 7624 KB Output is correct
111 Correct 377 ms 7708 KB Output is correct
112 Correct 324 ms 7356 KB Output is correct
113 Correct 111 ms 9548 KB Output is correct