제출 #167790

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
167790		egekabas	Kas (COCI17_kas)	C++14	0 / 100	660 ms	392720 KiB

kas

#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<int, int>  pii;
typedef pair<ld, ld>  pld;
ll n;
ll a[509];
ll dp[509][100009];
ll tot;
ll f(ll x, ll y){

    if(y > 100000)
        return 1e18;
    if(dp[x][y] != -1)
        return dp[x][y];
    if(x == 0){
        if(y == 0)
            return dp[x][y] = a[x];
        else if(y == a[x])
            return dp[x][y] = 0;
        else
            return dp[x][y] = 1e18;
    }
    dp[x][y] = min(f(x-1, y)+a[x], f(x-1, abs(y-a[x])));
    return dp[x][y];
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(ll i = 0; i < n; ++i){
        cin >> a[i];
        tot += a[i];
    }
    for(ll i = 0; i <= 500; ++i)
        for(ll j = 0; j <= 100000; ++j)
            dp[i][j] = -1;
    ll left = f(n-1, 0);
    cout << left+(tot-left)/2 << "\n";
}

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