oj.uz

답안 #345557

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345557 2021-01-07T14:52:17 Z Nursik Feast (NOI19_feast) C++14
12 / 100
 136 ms 49260 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end() 
#define ld long double

using namespace std; 
 
void data() {
	#ifdef NURS
        freopen("main.in", "r", stdin);
        freopen("main.out", "w", stdout);
    #endif	
} 
void win()
{	
	ios_base::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
}

int block = 400;
const ld eps = 1e-6; 

const int N = 1e6 + 500;
const int mod = 1e9 + 7;

const ll hh = 100010683;
const ll hh2 = 150005819;

int n, k, g, pos;
int a[N];
ll s, ans;
ll dp[5000][5000], pref[5000];
int main()
{
	data();              
	win();        
	cin >> n >> k;
	bool was = 0;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		was = was | (a[i] < 0), s += a[i];
		if (a[i] < 0)
			g++, pos = i;
		pref[i] += pref[i - 1] + a[i];
	}
	//first subtask
	if (was == 0)
	{
		cout << s << '\n';
		return 0;
	}
	//second subtask
	if (g == 1 && k >= 2)
	{
		cout << s - a[pos] << '\n';
		return 0;	
	}
	else if (g == 1 && k == 1)
	{
		ans = max(ans, s);
		s = 0;
		for (int i = 1; i < pos; i++)
			s += a[i];
		ans = max(ans, s), s = 0;
		for (int i = pos + 1; i <= n; i++)
			s += a[i];
		ans = max(ans, s);
		cout << ans << '\n';
		return 0;
	}
	//3, 4, 5 subtasks
	for (int i = 0; i <= n; i++)
	{
		for (int j = 0; j <= k; j++)
		{
			dp[i][j] = -1e9;
		} 
	}
	dp[0][0] = 0;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= k; j++)
		{
			for (int len = 1; len <= i; len++)
			{
				if (dp[i - len][j - 1] != -1e9)
				{
					dp[i][j] = max(dp[i - len][j - 1] + pref[i] - pref[i - len], dp[i][j]); 
				}
			}
			dp[i][j] = max(dp[i][j], dp[i - 1][j]);
			if (i == n && j == k)
				ans = max(ans, dp[i][j]);
		}
		dp[i][0] = max(dp[i][0], dp[i - 1][0]);
	}
	cout << ans;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 4076 KB Output is correct
2 Correct 51 ms 4076 KB Output is correct
3 Correct 37 ms 4076 KB Output is correct
4 Correct 36 ms 4076 KB Output is correct
5 Correct 36 ms 4076 KB Output is correct
6 Correct 42 ms 4076 KB Output is correct
7 Correct 35 ms 4076 KB Output is correct
8 Correct 35 ms 4076 KB Output is correct
9 Correct 37 ms 4076 KB Output is correct
10 Correct 35 ms 4076 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 4076 KB Output is correct
2 Correct 24 ms 4076 KB Output is correct
3 Correct 24 ms 4076 KB Output is correct
4 Correct 27 ms 4204 KB Output is correct
5 Correct 35 ms 4204 KB Output is correct
6 Correct 24 ms 4204 KB Output is correct
7 Correct 25 ms 4204 KB Output is correct
8 Correct 36 ms 4460 KB Output is correct
9 Correct 35 ms 4212 KB Output is correct
10 Correct 25 ms 4236 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 136 ms 49260 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 620 KB Output is correct
2 Incorrect 1 ms 748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 620 KB Output is correct
2 Incorrect 1 ms 748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 620 KB Output is correct
2 Incorrect 1 ms 748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 4076 KB Output is correct
2 Correct 51 ms 4076 KB Output is correct
3 Correct 37 ms 4076 KB Output is correct
4 Correct 36 ms 4076 KB Output is correct
5 Correct 36 ms 4076 KB Output is correct
6 Correct 42 ms 4076 KB Output is correct
7 Correct 35 ms 4076 KB Output is correct
8 Correct 35 ms 4076 KB Output is correct
9 Correct 37 ms 4076 KB Output is correct
10 Correct 35 ms 4076 KB Output is correct
11 Correct 24 ms 4076 KB Output is correct
12 Correct 24 ms 4076 KB Output is correct
13 Correct 24 ms 4076 KB Output is correct
14 Correct 27 ms 4204 KB Output is correct
15 Correct 35 ms 4204 KB Output is correct
16 Correct 24 ms 4204 KB Output is correct
17 Correct 25 ms 4204 KB Output is correct
18 Correct 36 ms 4460 KB Output is correct
19 Correct 35 ms 4212 KB Output is correct
20 Correct 25 ms 4236 KB Output is correct
21 Runtime error 136 ms 49260 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -