oj.uz

Submission #848146

# Submission time Handle Problem Language Result Execution time Memory
848146 2023-09-11T12:40:19 Z asd12343 Feast (NOI19_feast) C++14
45 / 100
 31 ms 48512 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];
int pre[MN];
signed main(){
 	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    //FILE(BLUESKY);
    bool flag = false;
    cin >> n >> k;
    for (int i = 1 ; i <= n ; i++) {
    	cin >> a[i];
    	pre[i] = pre[i-1] + a[i];
    	if (a[i] < 0) flag = true,cnt++, pos = i;
    }	
    if (flag == false) cout << accumulate(a+1,a+n+1,0LL);
    if (n <= 5000) {
    	for (int i = 1; i <= k; ++i){
	        int cur = 0;
	        for (int j = 1; j <= n; ++j) {
	            cur = max(cur, dp[i-1][j] - pre[j]);
	            dp[i][j] = max(dp[i][j-1], cur + pre[j]);
	        }
    	}
    	cout << dp[k][n];
    }
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 8788 KB Output is correct
2 Correct 23 ms 8588 KB Output is correct
3 Correct 22 ms 8596 KB Output is correct
4 Correct 22 ms 8852 KB Output is correct
5 Correct 24 ms 8856 KB Output is correct
6 Correct 23 ms 8832 KB Output is correct
7 Correct 25 ms 8788 KB Output is correct
8 Correct 23 ms 8792 KB Output is correct
9 Correct 23 ms 8796 KB Output is correct
10 Correct 22 ms 8796 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 18.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2524 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2524 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2592 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2904 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2524 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2592 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 3 ms 9052 KB Output is correct
22 Correct 22 ms 48512 KB Output is correct
23 Correct 6 ms 12936 KB Output is correct
24 Correct 4 ms 9052 KB Output is correct
25 Correct 5 ms 12124 KB Output is correct
26 Correct 3 ms 6748 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 1 ms 4956 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 8788 KB Output is correct
2 Correct 23 ms 8588 KB Output is correct
3 Correct 22 ms 8596 KB Output is correct
4 Correct 22 ms 8852 KB Output is correct
5 Correct 24 ms 8856 KB Output is correct
6 Correct 23 ms 8832 KB Output is correct
7 Correct 25 ms 8788 KB Output is correct
8 Correct 23 ms 8792 KB Output is correct
9 Correct 23 ms 8796 KB Output is correct
10 Correct 22 ms 8796 KB Output is correct
11 Incorrect 18 ms 8796 KB Output isn't correct
12 Halted 0 ms 0 KB -