Submission #240912

#	Time	Username	Problem	Language	Result	Execution time	Memory
240912		SamAnd	Kas (COCI17_kas)	C++17	100 / 100	295 ms	196472 KiB

kas

#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 502, M = 100005, INF = 1000000009;

int n;
int a[N];

int dp[N][M];

void solv()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    for (int i = 1; i <= n + 1; ++i)
    {
        for (int j = 0; j < M; ++j)
        {
            dp[i][j] = -INF;
        }
    }
    dp[n + 1][0] = 0;
    for (int i = n; i >= 1; --i)
    {
        for (int j = 0; j < M; ++j)
        {
            dp[i][j] = max(dp[i][j], dp[i + 1][j]);
            if (j + a[i] < M)
                dp[i][j] = max(dp[i][j], dp[i + 1][j + a[i]] + a[i]);
            if (abs(j - a[i]) < M)
                dp[i][j] = max(dp[i][j], dp[i + 1][abs(j - a[i])] + a[i]);
        }
    }
    int ans = dp[1][0] / 2;
    int s = 0;
    for (int i = 1; i <= n; ++i)
        s += a[i];
    printf("%d\n", ans + s - ans * 2);
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    //ios_base::sync_with_stdio(false), cin.tie(0);
    solv();
    return 0;
}

//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}

Compilation message (stderr)

kas.cpp: In function 'void solv()':
kas.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
kas.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~

• 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