제출 #35170

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
35170	2017-11-18 14:27:59	cheater2k	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	186 ms	2212 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 <bits/stdc++.h>
using namespace std;
const int N = 2005;
int n, A, B;
long long a[N];
long long OR;
// ------------------------------------------------
bool dp[110][110];
bool check(int x) {
  memset(dp, 0, sizeof dp);
  long long t = (OR >> x);
  dp[0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int gr = 1; gr <= B; ++gr) {
      for (int j = 0; j < i; ++j) {
        long long cur = ((a[i] - a[j]) >> x);
        if ((t & cur) == cur) dp[i][gr] = max(dp[i][gr], dp[j][gr-1]);
      }
    }
  }
  for (int gr = A; gr <= B; ++gr) if (dp[n][gr]) return true;
  return false;
}
void solve() {
  for (int i = 49; i >= 0; --i) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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