oj.uz

Submission #1085655

# Submission time Handle Problem Language Result Execution time Memory
1085655 2024-09-08T14:24:15 Z mingga Bali Sculptures (APIO15_sculpture) C++17
46 / 100
 44 ms 70868 KB 
#include "bits/stdc++.h"

using namespace std;

#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define fast_cin()                  \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL)
#define out(file) freopen(file, "w", stdout)
#define in(file) freopen(file, "r", stdin)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define ll long long
int MOD = 1e9 + 7;
const int N = 2001;
int y[N], a, b, n;
ll ps[N], dp[N][N];

void sub1() {
  ll ans = inf;
  for(int mask = 0; mask < (1 << n); mask++) {
    if(((mask >> (n-1)) & 1) == 0) continue; 
    int cnt = __builtin_popcount(mask);
    if(cnt < a or cnt > b) continue;
    ll s = 0;
    ll cur = 0;
    // cerr << "CNT " << cnt << ln;
    for(int i = 0; i < n; i++) {
      s += y[i+1];
      if((mask >> i) & 1) {
        cur |= s;
        // cerr << s << ' ';
        s = 0;
      }
    }
    // cerr << ln;
    ans = min(ans, cur);
  }
  cout << ans;
}

bool f[51][51][1005];
void sub2() {
  f[0][0][0] = 1;
  for(int i = 1; i <= n; i++) {
    f[i][1][ps[i]] = 1;
  }
  int mx = ps[n];
  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= b; j++) {
      for(int k = 0; k <= mx; k++) {
        for(int t = i + 1; t <= n; t++) {
          f[t][j+1][k | (ps[t]-ps[i])] = f[t][j+1][k | (ps[t]-ps[i])] || f[i][j][k];
        }
      }
    }
  }
  for(int k = 0; k <= mx; k++) {
    for(int i = a; i <= b; i++) {
      if(f[n][i][k]) {
        cout << k;
        return;
      }
    }
  }
}

int g[101][2001];
void sub3() {
  g[0][0] = 1;
  int mx = ps[n];
  for(int i = 1; i <= n; i++) {
    for(int j = 0; j <= mx; j++) {
      g[i][j] = b + 1;
    }
  }
  for(int i = 1; i <= n; i++) g[i][ps[i]] = 1;
  for(int i = 1; i <= n; i++) {
    for(int j = 0; j <= mx; j++) {
      for(int t  = i + 1; t <= n; t++) {
        int cur = j | (ps[t] - ps[i]);
        g[t][cur] = min(g[t][cur], g[i][j] + 1);
      }
    }
  }
  for(int i = 0; i <= mx; i++) {
    if(g[n][i] <= b) {
      cout << i;
      return;
    }
  }
}
bool h[101][101];
void sub4() {
  int k = __lg((ll)ps[n]);
  int ans = 0;
  // cerr << k << ln;
  for(int z = k; z >= 0; z--) {
    h[0][0] = 1;
    // cerr << "BIT " << z << ln;
    memset(h, 0, sizeof h);
    for(int i = 1; i <= n; i++) {
      if((ps[i] ^ ans) >= (1 << z)) h[i][1] = 0;
      else h[i][1] = 1;
    }
    for(int i = 1; i <= n; i++) {
      for(int j = 1; j <= b; j++) {
        for(int t = i + 1; t <= n; t++) {
          bool ok = 1;
          int cur = ps[t] - ps[i];
          if((cur ^ ans) >= (1 << z)) ok = 0;
          h[t][j+1] = h[t][j+1] or (h[i][j] and ok);
        }
      }
    }
    // for(int i = 1; i <= n; i++) {
    //   for(int j = 1; j <= b; j++) {
    //     cout << h[i][j] << ' ';
    //   }
    //   cout << ln;
    // }
    bool ok = 0;
    for(int i = 1; i <= b; i++) {
      if(h[n][i]) {
        ok = 1;
        break;
      }
    }
    if(not ok) ans = ans | (1 << z);
    // cout << ans << ln;
  } 
  cout << ans;
}

