oj.uz

Submission #244857

# Submission time Handle Problem Language Result Execution time Memory
244857 2020-07-05T07:42:04 Z Vimmer Kas (COCI17_kas) C++14
80 / 100
 252 ms 97696 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100001
#define M ll(998244353)
#define inf 1e9 + 1e9


using namespace std;
using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


gp_hash_table <int, gp_hash_table <int, bool> > f[501];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int c[n], sumr = 0;;

    for (int i = 0; i < n; i++) {cin >> c[i]; sumr += c[i];}

    sort(c, c + n);

    reverse(c, c + n);

    bool dp[n + 1][N];

    memset(dp, 0, sizeof(dp));

    dp[0][0] = 1;

    for (int i = 0; i < n; i++)
      for (int j = 0; j < N; j++)
        if (dp[i][j])
            {
                dp[i + 1][j] = 1;

                dp[i + 1][j + c[i]] = 1;
            }

    int sm = 0, sum = 0, ans = 1e9;

    for (int i = n; i >= 0; i--)
    {
        if (i != n) sm += c[i];

        int val = sumr - sm;

        if (val % 2 || !dp[i][val / 2]) continue;

        sum = val / 2;

        ans = min(ans, sum + sm);
    }

    reverse(c, c + n);

    memset(dp, 0, sizeof(dp));

    dp[0][0] = 1;

    for (int i = 0; i < n; i++)
      for (int j = 0; j < N; j++)
        if (dp[i][j])
            {

                dp[i + 1][j] = 1;


                dp[i + 1][j + c[i]] = 1;
            }

    sm = 0; sum = 0;

    for (int i = n; i >= 0; i--)
    {
        if (i != n) sm += c[i];

        int val = sumr - sm;

        if (val % 2 || !dp[i][val / 2]) continue;

        sum = val / 2;

        ans = min(ans, sum + sm);
    }

    if (n <= 50)
    {
        f[0][0][0] = 1;

    for (int i = 0; i < n; i++)
     for (auto it : f[i])
          for (auto itr : it.S)
             {
                f[i + 1][it.F][itr.F] = 1;

                f[i + 1][it.F + c[i]][itr.F] = 1;

                f[i + 1][it.F][itr.F + c[i]] = 1;
             }

    for (int i = 0; i < N; i++)
        if (f[n][i][i]) ans = min(ans, i + sumr - i - i);


    }
    else
    {
         bool d[n + 1][N];

    memset(d, 0, sizeof(d));

    d[0][0] = 1;

    for (int i = 0; i < n; i++)
      for (int j = 0; j < N; j++)
        if (d[i][j])
            {
                d[i + 1][j] = 1;

                d[i + 1][j + c[i]] = 1;
            }

    for (int j = 0; j < N; j++)
        if (d[n][j] && j % 2 == 0 && d[n][j / 2])
            ans = min(ans, j / 2 +  sumr - j);

    }


    cout << ans << endl;

}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 65060 KB Output is correct
2 Correct 126 ms 64172 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 65464 KB Output is correct
2 Correct 133 ms 66596 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 64448 KB Output is correct
2 Correct 148 ms 69656 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 68900 KB Output is correct
2 Correct 143 ms 70164 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 69236 KB Output is correct
2 Correct 252 ms 97696 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 81000 KB Output is correct
2 Correct 155 ms 72088 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 79396 KB Output is correct
2 Correct 235 ms 94736 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 102 ms 40184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 59768 KB Output is correct
2 Correct 210 ms 79352 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 251 ms 89208 KB Output isn't correct
2 Halted 0 ms 0 KB -