제출 #1170873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170873		ttamx	Kas (COCI17_kas)	C++20	100 / 100	90 ms	1216 KiB

kas

#include<bits/stdc++.h>

using namespace std;

const int INF=INT_MAX/2;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> a(n);
    for(auto &x:a){
        cin >> x;
    }
    int tot=accumulate(a.begin(),a.end(),0LL);
    int m=tot+10;
    int offset=m/2;
    vector<int> dp(m,INF);
    dp[offset]=0;
    for(auto x:a){
        vector<int> new_dp(m,INF);
        for(int i=0;i<m;i++){
            new_dp[i]=dp[i]+x;
            if(i>=x){
                new_dp[i]=min(new_dp[i],dp[i-x]);
            }
            if(i+x<m){
                new_dp[i]=min(new_dp[i],dp[i+x]);
            }
        }
        dp=move(new_dp);
    }
    cout << (tot+dp[offset])/2;
}

• 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