oj.uz

Submission #197437

# Submission time Handle Problem Language Result Execution time Memory
197437 2020-01-21T07:30:45 Z dennisstar Cake 3 (JOI19_cake3) C++11
100 / 100
 947 ms 97524 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ryan bear
#define sq(X) ((X)*(X))
#define eb emplace_back
#define all(V) (V).begin(), (V).end()
#define unq(V) (V).erase(unique(all(V)), (V).end())
using namespace std;
typedef long long ll;
typedef vector<ll> vlm;
typedef vector<int> vim;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

vector<pll> C; vlm cp; ll ans=-(1ll<<60);
int N, M, O;

inline int Find(ll x) { return lower_bound(all(cp), x)-cp.begin(); }

struct node {
	int cnt; ll val;
	int l, r;
}nd[5000010]; int nd_tp=1;
int new_node() { return nd_tp++; }

int root[200010];

void upd(int now, int l, int t, int s, int e) {
	nd[now].cnt = nd[l].cnt + 1;
	nd[now].val = nd[l].val + cp[t];
	if (s==e) return ;
	int md=(s+e)/2;
	if (t<=md) {
		nd[now].l=new_node(); nd[now].r=nd[l].r;
		upd(nd[now].l, nd[l].l, t, s, md);
	}
	else {
		nd[now].l=nd[l].l; nd[now].r=new_node();
		upd(nd[now].r, nd[l].r, t, md+1, e);
	}
}

ll get(int n1, int n2, int s, int e, int c) {
	assert(c>=0);
	if (s==e) return c*cp[s];
	int md=(s+e)/2;
	if (nd[nd[n2].r].cnt-nd[nd[n1].r].cnt >= c) return get(nd[n1].r, nd[n2].r, md+1, e, c);
	else return nd[nd[n2].r].val-nd[nd[n1].r].val + get(nd[n1].l, nd[n2].l, s, md, c-(nd[nd[n2].r].cnt-nd[nd[n1].r].cnt));
}

void f(int s1, int e1, int s2, int e2) {
	if (s1>e1 || s2>e2) return ;
	int md=(s1+e1)/2; ll mx=-(1ll<<60), mi=0;
	for (int i=s2; i<=min(e2, md-M+1); i++) {
		ll ret=get(root[i], root[md-1], 0, O, M-2);
		ret = ret+C[i].se+C[md].se - 2*(C[md].fi-C[i].fi);
		if (mx<ret) mx=ret, mi=i;
	}
	ans=max(ans, mx);
	f(s1, md-1, s2, mi); f(md+1, e1, mi, e2);
}

int main() {
	scanf("%d %d", &N, &M);
	C.resize(N);
	for (auto &i:C) {
		scanf("%lld %lld", &i.se, &i.fi);
		cp.eb(i.se);
	}
	sort(all(C)); sort(all(cp)); unq(cp); O=cp.size();
	for (int i=0; i<=N; i++) {
		root[i]=new_node();
		if (i) upd(root[i], root[i-1], Find(C[i].se), 0, O);
	}
	f(M-1, N-1, 0, N-1);
	printf("%lld\n", ans);
	return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:67:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~~
cake3.cpp:70:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld", &i.se, &i.fi);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 400 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 5 ms 1016 KB Output is correct
39 Correct 5 ms 1016 KB Output is correct
40 Correct 5 ms 888 KB Output is correct
41 Correct 5 ms 892 KB Output is correct
42 Correct 4 ms 1016 KB Output is correct
43 Correct 5 ms 1016 KB Output is correct
44 Correct 5 ms 892 KB Output is correct
45 Correct 5 ms 1016 KB Output is correct
46 Correct 7 ms 1016 KB Output is correct
47 Correct 3 ms 888 KB Output is correct
48 Correct 5 ms 888 KB Output is correct
49 Correct 5 ms 1016 KB Output is correct
50 Correct 5 ms 1016 KB Output is correct
51 Correct 5 ms 996 KB Output is correct
52 Correct 5 ms 1016 KB Output is correct
53 Correct 5 ms 1016 KB Output is correct
54 Correct 4 ms 1016 KB Output is correct
55 Correct 4 ms 888 KB Output is correct
56 Correct 4 ms 912 KB Output is correct
57 Correct 4 ms 888 KB Output is correct
58 Correct 4 ms 1016 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 3 ms 504 KB Output is correct
63 Correct 2 ms 504 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 5 ms 888 KB Output is correct
66 Correct 3 ms 1016 KB Output is correct
67 Correct 2 ms 888 KB Output is correct
68 Correct 5 ms 1016 KB Output is correct
69 Correct 5 ms 888 KB Output is correct
70 Correct 6 ms 1016 KB Output is correct
71 Correct 3 ms 632 KB Output is correct
72 Correct 3 ms 632 KB Output is correct
73 Correct 5 ms 1016 KB Output is correct
74 Correct 4 ms 1016 KB Output is correct
75 Correct 858 ms 90576 KB Output is correct
76 Correct 947 ms 88040 KB Output is correct
77 Correct 759 ms 90728 KB Output is correct
78 Correct 802 ms 92136 KB Output is correct
79 Correct 278 ms 92536 KB Output is correct
80 Correct 321 ms 89832 KB Output is correct
81 Correct 491 ms 78412 KB Output is correct
82 Correct 663 ms 83060 KB Output is correct
83 Correct 562 ms 82792 KB Output is correct
84 Correct 643 ms 83304 KB Output is correct
85 Correct 501 ms 79180 KB Output is correct
86 Correct 310 ms 74124 KB Output is correct
87 Correct 322 ms 73768 KB Output is correct
88 Correct 458 ms 74824 KB Output is correct
89 Correct 406 ms 77800 KB Output is correct
90 Correct 324 ms 79336 KB Output is correct
91 Correct 253 ms 72684 KB Output is correct
92 Correct 254 ms 72168 KB Output is correct
93 Correct 282 ms 75368 KB Output is correct
94 Correct 246 ms 77416 KB Output is correct
95 Correct 317 ms 79208 KB Output is correct
96 Correct 92 ms 17000 KB Output is correct
97 Correct 97 ms 18232 KB Output is correct
98 Correct 97 ms 17896 KB Output is correct
99 Correct 94 ms 18024 KB Output is correct
100 Correct 87 ms 17000 KB Output is correct
101 Correct 88 ms 17000 KB Output is correct
102 Correct 418 ms 64616 KB Output is correct
103 Correct 373 ms 63564 KB Output is correct
104 Correct 406 ms 68584 KB Output is correct
105 Correct 285 ms 63976 KB Output is correct
106 Correct 299 ms 65512 KB Output is correct
107 Correct 281 ms 62312 KB Output is correct
108 Correct 749 ms 91692 KB Output is correct
109 Correct 640 ms 97256 KB Output is correct
110 Correct 106 ms 28008 KB Output is correct
111 Correct 119 ms 28264 KB Output is correct
112 Correct 311 ms 86120 KB Output is correct
113 Correct 297 ms 97524 KB Output is correct