oj.uz

Submission #109008

# Submission time Handle Problem Language Result Execution time Memory
109008 2019-05-04T00:34:04 Z bibabas Kas (COCI17_kas) C++14
90 / 100
 465 ms 391928 KB 
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vvi vector<vi>
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair

int INF = (int)2e9;

using namespace std;

template <class T>
istream& operator >>(istream &in, vector<T> &arr) {
    for (T &cnt : arr) {
        in >> cnt;
    }
    return in;
};

int n;
int dp[500][(int)1e5 + 1];
vi num;

int kek(int pos, int sum){
    if (pos == n && sum == 0)
        return 0;
    if (pos == n)
        return -INF;
    if (dp[pos][sum] != -1)
        return dp[pos][sum];
    int a = kek(pos + 1, sum);
    int b = num[pos] + kek(pos + 1, sum + num[pos]);
    int c = kek(pos + 1, sum - num[pos]);
    dp[pos][sum] = max({a, b, c});
    return dp[pos][sum];
}

void solve() {
    cin >> n;
    num.assign(n, 0); cin >> num;
    for (int i = 0; i <= n; ++i){
        for (int j = 0; j <= (int)1e5; ++j){
            dp[i][j] = -1;
        }
    }
    int sum = 0;
    for (int i = 0; i < n; ++i){
        sum += num[i];
    }
    cout << sum - kek(0, 0);
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#endif

    solve();

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4736 KB Output is correct
2 Correct 7 ms 4608 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5504 KB Output is correct
2 Correct 7 ms 5760 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5860 KB Output is correct
2 Correct 7 ms 5760 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14464 KB Output is correct
2 Correct 16 ms 16384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 18284 KB Output is correct
2 Correct 19 ms 20228 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 79068 KB Output is correct
2 Correct 115 ms 98808 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 118208 KB Output is correct
2 Correct 373 ms 157476 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 177128 KB Output is correct
2 Runtime error 409 ms 391928 KB Execution killed with signal 11 (could be triggered by violating memory limits)