oj.uz

Submission #224692

# Submission time Handle Problem Language Result Execution time Memory
224692 2020-04-18T15:36:21 Z kshitij_sodani Feast (NOI19_feast) C++17
30 / 100
 54 ms 5880 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
typedef long long  llo;
llo mod=1000000007;
/*llo dp[2001][2001];
llo cost[2001][2001];*/
llo ma=0;
/*llo dnc(llo ind,llo l,llo r,llo ll,llo rr){
	llo mid=(l+r)/2;
	pair<llo,llo> best={-1,-1};
	for(llo i=ll;i<=rr;i++){
		if(i>mid){
			continue;
		}
		if(i==ll){
			if(i==0){
				best={-cost[0][mid],i};
			}
			else{
				best={-dp[i-1][ind-1]-cost[i][mid],i};
			}
		}

		else{
			best=min(best,{-dp[i-1][ind-1]-cost[i][mid],i});
		}
	}
	
	dp[mid][ind]=-best.a;

	ma=max(ma,dp[mid][ind]);
	if(mid>l){
		dnc(ind,l,mid-1,ll,best.b);
	}
	if(mid<r){
		dnc(ind,mid+1,r,best.b,rr);
	}
}*/
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	llo n,k;
	cin>>n>>k;

	llo it[n];
	for(llo i=0;i<n;i++){
		cin>>it[i];
	}
	if(k==1){
		llo su=0;
		for(llo i=0;i<n;i++){
			su+=it[i];
			su=max(su,(llo)0);
			ma=max(ma,su);
		}
		cout<<ma<<endl;
		return 0;
	}
	llo ind=0;
	vector<llo> aa;
	while(ind<n){
		if(it[ind]<=0){
			llo su=0;
			while(ind<n){
				if(it[ind]>0){
					break;
				}
				su+=it[ind];
				ind+=1;
			}
			aa.pb(su);
		}
		if(it[ind]>0){
			llo su=0;
			while(ind<n){
				if(it[ind]<0){
					break;
				}
				su+=it[ind];
				ind+=1;
			}
			aa.pb(su);
		}
	}
	set<pair<llo,llo>> ac;
	llo kk=0;
	llo ll=aa.size()-1;
	if(aa[aa.size()-1]<0){
		ll-=1;
	}
	if(aa[0]<0){
		kk+=1;
	}
	llo le[aa.size()];
	llo re[aa.size()];
	llo tot=0;
	for(llo i=0;i<aa.size();i++){
		if(aa[i]>0){
			tot+=1;
		}
		if(i>kk and i<=ll){
			le[i]=i-1;
		}
		else{
			le[i]=-1;
		}
	}
	for(llo i=0;i<aa.size();i++){
		if(i>=kk and i<ll){
			re[i]=i+1;
		}
		else{
			re[i]=-1;
		}
	}

	for(llo i=kk;i<=ll;i++){
		ac.insert({abs(aa[i]),i});
	}

	while(tot>k){
		auto xx=ac.begin();
		llo ind=(*xx).b;
		ac.erase(xx);
		if(aa[ind]>0){
			tot-=1;
		}
		if(le[ind]!=-1){
			ac.erase({aa[le[ind]],le[ind]});
			aa[ind]+=aa[le[ind]];
			le[ind]=-1;
			if(le[le[ind]]!=-1){
				le[ind]=le[le[ind]];
				re[le[le[ind]]]=ind;
			}
		}
		if(re[ind]!=-1){
			ac.erase({aa[re[ind]],re[ind]});
			aa[ind]+=aa[re[ind]];
			re[ind]=-1;
			if(re[re[ind]]!=-1){
				re[ind]=re[re[ind]];
				le[re[re[ind]]]=ind;
			}
		}
		ac.insert({aa[ind],ind});
	}

	for(llo i=kk;i<=ll;i++){
		if(aa[i]>0){
			ma+=aa[i];
		}
	}
	cout<<ma<<endl;
	
