제출 #92437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
92437		wolf	Kas (COCI17_kas)	C++14	0 / 100	2 ms	452 KiB

kas

#include <bits/stdc++.h>

using namespace std;

using vi = vector<int> ;
using ll = long long;

#define pb push_back
#define inf 0x3f3f3f3f
#define all(v) (v).begin() , (v).end()
#define ones(n) __builtin_popcount(n)

const int N = 505 , M = 1e5 + 5;
int n;
int arr[N] , memo[N][2 * M];

int solve (int i , int d) {
    if (i == n)
        return d == M ? 0 : inf;
    int &ret = memo[i][d];
    if (~ret)
        return ret;
    return ret = min(min(solve(i + 1 , d - arr[i]) , solve(i + 1 , d + arr[i])) , solve(i + 1 , d) + arr[i]);
}

int main() {
    int sum = 0;
    cin >> n;
    for (int i = 0 ;i < n ;i++) {
      	cin >> arr[i];
        sum += arr[i];
    }

    int mnrem = solve(0 , M);
    int ans = (sum - mnrem) / 2 + mnrem;
    cout << ans;
  
   return 0;
}

• 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