oj.uz

Submission #238532

# Submission time Handle Problem Language Result Execution time Memory
238532 2020-06-11T16:28:26 Z Pbezz Feast (NOI19_feast) C++14
30 / 100
 65 ms 7416 KB 
#include <bits/stdc++.h>
using namespace std;

#define loop(i,n) for (ll i = 0; i < n; i++)

#define ll long long
#define INF 1e9+5
#define MAXN 300007
#define pb push_back 
#define mp make_pair
typedef pair<ll,ll> pii;

ll n,k;
vector<ll>dp(MAXN);//de 1 a n
ll arr[2005][2005];

ll siga(ll pos, ll left,bool maybe){
//retornar o best que posso fazer
//usei até pos-1

	if(pos==n+1)return 0;
	if(left==0)return 0;

	if(arr[pos][left]!=-1){
	return arr[pos][left];
	}

	ll i,ret=0,k,gains;


	for(i=pos;i<=n;i++){//usar até i

	gains=dp[i]-dp[pos-1];

	k = siga(i+1,left-1,true)+gains;

	ret=max(ret,k);

	if(maybe){

	k = siga(i+1,left,false);
	ret=max(ret,k);
}

}
	arr[pos][left]=ret;
	return ret;

}


int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
 
	

	ll i,ans,count=0,mini,x;
	cin>>n>>k;

	vector<ll>a(n+1);

	for(i=1;i<=n;i++){
	cin>>a[i];

	if(a[i]<0){count++; mini=i;}

	dp[i]=dp[i-1]+a[i];

}

	if(count==0){
	ans=dp[n];
	}else if(count==1){

	if(k>=2)ans=dp[n]-a[mini];
	else{
	x=dp[n]-dp[mini];
	ans=max(dp[n], max(dp[mini-1], x));
	}

	}else if(k==1){//clássico maximum sum subarray

	ans=0;
	vector<ll>bruh(n+1);

	for(i=1;i<=n;i++){

	bruh[i]=max(bruh[i-1],(ll int)0)+a[i];
	ans=max(ans,bruh[i]);
}

	}else{//bruteforce básico
	ll j;
	for(i=0;i<=n+1;i++){
	for(j=0;j<=k+1;j++){
	arr[i][j]=-1;
	}
}

	ans=siga(1,k,true);

}

	printf("%lld\n",ans);

return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 4992 KB Output is correct
2 Correct 46 ms 4992 KB Output is correct
3 Correct 65 ms 4992 KB Output is correct
4 Correct 50 ms 4992 KB Output is correct
5 Correct 44 ms 5112 KB Output is correct
6 Correct 49 ms 4992 KB Output is correct
7 Correct 47 ms 4992 KB Output is correct
8 Correct 45 ms 4992 KB Output is correct
9 Correct 47 ms 5112 KB Output is correct
10 Correct 47 ms 4992 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 4992 KB Output is correct
2 Correct 27 ms 4992 KB Output is correct
3 Correct 28 ms 4992 KB Output is correct
4 Correct 27 ms 4992 KB Output is correct
5 Correct 46 ms 4992 KB Output is correct
6 Correct 25 ms 4992 KB Output is correct
7 Correct 27 ms 5120 KB Output is correct
8 Correct 49 ms 4992 KB Output is correct
9 Correct 44 ms 4992 KB Output is correct
10 Correct 29 ms 4992 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 7288 KB Output is correct
2 Correct 55 ms 7288 KB Output is correct
3 Correct 57 ms 7288 KB Output is correct
4 Correct 56 ms 7216 KB Output is correct
5 Correct 55 ms 7288 KB Output is correct
6 Correct 57 ms 7288 KB Output is correct
7 Correct 55 ms 7416 KB Output is correct
8 Correct 58 ms 7288 KB Output is correct
9 Correct 53 ms 7416 KB Output is correct
10 Correct 57 ms 7416 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Incorrect 6 ms 3072 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Incorrect 6 ms 3072 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Incorrect 6 ms 3072 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 4992 KB Output is correct
2 Correct 46 ms 4992 KB Output is correct
3 Correct 65 ms 4992 KB Output is correct
4 Correct 50 ms 4992 KB Output is correct
5 Correct 44 ms 5112 KB Output is correct
6 Correct 49 ms 4992 KB Output is correct
7 Correct 47 ms 4992 KB Output is correct
8 Correct 45 ms 4992 KB Output is correct
9 Correct 47 ms 5112 KB Output is correct
10 Correct 47 ms 4992 KB Output is correct
11 Correct 26 ms 4992 KB Output is correct
12 Correct 27 ms 4992 KB Output is correct
13 Correct 28 ms 4992 KB Output is correct
14 Correct 27 ms 4992 KB Output is correct
15 Correct 46 ms 4992 KB Output is correct
16 Correct 25 ms 4992 KB Output is correct
17 Correct 27 ms 5120 KB Output is correct
18 Correct 49 ms 4992 KB Output is correct
19 Correct 44 ms 4992 KB Output is correct
20 Correct 29 ms 4992 KB Output is correct
21 Correct 54 ms 7288 KB Output is correct
22 Correct 55 ms 7288 KB Output is correct
23 Correct 57 ms 7288 KB Output is correct
24 Correct 56 ms 7216 KB Output is correct
25 Correct 55 ms 7288 KB Output is correct
26 Correct 57 ms 7288 KB Output is correct
27 Correct 55 ms 7416 KB Output is correct
28 Correct 58 ms 7288 KB Output is correct
29 Correct 53 ms 7416 KB Output is correct
30 Correct 57 ms 7416 KB Output is correct
31 Correct 6 ms 2688 KB Output is correct
32 Incorrect 6 ms 3072 KB Output isn't correct
33 Halted 0 ms 0 KB -