제출 #110959

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
110959	2019-05-13 11:47:22	square1001	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	498 ms	1064 KiB

sculpture

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bitset>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int bits = 41;
int main() {
  int N, A, B;
  cin >> N >> A >> B;
  vector<long long> V(N), S(N + 1);
  for(int i = 0; i < N; ++i) {
    cin >> V[i];
    S[i + 1] = S[i] + V[i];
  }
  long long cur = 0;
  for(int i = bits - 1; i >= 0; --i) {
    vector<bitset<2001> > dp(N + 1);
    dp[0][0] = 1;
    for(int j = 1; j <= N; ++j) {
      for(int k = 0; k < j; ++k) {
        long long X = S[j] - S[k];
        if((X | cur | ((1LL << i) - 1)) == (cur | ((1LL << i) - 1))) {
          dp[j] |= dp[k] << 1;
        }
      }
    }
    bool ok = false;
    for(int j = A; j <= B; ++j) {
      if(dp[N][j]) ok = true;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 29 / 29