Submission #1009712

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1009712	2024-06-28T00:18:11 Z	asdfgrace	Bali Sculptures (APIO15_sculpture)	C++17	50 / 100	72 ms	604 KB

sculpture

#include <bits/stdc++.h>
using namespace std;

#define dbg(x) x
#define prt(x) dbg(cerr << x)
#define pv(x) dbg(cerr << #x << " = " << x << '\n')
#define pv2(x) dbg(cerr << #x << " = " << x.first << ',' << x.second << '\n')
#define parr(x) dbg(prt(#x << " = { "); for (auto y : x) prt(y << ' '); prt("}\n");)
#define parr2(x) dbg(prt(#x << " = { "); for (auto [y, z] : x) prt(y << ',' << z << "  "); prt("}\n");)
#define parr2d(x) dbg(prt(#x << ":\n"); for (auto arr : x) {parr(arr);} prt('\n'));
#define parr2d2(x) dbg(prt(#x << ":\n"); for (auto arr : x) {parr2(arr);} prt('\n'));

/*
a <= x <= b subsegments
MINIMIZE bitwise or of sums
either n^2 and a=1 or n^3 and a is maybe not 1

st with a>=1:
can we iterate thru bits
the idea:
given previous restrictions on bits that have to be 0
(others can be 1 & are impossible to make 0)
can we make it good for this
for (i)
for (last i)
if the sum is good
for all dp[last_i][j] that are true, dp[i][j + 1] is true
complexity = n^2 * b * log(s)


st with a==1:
iterate thru sums bc only go up to like 2000
for each num find if you can have or <= num
by doing dp
bc a=1
can just track possible/not and min # of segments needed
at every ind
complexity = n^2 * log(s) ---> was gonna be max_s but turns out log(s) works
can this pass st5
if we binary search the maximum or
or do bit by bit
yeah
*/

int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int n, a, b;
  cin >> n >> a >> b;
  vector<long long> s(n);
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
    sum += s[i];
  }
  long long p2 = 1ll, mxbit = 0;
  while (p2 < sum) {
    p2 <<= 1; mxbit++;
  }
  long long req = (1ll << (mxbit + 1)) - 1;
  if (a == 1) {
    for (int bit = mxbit; bit >= 0; bit--) {
      req -= (1ll << bit);
      vector<long long> best(n + 1, 1e9);
      best[0] = 0;
      for (int i = 1; i <= n; i++) {
        long long lst = 0;
        for (int j = i - 1; j >= 0; j--) {
          lst += s[j];
          if ((req | lst) == req) {
            best[i] = min(best[i], best[j] + 1);
          }
        }
      }
      if (best[n] > b) {
        req += (1ll << bit);
      }
    }
  } else {
    for (int bit = mxbit; bit >= 0; bit--) {
      req -= (1ll << bit);
      vector<vector<bool>> ok(n + 1, vector<bool>(b, false));
      ok[0][0] = true;
      for (int i = 1; i <= n; i++) {
        long long lst = 0;
        for (int j = i - 1; j >= 0; j--) {
          lst += s[j];
          if ((req | lst) == req) {
            for (int k = 0; k < b; k++) {
              if (ok[j][k]) {
                ok[i][k + 1] = true;
              }
            }
          }
        }
        bool good = false;
        for (int i = a; i <= b; i++) {
          if (ok[n][i]) {
            good =  true;
            break;
          }
        }
        if (!good) {
          req += (1ll << bit);
        }
      }
    }
  }
  cout << req << '\n';
}

/*
any observations help

check every line
IF YOUR LINES AREN'T WRONG
CHECK IF YOUR LINES ARE IN THE RIGHT ORDER

NEVER GIVE UP
*/

Subtask #1
0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	344 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	600 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	456 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Incorrect	348 KB	Output isn't correct
15	Halted	0 KB	-

Subtask #2
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	452 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Incorrect	0 ms	348 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	452 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	452 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	456 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	600 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	456 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Incorrect	0 ms	348 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #5
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	456 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	344 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	1 ms	344 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	6 ms	348 KB	Output is correct
53	Correct	13 ms	348 KB	Output is correct
54	Correct	16 ms	348 KB	Output is correct
55	Correct	17 ms	344 KB	Output is correct
56	Correct	58 ms	480 KB	Output is correct
57	Correct	56 ms	344 KB	Output is correct
58	Correct	58 ms	484 KB	Output is correct
59	Correct	57 ms	348 KB	Output is correct
60	Correct	72 ms	492 KB	Output is correct
61	Correct	1 ms	344 KB	Output is correct
62	Correct	8 ms	348 KB	Output is correct
63	Correct	17 ms	484 KB	Output is correct
64	Correct	15 ms	344 KB	Output is correct
65	Correct	28 ms	492 KB	Output is correct
66	Correct	44 ms	348 KB	Output is correct
67	Correct	57 ms	348 KB	Output is correct
68	Correct	61 ms	344 KB	Output is correct
69	Correct	58 ms	492 KB	Output is correct

Submission #1009712

Compilation message

Subtask #1 0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 29.0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
29.0 / 29.0