Submission #203365

# Submission time Handle Problem Language Result Execution time Memory
203365 2020-02-20T11:22:36 Z Noam527 Cake 3 (JOI19_cake3) C++17
100 / 100
3394 ms 15100 KB
#include <bits/stdc++.h>
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 4e18;
const int OO = 0;
const int OOO = 1;
using namespace std;

struct order {
	int m, newtime;
	ll sum;
	set<pair<int, int>> s;
	set<pair<int, int>>::iterator it;
	int stores;
	order() {}
	order(int M) {
		m = M;
		newtime = 0;
		sum = -1;

		s.insert({ -1, newtime++ });
		it = s.begin();
		stores = 1;
	}
	void fix() {
		while (stores < m) {
			if (it == s.begin()) break;
			--it;
			++stores;
			sum += it->first;
		}
		while (stores > m) {
			if (next(it) == s.end()) break;
			--stores;
			sum -= it->first;
			++it;
		}
	}
	void insert(int x) {
		s.insert({ x, newtime++ });
		if (it->first <= x) {
			stores++;
			sum += x;
		}
	}
	void erase(int x) {
		auto rit = s.lower_bound({ x, -1 });
		if (rit == it) {
			sum -= x;
			--it;
			sum += it->first;
			s.erase(rit);
			return;
		}
		if (x > it->first) {
			sum -= x;
			--stores;
			s.erase(rit);
			return;
		}
		s.erase(rit);
	}
	ll query() {
		fix();
		return sum;
	}
};

int n, m;
vector<pair<int, int>> a;
int L = 0, R = -1;
order S;

ll query(int l, int r) {
	if (r - l + 1 < m) return -inf;
	while (R < r)
		S.insert(a[++R].first);
	while (L < l)
		S.erase(a[L++].first);
	while (l < L)
		S.insert(a[--L].first);
	while (r < R)
		S.erase(a[R--].first);
	return S.query();
}

