Submission #14390

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
14390	2015-05-13 16:50:55	kriii	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	99 ms	1116 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 <stdio.h>
int N,A,B,G[2020]; long long X[2020]; bool gr[101][101];
int main()
{
  scanf ("%d %d %d",&N,&A,&B);
  for (int i=1;i<=N;i++){
    scanf ("%lld",&X[i]);
    X[i] += X[i-1];
  }
  if (A == 1){
    long long ans = 0;
    for (int k=40;k>=0;k--){
      long long want = ans + (1ll << k) - 1;
      for (int i=1;i<=N;i++) G[i] = 10000;
      for (int j=1;j<=N;j++) for (int i=1;i<=j;i++){
        long long see = X[j] - X[i-1];
        if ((see | want) == want){
          if (G[j] > G[i-1] + 1)
            G[j] = G[i-1] + 1;
        }
      }
      if (G[N] > B) ans += (1ll << k);
    }
    printf ("%lld\n",ans);
  }
  else{
    long long ans = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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