제출 #1042878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042878		VMaksimoski008	Kas (COCI17_kas)	C++17	70 / 100	2070 ms	49648 KiB

kas

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

bool dp[51][1005][1005];

signed main() {
    int n;
    cin >> n;

    ll sum = 0;
    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i], sum += v[i];

    dp[0][0][0] = 1;
    for(int i=1; i<=n; i++) {
        for(int j=0; j<=sum; j++) {
            for(int k=0; k<=sum-j; k++) {
                dp[i][j][k] = dp[i-1][j][k];
                if(v[i] <= j && dp[i-1][j-v[i]][k]) dp[i][j][k] = 1;
                if(v[i] <= k && dp[i-1][j][k-v[i]]) dp[i][j][k] = 1; 
            }
        }
    }

    ll ans = 0;
    for(int i=0; i<=sum; i++) if(dp[n][i][i]) ans = i + (sum - 2 * i);
    cout << ans << '\n';
    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: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10