ll calc(int st, int en, int optl, int optr) {
	en = min(en, optr - m + 1);
	if (st > en) return -inf;
	if (OO) {
		cout << "at calc(" << st << ", " << en << ", " << optl << ", " << optr << ")\n";
	}
	int mid = (st + en) / 2;
	
	int at = -1;
	ll mx = -inf;
	for (int i = max(mid, optl); i <= optr; i++) {
		ll res = query(mid, i) - 2 * (a[i].second - a[mid].second);
		if (mx < res) {
			mx = res;
			at = i;
		}
	}
	if (OO) {
		cout << "the best for " << mid << " is " << at << ", with worth " << mx << '\n';
	}
	mx = max(mx, calc(st, mid - 1, optl, at));
	mx = max(mx, calc(mid + 1, en, at, optr));
	return mx;
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;
	a.resize(n);
	S = order(m);

	for (auto &i : a) cin >> i.first >> i.second;
	sort(a.begin(), a.end(), [](const pair<int, int> &aa, const pair<int, int> &bb) {
		return aa.second < bb.second;
	});
	cout << calc(0, n - 1, 0, n - 1) << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 280 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 380 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 280 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 380 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 10 ms 504 KB Output is correct
39 Correct 11 ms 504 KB Output is correct
40 Correct 8 ms 504 KB Output is correct
41 Correct 9 ms 504 KB Output is correct
42 Correct 7 ms 504 KB Output is correct
43 Correct 8 ms 632 KB Output is correct
44 Correct 10 ms 504 KB Output is correct
45 Correct 10 ms 504 KB Output is correct
46 Correct 10 ms 504 KB Output is correct
47 Correct 10 ms 504 KB Output is correct
48 Correct 10 ms 376 KB Output is correct
49 Correct 9 ms 504 KB Output is correct
50 Correct 9 ms 504 KB Output is correct
51 Correct 9 ms 504 KB Output is correct
52 Correct 8 ms 504 KB Output is correct
53 Correct 9 ms 504 KB Output is correct
54 Correct 8 ms 504 KB Output is correct
55 Correct 7 ms 504 KB Output is correct
56 Correct 7 ms 504 KB Output is correct
57 Correct 7 ms 504 KB Output is correct
58 Correct 7 ms 504 KB Output is correct
59 Correct 7 ms 504 KB Output is correct
60 Correct 9 ms 508 KB Output is correct
61 Correct 8 ms 504 KB Output is correct
62 Correct 7 ms 504 KB Output is correct
63 Correct 8 ms 504 KB Output is correct
64 Correct 7 ms 504 KB Output is correct
65 Correct 10 ms 504 KB Output is correct
66 Correct 9 ms 504 KB Output is correct
67 Correct 10 ms 504 KB Output is correct
68 Correct 9 ms 504 KB Output is correct
69 Correct 9 ms 504 KB Output is correct
70 Correct 9 ms 504 KB Output is correct
71 Correct 9 ms 376 KB Output is correct
72 Correct 7 ms 504 KB Output is correct
73 Correct 11 ms 504 KB Output is correct
74 Correct 6 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 280 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 380 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 10 ms 504 KB Output is correct
39 Correct 11 ms 504 KB Output is correct
40 Correct 8 ms 504 KB Output is correct
41 Correct 9 ms 504 KB Output is correct
42 Correct 7 ms 504 KB Output is correct
43 Correct 8 ms 632 KB Output is correct
44 Correct 10 ms 504 KB Output is correct
45 Correct 10 ms 504 KB Output is correct
46 Correct 10 ms 504 KB Output is correct
47 Correct 10 ms 504 KB Output is correct
48 Correct 10 ms 376 KB Output is correct
49 Correct 9 ms 504 KB Output is correct
50 Correct 9 ms 504 KB Output is correct
51 Correct 9 ms 504 KB Output is correct
52 Correct 8 ms 504 KB Output is correct
53 Correct 9 ms 504 KB Output is correct
54 Correct 8 ms 504 KB Output is correct
55 Correct 7 ms 504 KB Output is correct
56 Correct 7 ms 504 KB Output is correct
57 Correct 7 ms 504 KB Output is correct
58 Correct 7 ms 504 KB Output is correct
59 Correct 7 ms 504 KB Output is correct
60 Correct 9 ms 508 KB Output is correct
61 Correct 8 ms 504 KB Output is correct
62 Correct 7 ms 504 KB Output is correct
63 Correct 8 ms 504 KB Output is correct
64 Correct 7 ms 504 KB Output is correct
65 Correct 10 ms 504 KB Output is correct
66 Correct 9 ms 504 KB Output is correct
67 Correct 10 ms 504 KB Output is correct
68 Correct 9 ms 504 KB Output is correct
69 Correct 9 ms 504 KB Output is correct
70 Correct 9 ms 504 KB Output is correct
71 Correct 9 ms 376 KB Output is correct
72 Correct 7 ms 504 KB Output is correct
73 Correct 11 ms 504 KB Output is correct
74 Correct 6 ms 504 KB Output is correct
75 Correct 2204 ms 14200 KB Output is correct
76 Correct 2467 ms 13920 KB Output is correct
77 Correct 2056 ms 14328 KB Output is correct
78 Correct 2140 ms 14584 KB Output is correct
79 Correct 197 ms 14416 KB Output is correct
80 Correct 462 ms 14072 KB Output is correct
81 Correct 2781 ms 12152 KB Output is correct
82 Correct 3342 ms 12024 KB Output is correct
83 Correct 3274 ms 12664 KB Output is correct
84 Correct 3394 ms 12408 KB Output is correct
85 Correct 2910 ms 12280 KB Output is correct
86 Correct 1603 ms 12280 KB Output is correct
87 Correct 1647 ms 12024 KB Output is correct
88 Correct 2320 ms 11640 KB Output is correct
89 Correct 2348 ms 12536 KB Output is correct
90 Correct 1635 ms 13176 KB Output is correct
91 Correct 1020 ms 12496 KB Output is correct
92 Correct 1060 ms 12408 KB Output is correct
93 Correct 1290 ms 12792 KB Output is correct
94 Correct 883 ms 13688 KB Output is correct
95 Correct 1534 ms 13432 KB Output is correct
96 Correct 497 ms 11896 KB Output is correct
97 Correct 565 ms 12792 KB Output is correct
98 Correct 559 ms 12408 KB Output is correct
99 Correct 502 ms 12792 KB Output is correct
100 Correct 425 ms 12152 KB Output is correct
101 Correct 448 ms 12280 KB Output is correct
102 Correct 1402 ms 11640 KB Output is correct
103 Correct 1323 ms 11540 KB Output is correct
104 Correct 1462 ms 11900 KB Output is correct
105 Correct 1414 ms 12536 KB Output is correct
106 Correct 1342 ms 12792 KB Output is correct
107 Correct 1127 ms 12536 KB Output is correct
108 Correct 1914 ms 14176 KB Output is correct
109 Correct 1726 ms 15096 KB Output is correct
110 Correct 804 ms 11768 KB Output is correct
111 Correct 1189 ms 11256 KB Output is correct
112 Correct 2140 ms 12408 KB Output is correct
113 Correct 197 ms 15100 KB Output is correct