oj.uz

Submission #376823

# Submission time Handle Problem Language Result Execution time Memory
376823 2021-03-12T05:07:39 Z casperwang Cake 3 (JOI19_cake3) C++14
100 / 100
 2970 ms 26172 KB 
#include <bits/stdc++.h>
#define int long long
#define tiiii tuple<int,int,int,int>
#define pb emplace_back
#define All(x) x.begin(), x.end()
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 200000;
const int INF = 1e18;
int N, M;
int ans = -INF;
struct Node {
	int c, v, vid;
} arr[MAXN+1];

class Seg {
	private:
		int cnt[MAXN*4+5];
		int sum[MAXN*4+5];
		void pull(int now) {
			cnt[now] = cnt[now*2] + cnt[now*2+1];
			sum[now] = sum[now*2] * (cnt[now*2] > 0) + sum[now*2+1] * (cnt[now*2+1] > 0);
		}
	public:
		void build(int now=1, int l=1, int r=N) {
			if (l == r) {
				sum[now] = arr[l].v;
				cnt[now] = 0;
				return;
			}
			int mid = l + r >> 1;
			build(now*2  , l, mid);
			build(now*2+1,mid+1,r);
			pull(now);
		}
		void mdy(int p, int k, int now=1, int l=1, int r=N) {
			if (l == p && r == p) {
				cnt[now] += k;
				return;
			} else if (l > p || r < p) return;
			int mid = l + r >> 1;
			mdy(p, k, now*2  , l, mid);
			mdy(p, k, now*2+1,mid+1,r);
			pull(now);
		}
		int qry(int k, int now=1, int l=1, int r=N) {
			if (k == cnt[now]) {
				return sum[now];
			}
			int mid = l + r >> 1, s = 0;
			s += qry(min(cnt[now*2], k), now*2, l, mid);
			if (cnt[now*2] < k)
				s += qry(k - cnt[now*2], now*2+1, mid+1, r);
			return s;
		}
} seg;

void solve(vector<tiiii> qry) {
	vector <tiiii> nxt;
	int nowL = 1, nowR = 0;
	for (auto [L, R, l, r] : qry) {
		int mid = L + R >> 1;
		int K = arr[mid].v + 2 * arr[mid].c;
		pii mmax(-INF, -1);
		while (nowR+1 < l) {
			nowR++;
			seg.mdy(arr[nowR].vid, 1);
		}
		while (nowL <= mid) {
			seg.mdy(arr[nowL].vid, -1);
			nowL++;
		}
		if (nowR - nowL + 1 >= M-2) {
			//debug(nowR+1, K + seg.qry(M-2) + arr[nowR+1].v - 2 * arr[nowR+1].c);
			mmax = max(mmax, pii(K + seg.qry(M-2) + arr[nowR+1].v - 2 * arr[nowR+1].c, nowR+1));
		}
		while (nowR+1 < r) {
			nowR++;
			seg.mdy(arr[nowR].vid, 1);
			if (nowR - nowL + 1 >= M-2) {
				//debug(nowR+1, K + seg.qry(M-2) + arr[nowR+1].v - 2 * arr[nowR+1].c);
				mmax = max(mmax, pii(K + seg.qry(M-2) + arr[nowR+1].v - 2 * arr[nowR+1].c, nowR+1));
			}
		}
		ans = max(ans, mmax.ff);
		if (mid > L)
			nxt.pb(L, mid-1, l, mmax.ss);
		if (R > mid)
			nxt.pb(mid+1, R, mmax.ss, r);
	}
	while (nowL <= nowR)
		seg.mdy(arr[nowL++].vid, -1);
	if (nxt.size())
		solve(nxt);
}

signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= N; i++) {
		cin >> arr[i].v >> arr[i].c;
	}
	sort(arr+1, arr+1+N, [](const Node a, const Node b) {
		return a.v > b.v;
	});
	for (int i = 1; i <= N; i++) {
		arr[i].vid = i;
	}
	seg.build();
	sort(arr+1, arr+1+N, [](const Node a, const Node b) {
		return a.c < b.c;
	});
	vector <tiiii> I;
	I.pb(1, N-M+1, M, N);
	solve(I);
	cout << ans << '\n';
}

Compilation message

cake3.cpp: In member function 'void Seg::build(long long int, long long int, long long int)':
cake3.cpp:38:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |    int mid = l + r >> 1;
      |              ~~^~~
cake3.cpp: In member function 'void Seg::mdy(long long int, long long int, long long int, long long int, long long int)':
cake3.cpp:48:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |    int mid = l + r >> 1;
      |              ~~^~~
cake3.cpp: In member function 'long long int Seg::qry(long long int, long long int, long long int, long long int)':
cake3.cpp:57:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |    int mid = l + r >> 1, s = 0;
      |              ~~^~~
