oj.uz

답안 #712108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
712108 2023-03-18T06:48:07 Z alvingogo Cake 3 (JOI19_cake3) C++14
100 / 100
 3193 ms 40068 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;

vector<pair<int,int> > v;
int n,k;
int ans=-1e18;
vector<pair<int,int> > dp;
struct DS{
	p_q<int,vector<int>,greater<int> > pq,pq2;
	int cnt=0;
	vector<int> v;
	int sum=0;
	void add(int x){
		sum+=x;
		cnt++;
		v.push_back(x);
		pq.push(x);
		if(cnt>k){
			pq2.push(pq.top());
			sum-=pq.top();
			v.push_back({-pq.top()});
			cnt--;
		}
		while(pq.size() && pq2.size() && pq.top()==pq2.top()){
			pq.pop();
			pq2.pop();
		}
	}
	void undo(){
		while(v.back()<0){
			auto h=-v.back();
			v.pop_back();
			pq.push(h);
			cnt++;
			sum+=h;
		}
		pq2.push(v.back());
		sum-=v.back();
		cnt--;
		v.pop_back();
		while(pq.size() && pq2.size() && pq.top()==pq2.top()){
			pq.pop();
			pq2.pop();
		}
	}
	int get(){
		return sum;
	}
}ds;
void dc(int L,int R,int dl,int dr){
	//cal dp[l] to dp[r], where their best transfer point will be in [dl,dr]
	//the (dr,L) is given in ancestor
	if(L>R){
		return;
	}
	//cout << L << " " << R << " " << dl << " " << dr << "\n";
	int m=(L+R)/2;
	for(int i=m;i>=max(L,dr+1);i--){
		ds.add(v[i].fs);	
	}
	for(int i=min(dr,m);i>=dl;i--){
		ds.add(v[i].fs);
		if(m-i+1>=k){
			//cout << ds.get() << " " << v[m].sc-v[i].sc << "\n";
			dp[m]=max(dp[m],{ds.get()-2*(v[m].sc-v[i].sc),i});
		}
	}
	ans=max(ans,dp[m].fs);
	for(int i=min(dr,m);i>=dl;i--){
		ds.undo();
	}
	for(int i=m;i>=max(L,dr+1);i--){
		ds.undo();
	}
	for(int i=dp[m].sc+1;i<=min(L-1,dr);i++){
		ds.add(v[i].fs);
	}
	dc(L,m-1,dl,dp[m].sc);
	for(int i=dp[m].sc+1;i<=min(L-1,dr);i++){
		ds.undo();
	}
	for(int i=max(L,dr+1);i<=m;i++){
		ds.add(v[i].fs);
	}
	dc(m+1,R,dp[m].sc,dr);
	for(int i=max(L,dr+1);i<=m;i++){
		ds.undo();
	}
}
signed main(){
    AquA;
	cin >> n;
	dp.resize(n,{-1e18,-1});
	cin >> k;
	v.resize(n);
	for(int i=0;i<n;i++){
		cin >> v[i].fs >> v[i].sc;
	}
	sort(v.begin(),v.end(),[&](pair<int,int> a,pair<int,int> b){return a.sc<b.sc;});
	for(int i=0;i<n;i++){
		//cout << v[i].fs << " " << v[i].sc << "\n";
	}
	dc(k-1,n-1,0,n-1);
	for(int i=0;i<n;i++){
		//cout << dp[i].fs << " " << dp[i].sc << "\n";
	}
	cout << ans << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 320 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 320 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 320 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 320 KB Output is correct
38 Correct 11 ms 468 KB Output is correct
39 Correct 13 ms 552 KB Output is correct
40 Correct 10 ms 552 KB Output is correct
41 Correct 11 ms 460 KB Output is correct
42 Correct 9 ms 468 KB Output is correct
43 Correct 10 ms 468 KB Output is correct
44 Correct 14 ms 716 KB Output is correct
45 Correct 14 ms 720 KB Output is correct
46 Correct 13 ms 760 KB Output is correct
47 Correct 13 ms 592 KB Output is correct
48 Correct 14 ms 760 KB Output is correct
49 Correct 11 ms 724 KB Output is correct
50 Correct 13 ms 716 KB Output is correct
51 Correct 12 ms 724 KB Output is correct
52 Correct 10 ms 716 KB Output is correct
53 Correct 10 ms 724 KB Output is correct
54 Correct 9 ms 596 KB Output is correct
55 Correct 8 ms 584 KB Output is correct
56 Correct 8 ms 596 KB Output is correct
57 Correct 8 ms 604 KB Output is correct
58 Correct 8 ms 596 KB Output is correct
59 Correct 2 ms 340 KB Output is correct
60 Correct 4 ms 412 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 2 ms 468 KB Output is correct
63 Correct 6 ms 468 KB Output is correct
64 Correct 3 ms 340 KB Output is correct
65 Correct 13 ms 596 KB Output is correct
66 Correct 12 ms 680 KB Output is correct
67 Correct 12 ms 596 KB Output is correct
68 Correct 10 ms 596 KB Output is correct
69 Correct 12 ms 724 KB Output is correct
70 Correct 11 ms 724 KB Output is correct
71 Correct 9 ms 588 KB Output is correct
72 Correct 7 ms 724 KB Output is correct
73 Correct 12 ms 468 KB Output is correct
74 Correct 2 ms 460 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 320 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 320 KB Output is correct
38 Correct 11 ms 468 KB Output is correct
39 Correct 13 ms 552 KB Output is correct
40 Correct 10 ms 552 KB Output is correct
41 Correct 11 ms 460 KB Output is correct
42 Correct 9 ms 468 KB Output is correct
43 Correct 10 ms 468 KB Output is correct
44 Correct 14 ms 716 KB Output is correct
45 Correct 14 ms 720 KB Output is correct
46 Correct 13 ms 760 KB Output is correct
47 Correct 13 ms 592 KB Output is correct
48 Correct 14 ms 760 KB Output is correct
49 Correct 11 ms 724 KB Output is correct
50 Correct 13 ms 716 KB Output is correct
51 Correct 12 ms 724 KB Output is correct
52 Correct 10 ms 716 KB Output is correct
53 Correct 10 ms 724 KB Output is correct
54 Correct 9 ms 596 KB Output is correct
55 Correct 8 ms 584 KB Output is correct
56 Correct 8 ms 596 KB Output is correct
57 Correct 8 ms 604 KB Output is correct
58 Correct 8 ms 596 KB Output is correct
59 Correct 2 ms 340 KB Output is correct
60 Correct 4 ms 412 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 2 ms 468 KB Output is correct
63 Correct 6 ms 468 KB Output is correct
64 Correct 3 ms 340 KB Output is correct
65 Correct 13 ms 596 KB Output is correct
66 Correct 12 ms 680 KB Output is correct
67 Correct 12 ms 596 KB Output is correct
68 Correct 10 ms 596 KB Output is correct
69 Correct 12 ms 724 KB Output is correct
70 Correct 11 ms 724 KB Output is correct
71 Correct 9 ms 588 KB Output is correct
72 Correct 7 ms 724 KB Output is correct
73 Correct 12 ms 468 KB Output is correct
74 Correct 2 ms 460 KB Output is correct
75 Correct 2613 ms 24140 KB Output is correct
76 Correct 2518 ms 21804 KB Output is correct
77 Correct 2503 ms 24160 KB Output is correct
78 Correct 2555 ms 24376 KB Output is correct
79 Correct 1024 ms 15920 KB Output is correct
80 Correct 1578 ms 15528 KB Output is correct
81 Correct 2869 ms 38064 KB Output is correct
82 Correct 2983 ms 25808 KB Output is correct
83 Correct 3170 ms 38236 KB Output is correct
84 Correct 3193 ms 37728 KB Output is correct
85 Correct 2989 ms 38252 KB Output is correct
86 Correct 2240 ms 35848 KB Output is correct
87 Correct 2262 ms 35596 KB Output is correct
88 Correct 2774 ms 36048 KB Output is correct
89 Correct 2850 ms 39928 KB Output is correct
90 Correct 2512 ms 36728 KB Output is correct
91 Correct 1914 ms 26612 KB Output is correct
92 Correct 1894 ms 35152 KB Output is correct
93 Correct 2134 ms 36356 KB Output is correct
94 Correct 1991 ms 24664 KB Output is correct
95 Correct 2383 ms 36760 KB Output is correct
96 Correct 336 ms 11592 KB Output is correct
97 Correct 379 ms 12292 KB Output is correct
98 Correct 358 ms 12092 KB Output is correct
99 Correct 361 ms 12216 KB Output is correct
100 Correct 358 ms 11864 KB Output is correct
101 Correct 342 ms 11832 KB Output is correct
102 Correct 2467 ms 23972 KB Output is correct
103 Correct 2369 ms 35380 KB Output is correct
104 Correct 2472 ms 35740 KB Output is correct
105 Correct 2345 ms 40068 KB Output is correct
106 Correct 2324 ms 36460 KB Output is correct
107 Correct 2049 ms 26788 KB Output is correct
108 Correct 2594 ms 24260 KB Output is correct
109 Correct 2521 ms 24684 KB Output is correct
110 Correct 1285 ms 35280 KB Output is correct
111 Correct 1485 ms 35136 KB Output is correct
112 Correct 2507 ms 22248 KB Output is correct
113 Correct 186 ms 16652 KB Output is correct