oj.uz

Submission #1042906

# Submission time Handle Problem Language Result Execution time Memory
1042906 2024-08-03T14:32:10 Z VMaksimoski008 Kas (COCI17_kas) C++17
100 / 100
 283 ms 392528 KB 
#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;

int dp[505][2*maxn+5];

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];
    for(int j=0; j<=2*maxn; j++) dp[0][j] = -1e9;
    dp[0][maxn] = 0;

    for(int i=1; i<=n; i++) {
        for(int j=0; j<=2*maxn; j++) {
            dp[i][j] = dp[i-1][j];
            if(j + v[i] <= 2 * maxn && dp[i-1][j+v[i]] >= 0) dp[i][j] = max(dp[i][j], dp[i-1][j+v[i]] + v[i]);
            if(j - v[i] >= 0 && dp[i-1][j-v[i]] >= 0) dp[i][j] = max(dp[i][j], dp[i-1][j-v[i]] + v[i]);
        }
    }

    cout << sum - dp[n][maxn] / 2 << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9048 KB Output is correct
2 Correct 5 ms 9052 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9304 KB Output is correct
2 Correct 5 ms 9052 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9052 KB Output is correct
2 Correct 6 ms 9820 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10588 KB Output is correct
2 Correct 11 ms 11356 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11356 KB Output is correct
2 Correct 11 ms 11376 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 28508 KB Output is correct
2 Correct 29 ms 32304 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 36440 KB Output is correct
2 Correct 35 ms 40160 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 157724 KB Output is correct
2 Correct 143 ms 196948 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 235860 KB Output is correct
2 Correct 184 ms 314192 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 353364 KB Output is correct
2 Correct 283 ms 392528 KB Output is correct