/*	llo j=0;
	for(llo i=0;i<aa.size();i++){
		if(aa[i]>0){
			llo ma=0;
			llo su=0;
			llo ind=i;
			llo ind2=j;
			while(ind>=0){
				su+=aa[ind];
				ma=max(ma,su);
				if(aa[ind]>0){
					cost[ind2][j]=ma;
					ind2-=1;
				}
				ind-=1;
			}	
			j+=1;
		}
	}
	for(llo i=0;i<j;i++){
		dp[i][0]=cost[0][i];
		ma=max(ma,cost[0][i]);
	}
	for(llo jj=1;jj<min(j,k);jj++){
		dnc(jj,0,j-1,0,j-1);

	}
	cout<<ma<<endl;
*/
	return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:101:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(llo i=0;i<aa.size();i++){
              ~^~~~~~~~~~
feast.cpp:112:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(llo i=0;i<aa.size();i++){
              ~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 5368 KB Output is correct
2 Correct 45 ms 5628 KB Output is correct
3 Correct 49 ms 5496 KB Output is correct
4 Correct 45 ms 5496 KB Output is correct
5 Correct 45 ms 5496 KB Output is correct
6 Correct 46 ms 5368 KB Output is correct
7 Correct 45 ms 5368 KB Output is correct
8 Correct 47 ms 5496 KB Output is correct
9 Correct 45 ms 5368 KB Output is correct
10 Correct 45 ms 5496 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3704 KB Output is correct
2 Correct 28 ms 3840 KB Output is correct
3 Correct 27 ms 3712 KB Output is correct
4 Correct 30 ms 3960 KB Output is correct
5 Correct 46 ms 5368 KB Output is correct
6 Correct 28 ms 3712 KB Output is correct
7 Correct 26 ms 3832 KB Output is correct
8 Correct 47 ms 5496 KB Output is correct
9 Correct 46 ms 5368 KB Output is correct
10 Correct 26 ms 3840 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 5624 KB Output is correct
2 Correct 50 ms 5624 KB Output is correct
3 Correct 50 ms 5624 KB Output is correct
4 Correct 52 ms 5656 KB Output is correct
5 Correct 51 ms 5624 KB Output is correct
6 Correct 51 ms 5624 KB Output is correct
7 Correct 51 ms 5752 KB Output is correct
8 Correct 48 ms 5624 KB Output is correct
9 Correct 52 ms 5880 KB Output is correct
10 Correct 51 ms 5752 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 5368 KB Output is correct
2 Correct 45 ms 5628 KB Output is correct
3 Correct 49 ms 5496 KB Output is correct
4 Correct 45 ms 5496 KB Output is correct
5 Correct 45 ms 5496 KB Output is correct
6 Correct 46 ms 5368 KB Output is correct
7 Correct 45 ms 5368 KB Output is correct
8 Correct 47 ms 5496 KB Output is correct
9 Correct 45 ms 5368 KB Output is correct
10 Correct 45 ms 5496 KB Output is correct
11 Correct 28 ms 3704 KB Output is correct
12 Correct 28 ms 3840 KB Output is correct
13 Correct 27 ms 3712 KB Output is correct
14 Correct 30 ms 3960 KB Output is correct
15 Correct 46 ms 5368 KB Output is correct
16 Correct 28 ms 3712 KB Output is correct
17 Correct 26 ms 3832 KB Output is correct
18 Correct 47 ms 5496 KB Output is correct
19 Correct 46 ms 5368 KB Output is correct
20 Correct 26 ms 3840 KB Output is correct
21 Correct 54 ms 5624 KB Output is correct
22 Correct 50 ms 5624 KB Output is correct
23 Correct 50 ms 5624 KB Output is correct
24 Correct 52 ms 5656 KB Output is correct
25 Correct 51 ms 5624 KB Output is correct
26 Correct 51 ms 5624 KB Output is correct
27 Correct 51 ms 5752 KB Output is correct
28 Correct 48 ms 5624 KB Output is correct
29 Correct 52 ms 5880 KB Output is correct
30 Correct 51 ms 5752 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -