Submission #1177647

#	Time	Username	Problem	Language	Result	Execution time	Memory
1177647		bobdelobster	Kas (COCI17_kas)	C++20	100 / 100	324 ms	392636 KiB

kas

#include <bits/stdc++.h>
using namespace std;
const int N = 510, M = 200010, INF = 1e9, offset = 100005;
int cash[N];
int dp[N][M];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, sum = 0;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> cash[i];
        sum += cash[i];
    }
    for (int i = 0; i <= n; i++)
    {
        for (int j = 0; j < M; j++)
        {
            dp[i][j] = -INF;
        }
    }
    dp[0][offset] = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j < M; j++)
        {
            dp[i][j] = max(dp[i - 1][j], dp[i][j]);
            if (dp[i - 1][j] != -INF && j + cash[i] < M)
            {
                dp[i][j + cash[i]] = max(dp[i][j + cash[i]], cash[i] + dp[i - 1][j]);
            }
            if (dp[i - 1][j] != -INF && j - cash[i] >= 0)
            {
                dp[i][j - cash[i]] = max(cash[i] + dp[i - 1][j], dp[i][j - cash[i]]);
            }
        }
    }
    cout << sum - (dp[n][offset] >> 1);
}

• 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