oj.uz

답안 #848156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848156 2023-09-11T12:57:04 Z hehege Feast (NOI19_feast) C++14
51 / 100
 30 ms 15196 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N = 3e5 + 9;
const int N2 = 5e3 + 9;
const int INF = 1e18 + 9;

int n, k, a[N], ps[N], f[N], pre[N2], dp[N2][N2];

namespace sub1 {
	bool valid (){
		for (int i = 1; i <= n; i++) if (a[i] < 0) return 0;
		return 1;
	}
	
	void solve (){
		int res = 0;
		for (int i = 1; i <= n; i++) res += a[i];
		cout << res;
	}
}

namespace sub2 {
	bool valid (){
		int x = 0;
		for (int i = 1; i <= n; i++){
			if (a[i] < 0) x++;
			if (x >= 2) break;
		}
		return x <= 1;
	}
	
	void solve (){
		int sum1 = 0, sum2 = 0, sumall = 0;
		bool flag = 0;
		for (int i = 1; i <= n; i++){
			if (a[i] < 0) flag = 1;
			else if (flag == 0) sum1 += a[i];
			else sum2 += a[i];
		}
		for (int i = 1; i <= n; i++) sumall += a[i];
		if (k == 1) cout << max (sum1, max (sum2, sumall));
		else cout << sum1 + sum2;
	}
}

namespace sub3 {
	bool valid (){
		return k == 1;
	}
	
	void solve (){
		for (int i = 1; i <= n; i++) ps[i] = ps[i - 1] + a[i];
		f[n] = ps[n];
		for (int i = n - 1; i >= 1; i--) f[i] = max (f[i + 1], ps[i]);
		int res = 0;
		for (int i = 1; i <= n; i++) res = max (res, f[i] - ps[i - 1]);
		cout << res;
	}
}

namespace sub45 {
	bool valid (){
		return n <= 500;
	}
	
	void solve (){
		dp[1][1] = max (0LL, a[1]);
    	int res = max (0LL, a[1]);
    	for (int i = 2; i <= n; i++){
    		for (int j = 1; j <= k; j++){
    			if (j > i) continue;
    			dp[i][j] = max (dp[i][j], dp[i - 1][j] + a[i]);
    			for (int k = 1; k < i; k++) dp[i][j] = max (dp[i][j], dp[k][j - 1] + a[i]);
    			res = max (res, dp[i][j]);
    		}
    	}
    	cout << res;
	}
}

void sub6 (){
	dp[1][1] = max (0LL, a[1]);
    pre[1] = max (0LL, a[1]);
    int res = max (0LL, a[1]);
    for (int i = 2; i <= n; i++){
    	for (int j = 1; j <= k; j++){
    		if (j > i) continue;
    		dp[i][j] = max (dp[i][j], max (dp[i - 1][j] + a[i], pre[j - 1] + a[i]));
    		pre[j] = max (pre[j], dp[i][j]);
    		res = max (res, dp[i][j]);
    	}
    }
    cout << res;
}

