제출 #45696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45696		mirbek01	Bali Sculptures (APIO15_sculpture)	C++17	9 / 100	174 ms	1180 KiB

sculpture

# include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 2;

int n, ar[N], a, b;
long long ans = 1e18;

int main(){
      cin >> n >> a >> b;

      for(int i = 0; i < n; i ++)
            cin >> ar[i];
      if(n > 20) return 0;
      for(int mask = 0; mask < (1 << n); mask ++){
            int last = -1, cnt = 0;
            for(int i = 0; i < n; i ++){
                  int bit = (1 << i) & mask;
                  if(bit) bit = 1;
                  if(bit != last) cnt ++;
                  last = bit;
            }
            if(a <= cnt && cnt <= b){
                  long long res = 0, sum = 0;
                  last = -1;
                  for(int i = 0; i < n; i ++){
                        int bit = (1 << i) & mask;
                        if(bit) bit = 1;
                        if(bit != last){
                              res |= sum;
                              sum = 0;
                        }
                        sum += ar[i];
                        last = bit;
                  }
                  res |= sum;
                  ans = min(ans, res);
            }
      }

      cout << ans << endl;
}
/**
6 1 3
8 1 2 1 5 4
**/

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