oj.uz

Submission #245406

# Submission time Handle Problem Language Result Execution time Memory
245406 2020-07-06T10:15:47 Z kartel Kas (COCI17_kas) C++14
100 / 100
 467 ms 394488 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int i, f[505][2 * N], a[505], n, ans, j, fsum;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
//
//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> a[i], fsum += a[i];

    for (i = 1; i <= n + 1; i++)
      for (j = 0; j < 2 * N; j++) f[i][j] = -1;

    f[1][N] = 0;

    for (i = 1; i <= n; i++)
        for (j = 0; j < 2 * N; j++)
        {
            if (f[i][j] == -1) continue;

            f[i + 1][j] = max(f[i + 1][j], f[i][j]);
            f[i + 1][j - a[i]] = max(f[i + 1][j - a[i]], f[i][j]);
            f[i + 1][j + a[i]] = max(f[i + 1][j + a[i]], f[i][j] + a[i]);
        }

    cout << fsum - f[n + 1][N];
}

//
//00000
//00110
//00111
//00011
//00000

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 9088 KB Output is correct
2 Correct 12 ms 8944 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8960 KB Output is correct
2 Correct 12 ms 9856 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10624 KB Output is correct
2 Correct 14 ms 11392 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11392 KB Output is correct
2 Correct 13 ms 11392 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 28672 KB Output is correct
2 Correct 26 ms 32640 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 36480 KB Output is correct
2 Correct 32 ms 40444 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 158584 KB Output is correct
2 Correct 146 ms 197860 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 237176 KB Output is correct
2 Correct 270 ms 315768 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 336 ms 355200 KB Output is correct
2 Correct 467 ms 394488 KB Output is correct