Submission #840613

# Submission time Handle Problem Language Result Execution time Memory
840613 2023-08-31T14:28:14 Z beepbeepsheep Cake 3 (JOI19_cake3) C++17
100 / 100
1384 ms 18204 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef tree<long long, null_type, less_equal<>,
        rb_tree_tag, tree_order_statistics_node_update>
        ordered_set;
#define ll long long
#define ii pair<ll,ll>

#ifndef DEBUG
#define cerr if (0) cerr
#define endl '\n'
#endif

const ll inf=1e15;
const ll maxn=2e5+5;
const ll mod=1e9+7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll n,k;
ll dp[maxn],cnt[maxn],fen[maxn],arr[maxn];
pair<ii,ll> ord[maxn];
ll inv[maxn];
ll h[maxn];
ll lptr,rptr;
void upd(ll *arr, ll x, ll v){
	while (x<maxn){
		arr[x]+=v;
		x+=(x&-x);
	}
}
ll query(ll *arr, ll x){
	ll ans=0;
	while (x){
		ans+=arr[x];
		x-=(x&-x);
	}
	return ans;
}
ll query(ll *arr, ll x, ll y){
	return query(arr,y)-query(arr,x-1);
}
void add(ll x){
	upd(cnt,inv[x],1);
	upd(fen,inv[x],arr[x]);
}
void sub(ll x){
	upd(cnt,inv[x],-1);
	upd(fen,inv[x],-arr[x]);
}
ll qry(ll l, ll r){
	while (lptr>l) add(--lptr);
	while (lptr<l) sub(lptr++);
	while (rptr>r) sub(rptr--);
	while (rptr<r) add(++rptr);
	ll le=0,ri=n,m;
	while (le!=ri-1){
		m=(le+ri)>>1;
		if (query(cnt,m,n)>k) le=m;
		else ri=m;
	}
	if (query(cnt,ri,n)!=k) return -inf;
	return query(fen,ri,n)-2*(h[r]-h[l]);
	
}
void dnc(ll l, ll r, ll optl, ll optr){
	if (l>r) return;
	ll m=(l+r)>>1,opt=optl,res=-inf;
	for (int i=optl;i<=min(m,optr);i++){
		res=qry(i,m);
		if (res>dp[m]) dp[m]=res,opt=i;
	}
	dnc(l,m-1,optl,opt);
	dnc(m+1,r,opt,optr);
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>k;
	for (int i=1;i<=n;i++){
		dp[i]=-inf;
		cin>>ord[i].first.second>>ord[i].first.first;
	}
	sort(ord+1,ord+1+n);
	for (int i=1;i<=n;i++){
		h[i]=ord[i].first.first;
		arr[i]=ord[i].first.second;
		ord[i].second=i;
		swap(ord[i].first.first,ord[i].first.second);
	}
	sort(ord+1,ord+1+n);
	for (int i=1;i<=n;i++){
		inv[ord[i].second]=i;
	}
	lptr=1,rptr=1;
	add(1);
	dnc(1,n,1,n);
	cout<<*max_element(dp+1,dp+n+1);
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 468 KB Output is correct
39 Correct 5 ms 596 KB Output is correct
40 Correct 5 ms 596 KB Output is correct
41 Correct 4 ms 592 KB Output is correct
42 Correct 4 ms 600 KB Output is correct
43 Correct 4 ms 520 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 5 ms 596 KB Output is correct
46 Correct 5 ms 596 KB Output is correct
47 Correct 5 ms 592 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 5 ms 596 KB Output is correct
50 Correct 5 ms 596 KB Output is correct
51 Correct 5 ms 528 KB Output is correct
52 Correct 4 ms 468 KB Output is correct
53 Correct 4 ms 600 KB Output is correct
54 Correct 4 ms 596 KB Output is correct
55 Correct 4 ms 468 KB Output is correct
56 Correct 4 ms 468 KB Output is correct
57 Correct 4 ms 468 KB Output is correct
58 Correct 4 ms 524 KB Output is correct
59 Correct 6 ms 584 KB Output is correct
60 Correct 4 ms 584 KB Output is correct
61 Correct 6 ms 468 KB Output is correct
62 Correct 4 ms 596 KB Output is correct
63 Correct 4 ms 596 KB Output is correct
64 Correct 4 ms 596 KB Output is correct
65 Correct 5 ms 472 KB Output is correct
66 Correct 7 ms 468 KB Output is correct
67 Correct 5 ms 476 KB Output is correct
68 Correct 5 ms 604 KB Output is correct
69 Correct 5 ms 468 KB Output is correct
70 Correct 4 ms 596 KB Output is correct
71 Correct 4 ms 520 KB Output is correct
72 Correct 4 ms 476 KB Output is correct
73 Correct 4 ms 520 KB Output is correct
74 Correct 4 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 468 KB Output is correct
39 Correct 5 ms 596 KB Output is correct
40 Correct 5 ms 596 KB Output is correct
41 Correct 4 ms 592 KB Output is correct
42 Correct 4 ms 600 KB Output is correct
43 Correct 4 ms 520 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 5 ms 596 KB Output is correct
46 Correct 5 ms 596 KB Output is correct
47 Correct 5 ms 592 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 5 ms 596 KB Output is correct
50 Correct 5 ms 596 KB Output is correct
51 Correct 5 ms 528 KB Output is correct
52 Correct 4 ms 468 KB Output is correct
53 Correct 4 ms 600 KB Output is correct
54 Correct 4 ms 596 KB Output is correct
55 Correct 4 ms 468 KB Output is correct
56 Correct 4 ms 468 KB Output is correct
57 Correct 4 ms 468 KB Output is correct
58 Correct 4 ms 524 KB Output is correct
59 Correct 6 ms 584 KB Output is correct
60 Correct 4 ms 584 KB Output is correct
61 Correct 6 ms 468 KB Output is correct
62 Correct 4 ms 596 KB Output is correct
63 Correct 4 ms 596 KB Output is correct
64 Correct 4 ms 596 KB Output is correct
65 Correct 5 ms 472 KB Output is correct
66 Correct 7 ms 468 KB Output is correct
67 Correct 5 ms 476 KB Output is correct
68 Correct 5 ms 604 KB Output is correct
69 Correct 5 ms 468 KB Output is correct
70 Correct 4 ms 596 KB Output is correct
71 Correct 4 ms 520 KB Output is correct
72 Correct 4 ms 476 KB Output is correct
73 Correct 4 ms 520 KB Output is correct
74 Correct 4 ms 596 KB Output is correct
75 Correct 1284 ms 17088 KB Output is correct
76 Correct 1072 ms 16644 KB Output is correct
77 Correct 1191 ms 17136 KB Output is correct
78 Correct 1198 ms 17388 KB Output is correct
79 Correct 1041 ms 17444 KB Output is correct
80 Correct 899 ms 16964 KB Output is correct
81 Correct 1016 ms 16464 KB Output is correct
82 Correct 1275 ms 16736 KB Output is correct
83 Correct 1000 ms 17316 KB Output is correct
84 Correct 978 ms 17208 KB Output is correct
85 Correct 1255 ms 16624 KB Output is correct
86 Correct 930 ms 16056 KB Output is correct
87 Correct 810 ms 15912 KB Output is correct
88 Correct 1223 ms 15768 KB Output is correct
89 Correct 1177 ms 16616 KB Output is correct
90 Correct 820 ms 17312 KB Output is correct
91 Correct 964 ms 16048 KB Output is correct
92 Correct 882 ms 15832 KB Output is correct
93 Correct 1014 ms 16588 KB Output is correct
94 Correct 904 ms 17248 KB Output is correct
95 Correct 858 ms 17360 KB Output is correct
96 Correct 861 ms 16108 KB Output is correct
97 Correct 926 ms 17460 KB Output is correct
98 Correct 1384 ms 17068 KB Output is correct
99 Correct 757 ms 17028 KB Output is correct
100 Correct 864 ms 16172 KB Output is correct
101 Correct 883 ms 16104 KB Output is correct
102 Correct 1130 ms 16180 KB Output is correct
103 Correct 1104 ms 16048 KB Output is correct
104 Correct 1266 ms 16796 KB Output is correct
105 Correct 1107 ms 16764 KB Output is correct
106 Correct 903 ms 17204 KB Output is correct
107 Correct 1025 ms 16600 KB Output is correct
108 Correct 1064 ms 17128 KB Output is correct
109 Correct 964 ms 18156 KB Output is correct
110 Correct 1059 ms 15688 KB Output is correct
111 Correct 941 ms 15912 KB Output is correct
112 Correct 737 ms 15180 KB Output is correct
113 Correct 818 ms 18204 KB Output is correct