제출 #1166567

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1166567		nguyenkhangninh99	Kas (COCI17_kas)	C++20	100 / 100	72 ms	1096 KiB

kas

#include <bits/stdc++.h>
using namespace std;

const int N=5e2+5;
const int LOG=17;
#define fi first
#define se seaond

int n,a[N],f[100005],sum,ans,g[100005];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    cin >> n;
    memset(f,-1,sizeof(f));
    for(int i=1;i<=n;i++)
    {
        cin >> a[i];
        sum+=a[i];
    }
    for(int i=1;i<=sum;i++)
    {
        f[i]=g[i]=INT_MIN;
    }
    f[0] = 0;
    g[0] = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= sum; j++){
            if(j + a[i] <= sum) f[j + a[i]] = max(f[j + a[i]], g[j] + a[i]);
            if(abs(j - a[i]) <= sum) f[abs(j - a[i])] =  max(f[abs(j - a[i])], g[j] + a[i]);
        }
        for(int j = 0; j <= sum; j++){
            g[j] = f[j];
            //cout << f[j] << " ";
        }
       // cout << "\n";
    }
    cout << sum - f[0] / 2;
    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