Submission #244849

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
244849	2020-07-05T07:29:22 Z	Vimmer	Kas (COCI17_kas)	C++14	80 / 100	425 ms	180464 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;


char dpr[501][N], fr[501][N];

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 ans = 1e9;


    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;

    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);
    }

    random_shuffle(c, c + n);

    memset(dpr, 'a', sizeof(dpr));

    memset(fr, 'a', sizeof(fr));

    dpr[0][0] = 'b';

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

                dpr[i + 1][j + c[i]] = 'b';
            }

    fr[n][0] = 'b';

    for (int i = n; i > 0; i--)
      for (int j = 0; j < N; j++)
        if (fr[i][j] == 'b')
            {
                fr[i - 1][j] = 'b';

                fr[i - 1][j + c[i - 1]] = 'b';
            }


    for (int i = 0; i < n; i++)
        for (int j = 0; j < N; j++)
            {
                if (dpr[i][j] == 'a') continue;

                if (fr[i][j] == 'a') continue;

                ans = min(ans, j + sumr - j - j);
            }

    cout << ans << endl;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	159 ms	147716 KB	Output is correct
2	Correct	157 ms	146928 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	162 ms	148100 KB	Output is correct
2	Correct	173 ms	149152 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	160 ms	147088 KB	Output is correct
2	Correct	196 ms	152308 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	199 ms	151540 KB	Output is correct
2	Correct	188 ms	152896 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	183 ms	151924 KB	Output is correct
2	Correct	308 ms	180464 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	233 ms	163656 KB	Output is correct
2	Correct	200 ms	154996 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	222 ms	162032 KB	Output is correct
2	Correct	292 ms	177388 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	197 ms	118648 KB	Output is correct
2	Correct	203 ms	123440 KB	Output is correct

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	229 ms	128376 KB	Output is correct
2	Incorrect	348 ms	138208 KB	Output isn't correct

Subtask #10
0 / 10.0

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

Submission #244849

Compilation message