signed main (){
    ios_base::sync_with_stdio (false);
    cin.tie (NULL);
    cout.tie (NULL);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    if (sub1::valid ()) sub1::solve ();
    else if (sub2::valid ()) sub2::solve ();
    else if (sub3::valid ()) sub3::solve ();
    else if (sub45::valid ()) sub45::solve ();
    else sub6 ();
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 4440 KB Output is correct
2 Correct 22 ms 4444 KB Output is correct
3 Correct 23 ms 4700 KB Output is correct
4 Correct 24 ms 4564 KB Output is correct
5 Correct 22 ms 4556 KB Output is correct
6 Correct 22 ms 4440 KB Output is correct
7 Correct 24 ms 4440 KB Output is correct
8 Correct 22 ms 4440 KB Output is correct
9 Correct 21 ms 4440 KB Output is correct
10 Correct 22 ms 4444 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 4572 KB Output is correct
2 Correct 15 ms 4564 KB Output is correct
3 Correct 14 ms 4440 KB Output is correct
4 Correct 18 ms 4700 KB Output is correct
5 Correct 22 ms 4440 KB Output is correct
6 Correct 17 ms 4444 KB Output is correct
7 Correct 15 ms 4700 KB Output is correct
8 Correct 24 ms 4564 KB Output is correct
9 Correct 22 ms 4444 KB Output is correct
10 Correct 15 ms 4700 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 8532 KB Output is correct
2 Correct 29 ms 8528 KB Output is correct
3 Correct 27 ms 8648 KB Output is correct
4 Correct 27 ms 8656 KB Output is correct
5 Correct 28 ms 8540 KB Output is correct
6 Correct 27 ms 8796 KB Output is correct
7 Correct 27 ms 8740 KB Output is correct
8 Correct 27 ms 8660 KB Output is correct
9 Correct 27 ms 8784 KB Output is correct
10 Correct 27 ms 8792 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 3 ms 3672 KB Output is correct
12 Correct 4 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 3 ms 3676 KB Output is correct
15 Correct 3 ms 3676 KB Output is correct
16 Correct 2 ms 3420 KB Output is correct
17 Correct 3 ms 3648 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 2 ms 3420 KB Output is correct
20 Correct 1 ms 3676 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 3 ms 3672 KB Output is correct
12 Correct 4 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 3 ms 3676 KB Output is correct
15 Correct 3 ms 3676 KB Output is correct
16 Correct 2 ms 3420 KB Output is correct
17 Correct 3 ms 3648 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 2 ms 3420 KB Output is correct
20 Correct 1 ms 3676 KB Output is correct
21 Incorrect 7 ms 15196 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 4440 KB Output is correct
2 Correct 22 ms 4444 KB Output is correct
3 Correct 23 ms 4700 KB Output is correct
4 Correct 24 ms 4564 KB Output is correct
5 Correct 22 ms 4556 KB Output is correct
6 Correct 22 ms 4440 KB Output is correct
7 Correct 24 ms 4440 KB Output is correct
8 Correct 22 ms 4440 KB Output is correct
9 Correct 21 ms 4440 KB Output is correct
10 Correct 22 ms 4444 KB Output is correct
11 Correct 15 ms 4572 KB Output is correct
12 Correct 15 ms 4564 KB Output is correct
13 Correct 14 ms 4440 KB Output is correct
14 Correct 18 ms 4700 KB Output is correct
15 Correct 22 ms 4440 KB Output is correct
16 Correct 17 ms 4444 KB Output is correct
17 Correct 15 ms 4700 KB Output is correct
18 Correct 24 ms 4564 KB Output is correct
19 Correct 22 ms 4444 KB Output is correct
20 Correct 15 ms 4700 KB Output is correct
21 Correct 30 ms 8532 KB Output is correct
22 Correct 29 ms 8528 KB Output is correct
23 Correct 27 ms 8648 KB Output is correct
24 Correct 27 ms 8656 KB Output is correct
25 Correct 28 ms 8540 KB Output is correct
26 Correct 27 ms 8796 KB Output is correct
27 Correct 27 ms 8740 KB Output is correct
28 Correct 27 ms 8660 KB Output is correct
29 Correct 27 ms 8784 KB Output is correct
30 Correct 27 ms 8792 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2648 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2652 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 3 ms 3672 KB Output is correct
42 Correct 4 ms 3420 KB Output is correct
43 Correct 2 ms 3420 KB Output is correct
44 Correct 3 ms 3676 KB Output is correct
45 Correct 3 ms 3676 KB Output is correct
46 Correct 2 ms 3420 KB Output is correct
47 Correct 3 ms 3648 KB Output is correct
48 Correct 1 ms 3420 KB Output is correct
49 Correct 2 ms 3420 KB Output is correct
50 Correct 1 ms 3676 KB Output is correct
51 Incorrect 7 ms 15196 KB Output isn't correct
52 Halted 0 ms 0 KB -