제출 #244863

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
244863		VEGAnn	Kas (COCI17_kas)	C++14	100 / 100	264 ms	1952 KiB

kas

#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
using namespace std;
const int N = 510;
const int M = 100100;
int f[2][2 * M], tp = 0, sum = 0, n;

void upd(int &x, int y){
    x = max(x, y);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    fill(f[0], f[0] + 2 * M, -1);

    f[0][M] = 0;

    for (int it = 0; it < n; it++){
        int x; cin >> x;

        sum += x;

        for (int i = 0; i < 2 * M; i++)
            f[tp ^ 1][i] = f[tp][i];

        for (int i = 0; i < 2 * M; i++){
            if (f[tp][i] < 0) continue;

            upd(f[tp ^ 1][i - x], f[tp][i]);
            upd(f[tp ^ 1][i + x], f[tp][i] + x);
        }

        tp ^= 1;
    }

    cout << sum - f[tp][M];

    return 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