cake3.cpp: In function 'void solve(std::vector<std::tuple<long long int, long long int, long long int, long long int> >)':
cake3.cpp:68:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   68 |  for (auto [L, R, l, r] : qry) {
      |            ^
cake3.cpp:69:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   69 |   int mid = L + R >> 1;
      |             ~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 8 ms 620 KB Output is correct
39 Correct 9 ms 620 KB Output is correct
40 Correct 8 ms 620 KB Output is correct
41 Correct 9 ms 620 KB Output is correct
42 Correct 7 ms 492 KB Output is correct
43 Correct 7 ms 492 KB Output is correct
44 Correct 8 ms 620 KB Output is correct
45 Correct 8 ms 620 KB Output is correct
46 Correct 9 ms 620 KB Output is correct
47 Correct 8 ms 620 KB Output is correct
48 Correct 8 ms 620 KB Output is correct
49 Correct 8 ms 620 KB Output is correct
50 Correct 8 ms 620 KB Output is correct
51 Correct 8 ms 620 KB Output is correct
52 Correct 7 ms 620 KB Output is correct
53 Correct 8 ms 620 KB Output is correct
54 Correct 7 ms 512 KB Output is correct
55 Correct 8 ms 492 KB Output is correct
56 Correct 6 ms 492 KB Output is correct
57 Correct 7 ms 492 KB Output is correct
58 Correct 7 ms 492 KB Output is correct
59 Correct 7 ms 620 KB Output is correct
60 Correct 8 ms 620 KB Output is correct
61 Correct 8 ms 620 KB Output is correct
62 Correct 8 ms 620 KB Output is correct
63 Correct 7 ms 620 KB Output is correct
64 Correct 8 ms 620 KB Output is correct
65 Correct 9 ms 748 KB Output is correct
66 Correct 7 ms 620 KB Output is correct
67 Correct 7 ms 620 KB Output is correct
68 Correct 8 ms 620 KB Output is correct
69 Correct 7 ms 620 KB Output is correct
70 Correct 7 ms 620 KB Output is correct
71 Correct 7 ms 620 KB Output is correct
72 Correct 7 ms 620 KB Output is correct
73 Correct 6 ms 620 KB Output is correct
74 Correct 2 ms 492 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 8 ms 620 KB Output is correct
39 Correct 9 ms 620 KB Output is correct
40 Correct 8 ms 620 KB Output is correct
41 Correct 9 ms 620 KB Output is correct
42 Correct 7 ms 492 KB Output is correct
43 Correct 7 ms 492 KB Output is correct
44 Correct 8 ms 620 KB Output is correct
45 Correct 8 ms 620 KB Output is correct
46 Correct 9 ms 620 KB Output is correct
47 Correct 8 ms 620 KB Output is correct
48 Correct 8 ms 620 KB Output is correct
49 Correct 8 ms 620 KB Output is correct
50 Correct 8 ms 620 KB Output is correct
51 Correct 8 ms 620 KB Output is correct
52 Correct 7 ms 620 KB Output is correct
53 Correct 8 ms 620 KB Output is correct
54 Correct 7 ms 512 KB Output is correct
55 Correct 8 ms 492 KB Output is correct
56 Correct 6 ms 492 KB Output is correct
57 Correct 7 ms 492 KB Output is correct
58 Correct 7 ms 492 KB Output is correct
59 Correct 7 ms 620 KB Output is correct
60 Correct 8 ms 620 KB Output is correct
61 Correct 8 ms 620 KB Output is correct
62 Correct 8 ms 620 KB Output is correct
63 Correct 7 ms 620 KB Output is correct
64 Correct 8 ms 620 KB Output is correct
65 Correct 9 ms 748 KB Output is correct
66 Correct 7 ms 620 KB Output is correct
67 Correct 7 ms 620 KB Output is correct
68 Correct 8 ms 620 KB Output is correct
69 Correct 7 ms 620 KB Output is correct
70 Correct 7 ms 620 KB Output is correct
71 Correct 7 ms 620 KB Output is correct
72 Correct 7 ms 620 KB Output is correct
73 Correct 6 ms 620 KB Output is correct
74 Correct 2 ms 492 KB Output is correct
75 Correct 2605 ms 24580 KB Output is correct
76 Correct 2661 ms 25724 KB Output is correct
77 Correct 2534 ms 23324 KB Output is correct
78 Correct 2603 ms 24224 KB Output is correct
79 Correct 1298 ms 17008 KB Output is correct
80 Correct 1942 ms 17616 KB Output is correct
81 Correct 2672 ms 23464 KB Output is correct
82 Correct 2894 ms 26136 KB Output is correct
83 Correct 2970 ms 25132 KB Output is correct
84 Correct 2937 ms 25280 KB Output is correct
85 Correct 2662 ms 23832 KB Output is correct
86 Correct 2413 ms 20860 KB Output is correct
87 Correct 2393 ms 21600 KB Output is correct
88 Correct 2440 ms 22608 KB Output is correct
89 Correct 2613 ms 22696 KB Output is correct
90 Correct 2630 ms 22112 KB Output is correct
91 Correct 2201 ms 19276 KB Output is correct
92 Correct 2177 ms 19456 KB Output is correct
93 Correct 2452 ms 20400 KB Output is correct
94 Correct 2454 ms 19108 KB Output is correct
95 Correct 2685 ms 21512 KB Output is correct
96 Correct 2332 ms 23460 KB Output is correct
97 Correct 2529 ms 24684 KB Output is correct
98 Correct 2646 ms 24744 KB Output is correct
99 Correct 2475 ms 23880 KB Output is correct
100 Correct 2279 ms 22036 KB Output is correct
101 Correct 2339 ms 22120 KB Output is correct
102 Correct 1984 ms 24856 KB Output is correct
103 Correct 1841 ms 23960 KB Output is correct
104 Correct 1994 ms 26172 KB Output is correct
105 Correct 1968 ms 23048 KB Output is correct
106 Correct 2020 ms 23300 KB Output is correct
107 Correct 1930 ms 21864 KB Output is correct
108 Correct 2678 ms 23080 KB Output is correct
109 Correct 2784 ms 21928 KB Output is correct
110 Correct 1970 ms 21228 KB Output is correct
111 Correct 2037 ms 24676 KB Output is correct
112 Correct 1350 ms 22568 KB Output is correct
113 Correct 232 ms 17260 KB Output is correct