oj.uz

Submission #848131

# Submission time Handle Problem Language Result Execution time Memory
848131 2023-09-11T12:17:56 Z asd12343 Feast (NOI19_feast) C++14
4 / 100
 24 ms 4568 KB 
#pragma GCC optimize("Os")
#include <bits/stdc++.h>
using namespace std;
const int MN = 2e6+5;
const int INF = 0x3f3f3f3f;
#define int long long
#define pb push_back
#define p make_pair	
#define fi first
#define se second
#define pii pair<int,int>
#define f(i,a,b) for (int i = a ; i < b ; i++)
#define f1(i,a,b) for (int i = a ; i > b ; i--)
#define f2(i,a,b) for (int i = a ; i <= b ; i++)
#define FILE(X)						\
	freopen(#X ".INP","r",stdin);	\
	freopen(#X ".OUT","w",stdout);
 
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int random(int l, int r) { return l + rd() % (r - l + 1); }
int a[MN];
int n,k,pos;
int cnt = 0;
int dp[5003][5003];
signed main(){
 	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    bool flag = false;
    cin >> n >> k;
    for (int i = 1 ; i <= n ; i++) {
    	cin >> a[i];
    	if (a[i] < 0) flag = true,cnt++, pos = i;
    }	
    if (flag == false) cout << accumulate(a+1,a+n+1,0LL);
    else if (cnt == 1) {
    	if (k == 1) {
    		int sum = 0, sum2 = 0;
    		for (int i = 1 ; i < pos ; i++) sum += a[i];
    		for (int i = pos+1 ; i <= n ; i++) sum2 += a[i];
    		cout << max(sum,sum2) << "\n";
    	}
    	else {
    		cout << accumulate(a+1,a+n+1,0LL) - a[pos];
    	}
    }
    else if (cnt == n) cout << 0;
    else if (n <= 5000) {
    	for (int i = 1 ; i <= n ; i++) {
    		for (int j = 0 ; j <= k ; j++) { 
    			dp[i][j+1] = max(dp[i][j+1],dp[i-1][j]);
    			dp[i][j] = max(dp[i][j],dp[i-1][j] + a[i]);
    		}
    	}
    	int ans = 0;
    	for (int i = 0 ; i <= k ; i++) ans = max(ans,dp[n][i]);
    	cout << ans <<"\n";
    }
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 4440 KB Output is correct
2 Correct 22 ms 4568 KB Output is correct
3 Correct 23 ms 4444 KB Output is correct
4 Correct 22 ms 4444 KB Output is correct
5 Correct 22 ms 4568 KB Output is correct
6 Correct 22 ms 4440 KB Output is correct
7 Correct 21 ms 4444 KB Output is correct
8 Correct 23 ms 4444 KB Output is correct
9 Correct 22 ms 4488 KB Output is correct
10 Correct 24 ms 4444 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 4440 KB Output is correct
2 Correct 22 ms 4568 KB Output is correct
3 Correct 23 ms 4444 KB Output is correct
4 Correct 22 ms 4444 KB Output is correct
5 Correct 22 ms 4568 KB Output is correct
6 Correct 22 ms 4440 KB Output is correct
7 Correct 21 ms 4444 KB Output is correct
8 Correct 23 ms 4444 KB Output is correct
9 Correct 22 ms 4488 KB Output is correct
10 Correct 24 ms 4444 KB Output is correct
11 Correct 14 ms 4444 KB Output is correct
12 Incorrect 14 ms 4444 KB Output isn't correct
13 Halted 0 ms 0 KB -