oj.uz

답안 #337009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337009 2020-12-17T21:10:20 Z alishahali1382 Cake 3 (JOI19_cake3) C++14
100 / 100
 1898 ms 41052 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=200010, LOG=20;

ll ans=-INF;
int n, m, k, u, v, x, y, t, a, b, shit;
pii A[MAXN];
int mark[MAXN];

struct Set{
//	multiset<int> X, Y;
	priority_queue<pii, vector<pii>, greater<pii>> X;
	priority_queue<pii> Y;  
	ll sum=0, sz=0;
	inline void add(int i){
//		if (shit++==10000000) cout<<1/0;
		int x=A[i].second;
		X.push({x, i});
		mark[i]=1;
		sum+=x;
		sz++;
		while (sz>k){
			pii p=X.top();
			X.pop();
			if (mark[p.second]!=1) continue ;
			sz--;
			sum-=p.first;
			mark[p.second]=2;
			Y.push(p);
		}
	}
	inline void rem(int i){
		int x=A[i].second;
//		if (shit++==10000000) cout<<1/0;
		if (mark[i]==2){
			mark[i]=0;
			return ;
		}
		mark[i]=0;
		sum-=x;
		sz--;
		while (sz<k && Y.size()){
			pii p=Y.top();
			Y.pop();
			if (mark[p.second]!=2) continue ;
			mark[p.second]=1;
			sz++;
			sum+=p.first;
			X.push(p);
		}
	}
} S;
inline void Move(int L, int R, int l, int r){
	while (l<L) S.add(--L);
	while (R<r) S.add(R++);
	while (L<l) S.rem(L++);
	while (r<R) S.rem(--R);
}
void divide(int tl, int tr, int optl, int optr){
	if (tr<tl) return ;
	int mid=(tl+tr)>>1, opt=-1;
	ll val=-INF;
	for (int i=tl; i<=mid; i++) S.add(i);
	for (int i=optl; i<=min(mid-k+1, optr); i++){
		ll c=S.sum - 2*(A[mid].first-A[i].first);
		if (c>val){
			val=c;
			opt=i;
		}
		S.rem(i);
	}
	ans=max(ans, val);
	for (int i=optl; i<=min(mid-k+1, optr); i++) S.add(i);
	Move(optl, mid+1, opt, mid+1);
	divide(mid+1, tr, opt, optr);
	Move(opt, mid+1, optl, tl);
	divide(tl, mid-1, optl, opt);
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//	freopen("test.in", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>k;
	for (int i=1; i<=n; i++) cin>>A[i].second>>A[i].first;
	sort(A+1, A+n+1);
	for (int i=1; i<k; i++) S.add(i);
	divide(k, n, 1, n-k+1);
	cout<<ans<<"\n";
	
	return 0;
}
/*
5 3
2 1
4 2
6 4
8 8
10 16



*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 364 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 364 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 384 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 384 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

# 결과 실행 시간 메모리 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 364 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 364 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 384 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 7 ms 620 KB Output is correct
39 Correct 7 ms 620 KB Output is correct
40 Correct 4 ms 620 KB Output is correct
41 Correct 6 ms 640 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 7 ms 620 KB Output is correct
45 Correct 7 ms 620 KB Output is correct
46 Correct 8 ms 620 KB Output is correct
47 Correct 9 ms 748 KB Output is correct
48 Correct 8 ms 620 KB Output is correct
49 Correct 6 ms 620 KB Output is correct
50 Correct 6 ms 620 KB Output is correct
51 Correct 6 ms 620 KB Output is correct
52 Correct 5 ms 620 KB Output is correct
53 Correct 6 ms 620 KB Output is correct
54 Correct 3 ms 620 KB Output is correct
55 Correct 3 ms 620 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 3 ms 620 KB Output is correct
58 Correct 3 ms 620 KB Output is correct
59 Correct 4 ms 492 KB Output is correct
60 Correct 6 ms 492 KB Output is correct
61 Correct 4 ms 492 KB Output is correct
62 Correct 4 ms 492 KB Output is correct
63 Correct 4 ms 492 KB Output is correct
64 Correct 4 ms 492 KB Output is correct
65 Correct 7 ms 620 KB Output is correct
66 Correct 7 ms 620 KB Output is correct
67 Correct 8 ms 640 KB Output is correct
68 Correct 6 ms 620 KB Output is correct
69 Correct 5 ms 620 KB Output is correct
70 Correct 7 ms 620 KB Output is correct
71 Correct 8 ms 620 KB Output is correct
72 Correct 4 ms 620 KB Output is correct
73 Correct 4 ms 492 KB Output is correct
74 Correct 1 ms 364 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 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 364 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 364 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 384 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 7 ms 620 KB Output is correct
39 Correct 7 ms 620 KB Output is correct
40 Correct 4 ms 620 KB Output is correct
41 Correct 6 ms 640 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 7 ms 620 KB Output is correct
45 Correct 7 ms 620 KB Output is correct
46 Correct 8 ms 620 KB Output is correct
47 Correct 9 ms 748 KB Output is correct
48 Correct 8 ms 620 KB Output is correct
49 Correct 6 ms 620 KB Output is correct
50 Correct 6 ms 620 KB Output is correct
51 Correct 6 ms 620 KB Output is correct
52 Correct 5 ms 620 KB Output is correct
53 Correct 6 ms 620 KB Output is correct
54 Correct 3 ms 620 KB Output is correct
55 Correct 3 ms 620 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 3 ms 620 KB Output is correct
58 Correct 3 ms 620 KB Output is correct
59 Correct 4 ms 492 KB Output is correct
60 Correct 6 ms 492 KB Output is correct
61 Correct 4 ms 492 KB Output is correct
62 Correct 4 ms 492 KB Output is correct
63 Correct 4 ms 492 KB Output is correct
64 Correct 4 ms 492 KB Output is correct
65 Correct 7 ms 620 KB Output is correct
66 Correct 7 ms 620 KB Output is correct
67 Correct 8 ms 640 KB Output is correct
68 Correct 6 ms 620 KB Output is correct
69 Correct 5 ms 620 KB Output is correct
70 Correct 7 ms 620 KB Output is correct
71 Correct 8 ms 620 KB Output is correct
72 Correct 4 ms 620 KB Output is correct
73 Correct 4 ms 492 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1114 ms 23524 KB Output is correct
76 Correct 1286 ms 22340 KB Output is correct
77 Correct 917 ms 20584 KB Output is correct
78 Correct 988 ms 20688 KB Output is correct
79 Correct 68 ms 4600 KB Output is correct
80 Correct 137 ms 6884 KB Output is correct
81 Correct 1451 ms 37308 KB Output is correct
82 Correct 1833 ms 41052 KB Output is correct
83 Correct 1734 ms 37204 KB Output is correct
84 Correct 1742 ms 37312 KB Output is correct
85 Correct 1498 ms 37436 KB Output is correct
86 Correct 782 ms 19792 KB Output is correct
87 Correct 843 ms 19920 KB Output is correct
88 Correct 1330 ms 37052 KB Output is correct
89 Correct 1222 ms 36560 KB Output is correct
90 Correct 824 ms 20260 KB Output is correct
91 Correct 466 ms 19572 KB Output is correct
92 Correct 496 ms 19408 KB Output is correct
93 Correct 625 ms 19792 KB Output is correct
94 Correct 366 ms 19536 KB Output is correct
95 Correct 780 ms 19920 KB Output is correct
96 Correct 846 ms 19964 KB Output is correct
97 Correct 946 ms 20056 KB Output is correct
98 Correct 967 ms 20352 KB Output is correct
99 Correct 849 ms 11876 KB Output is correct
100 Correct 665 ms 11364 KB Output is correct
101 Correct 692 ms 11532 KB Output is correct
102 Correct 1550 ms 37592 KB Output is correct
103 Correct 1515 ms 40792 KB Output is correct
104 Correct 1898 ms 23500 KB Output is correct
105 Correct 1211 ms 39480 KB Output is correct
106 Correct 1195 ms 39484 KB Output is correct
107 Correct 998 ms 40416 KB Output is correct
108 Correct 903 ms 23888 KB Output is correct
109 Correct 650 ms 24696 KB Output is correct
110 Correct 684 ms 22096 KB Output is correct
111 Correct 1202 ms 38336 KB Output is correct
112 Correct 639 ms 22232 KB Output is correct
113 Correct 75 ms 8552 KB Output is correct