Submission #660820

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
660820	2022-11-23T09:38:36 Z	danikoynov	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	11 ms	4764 KB

sculpture

#include <bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 100;

int dp[51][21][8001], n, A, B, a[maxn];
void solve()
{
    cin >> n >> A >> B;
    for (int i = 1; i <= n; i ++)
    {
        cin >> a[i];
    }

    dp[0][0][0] = 1;
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= B; j ++)
        {
            int sum = 0;
            for (int k = i; k > 0; k --)
            {
                sum = sum + a[k];
                for (int x = 0; x < 4001; x ++)
                {
                    int new_x = (x | sum);
                    dp[i][j][new_x] = max(dp[i][j][new_x], dp[k - 1][j - 1][x]);
                }
            }
        }
    }

    int best = 100;
    for (int j = A; j <= B; j ++)
    {
        for (int x = 0; x < 4000; x ++)
        {
            if (dp[n][j][x] != 0)
            {
                best = min(best, x);
                break;
            }
        }
    }

        cout << best << endl;
}

int main()
{
    solve();
    return 0;
}
/**
6 1 3
8 1 2 1 5 4
*/

Subtask #1

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	1 ms	852 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	11 ms	4692 KB	Output is correct
7	Correct	3 ms	1236 KB	Output is correct
8	Correct	4 ms	1492 KB	Output is correct
9	Correct	4 ms	1492 KB	Output is correct
10	Correct	4 ms	1492 KB	Output is correct
11	Incorrect	2 ms	696 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	2 ms	852 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	11 ms	4736 KB	Output is correct
7	Correct	5 ms	1236 KB	Output is correct
8	Correct	4 ms	1492 KB	Output is correct
9	Correct	4 ms	1492 KB	Output is correct
10	Correct	4 ms	1492 KB	Output is correct
11	Incorrect	2 ms	724 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	1 ms	852 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	11 ms	4692 KB	Output is correct
7	Correct	3 ms	1236 KB	Output is correct
8	Correct	5 ms	1460 KB	Output is correct
9	Correct	4 ms	1492 KB	Output is correct
10	Correct	4 ms	1468 KB	Output is correct
11	Incorrect	2 ms	696 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	2 ms	852 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	11 ms	4764 KB	Output is correct
7	Correct	3 ms	1336 KB	Output is correct
8	Correct	4 ms	1460 KB	Output is correct
9	Correct	4 ms	1512 KB	Output is correct
10	Correct	5 ms	1508 KB	Output is correct
11	Incorrect	2 ms	696 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	1 ms	852 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	11 ms	4680 KB	Output is correct
7	Correct	3 ms	1236 KB	Output is correct
8	Correct	4 ms	1492 KB	Output is correct
9	Correct	4 ms	1492 KB	Output is correct
10	Correct	4 ms	1528 KB	Output is correct
11	Incorrect	2 ms	704 KB	Output isn't correct
12	Halted	0 ms	0 KB	-