oj.uz

Submission #256088

# Submission time Handle Problem Language Result Execution time Memory
256088 2020-08-02T09:41:11 Z fedoseevtimofey Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 124 ms 512 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>
 
using namespace std;
 
typedef long long ll;
 
int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int n, a, b;
  cin >> n >> a >> b;
  vector <int> v(n);
  for (int i = 0; i < n; ++i) cin >> v[i];
  vector <ll> pref(n + 1);
  for (int i = 0; i < n; ++i) {
    pref[i + 1] = pref[i] + v[i];
  }

  auto get = [&] (int l, int r) {
    return pref[r + 1] - pref[l];
  };

  if (n <= 200) {
    auto can = [&] (ll mask) {
      vector <vector <int>> dp(n + 1, vector <int> (n + 1));
      dp[0][0] = 1; 
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
          for (int k = i; k < n; ++k) {
            ll sm = get(i, k);
            if ((sm & mask) == 0) {
              dp[k + 1][j + 1] |= dp[i][j];
            }
          }
        }
      }
      bool ok = false;
      for (int x = a; x <= b; ++x) {
        ok |= dp[n][x];
      }
      return ok;
    };
    ll mask = 0;
    ll ans = 0;
    for (int b = 60; b >= 0; --b) {
      if (can(mask + (1LL << b))) {
        mask += (1LL << b);
      } else {
        ans += (1LL << b);
      }
    }
    cout << ans << '\n';
  } else {
    auto can = [&] (ll mask) {
      vector <int> dp(n + 1, (int)1e9);
      dp[0] = 0;
      for (int i = 0; i < n; ++i) {
        for (int j = i; j < n; ++j) {
          ll sm = get(i, j);
          if ((sm & mask) == 0) {
            dp[j + 1] = min(dp[j + 1], dp[i] + 1);
          }
        }
      }
      return (dp[n] <= b);
    };
    ll mask = 0;
    ll ans = 0;
    for (int b = 60; b >= 0; --b) {
      if (can(mask + (1LL << b))) {
        mask += (1LL << b);
      } else {
        ans += (1LL << b);
      }
    }
    cout << ans << '\n';

  }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 8 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 12 ms 384 KB Output is correct
20 Correct 13 ms 384 KB Output is correct
21 Correct 13 ms 384 KB Output is correct
22 Correct 13 ms 384 KB Output is correct
23 Correct 13 ms 384 KB Output is correct
24 Correct 13 ms 384 KB Output is correct
25 Correct 27 ms 384 KB Output is correct
26 Correct 44 ms 404 KB Output is correct
27 Correct 71 ms 384 KB Output is correct
28 Correct 90 ms 384 KB Output is correct
29 Correct 93 ms 384 KB Output is correct
30 Correct 92 ms 384 KB Output is correct
31 Correct 67 ms 384 KB Output is correct
32 Correct 92 ms 384 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 6 ms 384 KB Output is correct
40 Correct 8 ms 384 KB Output is correct
41 Correct 12 ms 384 KB Output is correct
42 Correct 10 ms 384 KB Output is correct
43 Correct 16 ms 384 KB Output is correct
44 Correct 12 ms 384 KB Output is correct
45 Correct 12 ms 384 KB Output is correct
46 Correct 12 ms 512 KB Output is correct
47 Correct 13 ms 384 KB Output is correct
48 Correct 26 ms 384 KB Output is correct
49 Correct 45 ms 404 KB Output is correct
50 Correct 72 ms 504 KB Output is correct
51 Correct 93 ms 420 KB Output is correct
52 Correct 91 ms 424 KB Output is correct
53 Correct 93 ms 384 KB Output is correct
54 Correct 88 ms 424 KB Output is correct
55 Correct 87 ms 384 KB Output is correct
56 Correct 14 ms 384 KB Output is correct
57 Correct 32 ms 384 KB Output is correct
58 Correct 50 ms 384 KB Output is correct
59 Correct 65 ms 436 KB Output is correct
60 Correct 67 ms 384 KB Output is correct
61 Correct 65 ms 384 KB Output is correct
62 Correct 70 ms 384 KB Output is correct
63 Correct 70 ms 504 KB Output is correct
64 Correct 69 ms 384 KB Output is correct
65 Correct 14 ms 384 KB Output is correct
66 Correct 19 ms 384 KB Output is correct
67 Correct 41 ms 404 KB Output is correct
68 Correct 48 ms 384 KB Output is correct
69 Correct 64 ms 384 KB Output is correct
70 Correct 61 ms 428 KB Output is correct
71 Correct 73 ms 428 KB Output is correct
72 Correct 69 ms 420 KB Output is correct
73 Correct 67 ms 384 KB Output is correct
74 Correct 69 ms 384 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 360 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 416 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 12 ms 384 KB Output is correct
29 Correct 12 ms 384 KB Output is correct
30 Correct 12 ms 384 KB Output is correct
31 Correct 13 ms 384 KB Output is correct
32 Correct 12 ms 384 KB Output is correct
33 Correct 12 ms 384 KB Output is correct
34 Correct 13 ms 384 KB Output is correct
35 Correct 27 ms 384 KB Output is correct
36 Correct 44 ms 384 KB Output is correct
37 Correct 70 ms 384 KB Output is correct
38 Correct 91 ms 384 KB Output is correct
39 Correct 90 ms 384 KB Output is correct
40 Correct 94 ms 504 KB Output is correct
41 Correct 94 ms 384 KB Output is correct
42 Correct 91 ms 504 KB Output is correct
43 Correct 10 ms 384 KB Output is correct
44 Correct 31 ms 384 KB Output is correct
45 Correct 48 ms 384 KB Output is correct
46 Correct 63 ms 384 KB Output is correct
47 Correct 61 ms 384 KB Output is correct
48 Correct 63 ms 384 KB Output is correct
49 Correct 67 ms 384 KB Output is correct
50 Correct 65 ms 384 KB Output is correct
51 Correct 67 ms 384 KB Output is correct
52 Correct 11 ms 384 KB Output is correct
53 Correct 18 ms 384 KB Output is correct
54 Correct 33 ms 384 KB Output is correct
55 Correct 42 ms 384 KB Output is correct
56 Correct 121 ms 384 KB Output is correct
57 Correct 119 ms 384 KB Output is correct
58 Correct 116 ms 384 KB Output is correct
59 Correct 117 ms 384 KB Output is correct
60 Correct 122 ms 384 KB Output is correct
61 Correct 70 ms 384 KB Output is correct
62 Correct 18 ms 384 KB Output is correct
63 Correct 34 ms 384 KB Output is correct
64 Correct 31 ms 384 KB Output is correct
65 Correct 60 ms 428 KB Output is correct
66 Correct 93 ms 432 KB Output is correct
67 Correct 118 ms 384 KB Output is correct
68 Correct 124 ms 432 KB Output is correct
69 Correct 116 ms 440 KB Output is correct