signed main() {
    fast_cin();
    cin >> n >> a >> b;
    for(int i = 1; i <= n; i++) cin >> y[i], ps[i] = ps[i-1] + y[i];
    // if(n <= 20) sub1(); 
    if(n <= 20) sub1();
    else if(n <= 50) sub2();
    else if(n <= 100 and a == 1) sub3();
    else {
      sub4();
    }
    // sub4();
    // cout << ln;
    // sub2();
    // sub3();
    cerr << "\nTime: " << clock() * 1000 / CLOCKS_PER_SEC;
}

Subtask #1
9.0 / 9.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 1 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 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 34 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 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 464 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 4 ms 344 KB Output is correct
26 Correct 27 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 26 ms 348 KB Output is correct
34 Correct 30 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 30 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 472 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 31 ms 472 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 604 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 472 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 4 ms 472 KB Output is correct
26 Correct 26 ms 344 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 6 ms 1372 KB Output is correct
31 Correct 19 ms 1660 KB Output is correct
32 Correct 25 ms 1652 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 11 ms 1628 KB Output is correct
35 Correct 11 ms 1372 KB Output is correct
36 Correct 8 ms 1116 KB Output is correct

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 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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 30 ms 344 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 7 ms 1128 KB Output is correct
18 Correct 20 ms 1660 KB Output is correct
19 Correct 25 ms 1632 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 11 ms 1628 KB Output is correct
22 Correct 16 ms 1372 KB Output is correct
23 Correct 7 ms 1116 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 7 ms 1188 KB Output is correct
28 Correct 9 ms 1116 KB Output is correct
29 Correct 20 ms 1240 KB Output is correct
30 Correct 17 ms 1268 KB Output is correct
31 Correct 11 ms 1116 KB Output is correct
32 Correct 11 ms 1116 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 472 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 30 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 4 ms 464 KB Output is correct
26 Correct 27 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct
32 Correct 2 ms 352 KB Output is correct
33 Correct 27 ms 348 KB Output is correct
34 Correct 33 ms 348 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 32 ms 348 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 1 ms 608 KB Output is correct
39 Correct 3 ms 608 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 21 ms 1624 KB Output is correct
42 Correct 20 ms 1628 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 12 ms 1624 KB Output is correct
45 Correct 12 ms 1372 KB Output is correct
46 Correct 7 ms 1112 KB Output is correct
47 Correct 1 ms 720 KB Output is correct
48 Correct 3 ms 860 KB Output is correct
49 Correct 4 ms 1080 KB Output is correct
50 Correct 7 ms 1116 KB Output is correct
51 Correct 11 ms 1116 KB Output is correct
52 Correct 16 ms 1264 KB Output is correct
53 Correct 16 ms 1116 KB Output is correct
54 Correct 10 ms 1372 KB Output is correct
55 Correct 14 ms 1112 KB Output is correct
56 Runtime error 44 ms 70868 KB Execution killed with signal 11
57 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 34 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 460 KB Output is correct
17 Correct 1 ms 476 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 27 ms 348 KB Output is correct
21 Correct 31 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 33 ms 348 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 6 ms 1372 KB Output is correct
28 Correct 22 ms 1628 KB Output is correct
29 Correct 20 ms 1880 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 11 ms 1648 KB Output is correct
32 Correct 11 ms 1368 KB Output is correct
33 Correct 10 ms 1180 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 3 ms 860 KB Output is correct
36 Correct 4 ms 1088 KB Output is correct
37 Correct 9 ms 1112 KB Output is correct
38 Correct 8 ms 1116 KB Output is correct
39 Correct 16 ms 1268 KB Output is correct
40 Correct 16 ms 1116 KB Output is correct
41 Correct 10 ms 1116 KB Output is correct
42 Correct 11 ms 1116 KB Output is correct
43 Runtime error 43 ms 70736 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -