oj.uz

Submission #157895

# Submission time Handle Problem Language Result Execution time Memory
157895 2019-10-13T15:29:04 Z HungAnhGoldIBO2020 Cake 3 (JOI19_cake3) C++14
24 / 100
 4000 ms 11188 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+3;
const int LOG=18;
const int inf=1e18+2;
int n,num,bit_cnt[N],bit_sum[N],ans[N],nowl=1,nen[N],nowr=0;
pair<int,int> lis[N];
vector<int> idx;
queue<pair<pair<int,int>,pair<int,int> > > dac_lis;
void upd(int pos,int val){
//	cout<<pos<<' '<<val<<endl;
	while(pos<=n){
		bit_sum[pos]+=val;
		if(val>=0){
			bit_cnt[pos]++;
		}
		else{
			bit_cnt[pos]--;
		}
		pos+=(pos&-pos);
	}
}
int get_sum(int x){			//sum of first x number
	int sum=0;
	for(int i=0,j=LOG-1;j>=0;j--){
		if(i+(1<<j)<=n&&bit_cnt[i+(1<<j)]<=x){
			x-=bit_cnt[i+(1<<j)];
			sum+=bit_sum[i+(1<<j)];
			i+=(1<<j);
		}
	}
	return sum;
}
void solve(int l,int r,int lef,int rig){
	int mid=(l+r)/2,max1,idxmax=0;
	//cout<<l<<' '<<r<<' '<<mid<<" cac"<<endl;
	if(nowl>rig||nowr<l){
		memset(bit_cnt,0,sizeof(bit_cnt));
		memset(bit_sum,0,sizeof(bit_sum));
		nowl=1;
		nowr=0;
	}
	ans[mid]=-inf;
	while(nowr<mid){
		nowr++;
		upd(n-nen[nowr]+1,lis[nowr].first);			//take the max so just reverse them
	}
	while(nowl<=rig&&nowr-nowl+1>=num){
		if(nowl>=lef&&nowl<=rig){
			max1=get_sum(num)-lis[mid].second+lis[nowl].second;
			//cout<<mid<<' '<<nowl<<' '<<max1<<' '<<endl;
			if(ans[mid]<max1){
				ans[mid]=max1;
				idxmax=nowl;
			}
		}
		if(nowl==rig){
			break;
		}
		upd(n-nen[nowl]+1,-lis[nowl].first);
		nowl++;
	}
	if(l<mid){
		dac_lis.push({{l,mid-1},{lef,idxmax}});
	}
	if(mid<r){
		dac_lis.push({{mid+1,r},{idxmax,rig}});
	}
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int i,j,k;
	cin>>n>>num;
	for(i=1;i<=n;i++){
		cin>>lis[i].first>>lis[i].second;
		lis[i].second*=2;
		idx.push_back(i);
	}
	sort(lis+1,lis+1+n,[&](pair<int,int> x,pair<int,int> y){
		return x.second<y.second;
	});
	sort(idx.begin(),idx.end(),[&](int x,int y){
		return lis[x].first<lis[y].first;
	});
	for(i=0;i<idx.size();i++){
		nen[idx[i]]=i+1;
	//	cout<<idx[i]<<' '<<i+1<<endl;
	}
	dac_lis.push({{1,n},{1,n}});
	while(dac_lis.size()){
		solve(dac_lis.front().first.first,dac_lis.front().first.second,dac_lis.front().second.first,dac_lis.front().second.second);
		dac_lis.pop();
		//cout<<dac_lis.front().first.first<<' '<<dac_lis.front().first.second<<' '<<dac_lis.front().second.first<<' '<<dac_lis.front().second.second<<endl;
	}
	for(i=1;i<=n;i++){
		ans[1]=max(ans[1],ans[i]);
//		cout<<ans[i]<<' ';
//		if(i==n){
//			cout<<endl;
//		}
	}
	cout<<ans[1];
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:87:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<idx.size();i++){
          ~^~~~~~~~~~~
cake3.cpp:74:8: warning: unused variable 'j' [-Wunused-variable]
  int i,j,k;
        ^
cake3.cpp:74:10: warning: unused variable 'k' [-Wunused-variable]
  int i,j,k;
          ^

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3576 KB Output is correct
2 Correct 20 ms 3448 KB Output is correct
3 Correct 20 ms 3448 KB Output is correct
4 Correct 21 ms 3448 KB Output is correct
5 Correct 21 ms 3448 KB Output is correct
6 Correct 20 ms 3576 KB Output is correct
7 Correct 21 ms 3576 KB Output is correct
8 Correct 20 ms 3448 KB Output is correct
9 Correct 22 ms 3448 KB Output is correct
10 Correct 20 ms 3576 KB Output is correct
11 Correct 20 ms 3448 KB Output is correct
12 Correct 20 ms 3448 KB Output is correct
13 Correct 21 ms 3448 KB Output is correct
14 Correct 20 ms 3448 KB Output is correct
15 Correct 21 ms 3448 KB Output is correct
16 Correct 19 ms 3448 KB Output is correct
17 Correct 20 ms 3448 KB Output is correct
18 Correct 20 ms 3448 KB Output is correct
19 Correct 20 ms 3448 KB Output is correct
20 Correct 21 ms 3448 KB Output is correct
21 Correct 20 ms 3448 KB Output is correct
22 Correct 21 ms 3576 KB Output is correct
23 Correct 21 ms 3448 KB Output is correct
24 Correct 20 ms 3576 KB Output is correct
25 Correct 22 ms 3448 KB Output is correct
26 Correct 20 ms 3500 KB Output is correct
27 Correct 19 ms 3572 KB Output is correct
28 Correct 20 ms 3420 KB Output is correct
29 Correct 20 ms 3448 KB Output is correct
30 Correct 21 ms 3448 KB Output is correct
31 Correct 20 ms 3448 KB Output is correct
32 Correct 20 ms 3448 KB Output is correct
33 Correct 20 ms 3448 KB Output is correct
34 Correct 20 ms 3448 KB Output is correct
35 Correct 19 ms 3448 KB Output is correct
36 Correct 21 ms 3448 KB Output is correct
37 Correct 21 ms 3576 KB Output is correct
38 Correct 351 ms 3620 KB Output is correct
39 Correct 353 ms 3812 KB Output is correct
40 Correct 336 ms 3704 KB Output is correct
41 Correct 331 ms 3704 KB Output is correct
42 Correct 341 ms 3576 KB Output is correct
43 Correct 327 ms 3716 KB Output is correct
44 Correct 340 ms 3752 KB Output is correct
45 Correct 380 ms 3704 KB Output is correct
46 Correct 384 ms 3704 KB Output is correct
47 Correct 368 ms 3576 KB Output is correct
48 Correct 366 ms 3708 KB Output is correct
49 Correct 367 ms 3704 KB Output is correct
50 Correct 370 ms 3704 KB Output is correct
51 Correct 372 ms 3576 KB Output is correct
52 Correct 355 ms 3704 KB Output is correct
53 Correct 366 ms 3676 KB Output is correct
54 Correct 357 ms 3580 KB Output is correct
55 Correct 360 ms 3576 KB Output is correct
56 Correct 362 ms 3580 KB Output is correct
57 Correct 354 ms 3576 KB Output is correct
58 Correct 343 ms 3704 KB Output is correct
59 Correct 340 ms 3832 KB Output is correct
60 Correct 349 ms 3576 KB Output is correct
61 Correct 353 ms 3704 KB Output is correct
62 Correct 353 ms 3576 KB Output is correct
63 Correct 369 ms 3576 KB Output is correct
64 Correct 359 ms 3708 KB Output is correct
65 Correct 357 ms 3652 KB Output is correct
66 Correct 368 ms 3704 KB Output is correct
67 Correct 391 ms 3832 KB Output is correct
68 Correct 369 ms 3704 KB Output is correct
69 Correct 356 ms 3704 KB Output is correct
70 Correct 366 ms 3576 KB Output is correct
71 Correct 362 ms 3576 KB Output is correct
72 Correct 364 ms 3704 KB Output is correct
73 Correct 345 ms 3704 KB Output is correct
74 Correct 363 ms 3704 KB Output is correct

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3576 KB Output is correct
2 Correct 20 ms 3448 KB Output is correct
3 Correct 20 ms 3448 KB Output is correct
4 Correct 21 ms 3448 KB Output is correct
5 Correct 21 ms 3448 KB Output is correct
6 Correct 20 ms 3576 KB Output is correct
7 Correct 21 ms 3576 KB Output is correct
8 Correct 20 ms 3448 KB Output is correct
9 Correct 22 ms 3448 KB Output is correct
10 Correct 20 ms 3576 KB Output is correct
11 Correct 20 ms 3448 KB Output is correct
12 Correct 20 ms 3448 KB Output is correct
13 Correct 21 ms 3448 KB Output is correct
14 Correct 20 ms 3448 KB Output is correct
15 Correct 21 ms 3448 KB Output is correct
16 Correct 19 ms 3448 KB Output is correct
17 Correct 20 ms 3448 KB Output is correct
18 Correct 20 ms 3448 KB Output is correct
19 Correct 20 ms 3448 KB Output is correct
20 Correct 21 ms 3448 KB Output is correct
21 Correct 20 ms 3448 KB Output is correct
22 Correct 21 ms 3576 KB Output is correct
23 Correct 21 ms 3448 KB Output is correct
24 Correct 20 ms 3576 KB Output is correct
25 Correct 22 ms 3448 KB Output is correct
26 Correct 20 ms 3500 KB Output is correct
27 Correct 19 ms 3572 KB Output is correct
28 Correct 20 ms 3420 KB Output is correct
29 Correct 20 ms 3448 KB Output is correct
30 Correct 21 ms 3448 KB Output is correct
31 Correct 20 ms 3448 KB Output is correct
32 Correct 20 ms 3448 KB Output is correct
33 Correct 20 ms 3448 KB Output is correct
34 Correct 20 ms 3448 KB Output is correct
35 Correct 19 ms 3448 KB Output is correct
36 Correct 21 ms 3448 KB Output is correct
37 Correct 21 ms 3576 KB Output is correct
38 Correct 351 ms 3620 KB Output is correct
39 Correct 353 ms 3812 KB Output is correct
40 Correct 336 ms 3704 KB Output is correct
41 Correct 331 ms 3704 KB Output is correct
42 Correct 341 ms 3576 KB Output is correct
43 Correct 327 ms 3716 KB Output is correct
44 Correct 340 ms 3752 KB Output is correct
45 Correct 380 ms 3704 KB Output is correct
46 Correct 384 ms 3704 KB Output is correct
47 Correct 368 ms 3576 KB Output is correct
48 Correct 366 ms 3708 KB Output is correct
49 Correct 367 ms 3704 KB Output is correct
50 Correct 370 ms 3704 KB Output is correct
51 Correct 372 ms 3576 KB Output is correct
52 Correct 355 ms 3704 KB Output is correct
53 Correct 366 ms 3676 KB Output is correct
54 Correct 357 ms 3580 KB Output is correct
55 Correct 360 ms 3576 KB Output is correct
56 Correct 362 ms 3580 KB Output is correct
57 Correct 354 ms 3576 KB Output is correct
58 Correct 343 ms 3704 KB Output is correct
59 Correct 340 ms 3832 KB Output is correct
60 Correct 349 ms 3576 KB Output is correct
61 Correct 353 ms 3704 KB Output is correct
62 Correct 353 ms 3576 KB Output is correct
63 Correct 369 ms 3576 KB Output is correct
64 Correct 359 ms 3708 KB Output is correct
65 Correct 357 ms 3652 KB Output is correct
66 Correct 368 ms 3704 KB Output is correct
67 Correct 391 ms 3832 KB Output is correct
68 Correct 369 ms 3704 KB Output is correct
69 Correct 356 ms 3704 KB Output is correct
70 Correct 366 ms 3576 KB Output is correct
71 Correct 362 ms 3576 KB Output is correct
72 Correct 364 ms 3704 KB Output is correct
73 Correct 345 ms 3704 KB Output is correct
74 Correct 363 ms 3704 KB Output is correct
75 Execution timed out 4062 ms 11188 KB Time limit exceeded
76 Halted 0 ms 0 KB -