제출 #675981

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675981		as111	Kas (COCI17_kas)	C++14	70 / 100	378 ms	353228 KiB

kas

#include <iostream>

#define MAXN 500
#define MAX 100000

using namespace std;
int N;
int notes[MAXN + 5];
int dp[MAXN + 5][2*MAX + 5]; // for first i banknotes, difference between 2 sums + MAX, diff<MAX means negative
int main() {
	cin >> N;
	int total = 0;
	for (int i = 1; i <= N; i++) {
		cin >> notes[i];
		total += notes[i];
		fill(dp[i], dp[i] + 2*MAX, MAX + 1);
	}
	for (int i = 0; i <= N; i++) fill(dp[i], dp[i] + 2*MAX, MAX + 1);
	dp[0][MAX] = 0;
	for (int i = 0; i < N; i++) {
		for (int k = -total; k <= total; k++) {
			int j = k + MAX;
			dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + notes[i + 1]); // add to remaining
			dp[i + 1][j + notes[i + 1]] = min(dp[i + 1][j + notes[i + 1]], dp[i][j]); // add to first person
			dp[i + 1][j - notes[i + 1]] = min(dp[i + 1][j - notes[i + 1]], dp[i][j]); // add to second
		}
	}
	cout << ((total-dp[N][MAX])/2+dp[N][MAX]);
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10