제출 #367984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367984		TosakaUCW	Kas (COCI17_kas)	C++17	100 / 100	230 ms	198144 KiB

kas

#include <stdio.h>
#include <algorithm>
#include <memory.h>

int read(int x = 0, int f = 0, char ch = getchar())
{
    while ('0' > ch or ch > '9')
        f = ch == '-', ch = getchar();
    while ('0' <= ch and ch <= '9')
        x = x * 10 + (ch ^ 48), ch = getchar();
    return f ? -x : x;
}

const int N = 5e2 + 5;
const int M = 1e5 + 5;

int n, sum, ans;
int a[N], f[N][M];

int main()
{
    n = read();
    for (int i = 1; i <= n; i++)
        sum += (a[i] = read());
    memset(f, 0xcf, sizeof f), f[0][0] = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 0; j <= sum; j++)
            f[i][j] = std::max(f[i - 1][j], f[i - 1][j + a[i]] + a[i]),
            f[i][j] = std::max(f[i][j], f[i - 1][abs(j - a[i])] + a[i]);
    return printf("%d", sum - f[n][0] / 2), 0;
}

• 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: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10