제출 #244858

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
244858		Vladikus004	Kas (COCI17_kas)	C++14	60 / 100	10 ms	384 KiB

kas

#include <bits/stdc++.h>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 500, MAX = 1003;
int n, is[MAX], p[MAX], nis[MAX];
multiset <int> a;

bool try_without(int x){
    int X = x;
    vector <int> drop;
    while (x){
        drop.push_back(p[x]);
        x -= p[x];
    }
    for (auto u: drop)
        a.erase(a.lower_bound(u));
    for (int i = 0; i <= 1000; i++) nis[i] = 0;
    nis[0] = 1;
    for (auto u: a)
    for (int i = 1000; i >= u; i--){
        if (nis[i - u]) nis[i] = 1;
    }
    for (auto u: drop)
        a.insert(u);
    return nis[X];
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n;
    int sum = 0;
    is[0] = 1;
    for (int i = 0; i < n; i++){
        int x;
        cin >> x;
        a.insert(x);
        sum += x;
        for (int j = 1000; j >= x; j--){
            if (is[j - x] && !is[j]) {
                is[j] = 1;
                p[j] = x;
            }
        }
    }
    for (int i = 500; i > 0; i--){
        if (is[i]){
            if (try_without(i)){
                cout << i + sum - i * 2;
                return 0;
            }
        }
    }
    cout << sum;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 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