Submission #92397

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
92397	2019-01-02 18:45:40	KLPP	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	175 ms	632 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<iostream>
using namespace std;
typedef long long int lld;
lld ans[60];
lld DP1[20001];
int n,a,b;
lld arr[3000];
lld pow[60];
bool DP2[2000][2000];
void compute1(){
  lld sum[n+1];
  sum[0]=0;
  for(int i=0;i<n;i++){
    sum[i+1]=sum[i]+arr[i];
  }
  lld CMP=0;
  for(int i=0;i<60;i++)CMP+=(1-ans[i])*pow[i];
  //cout<<CMP<<endl;
  DP1[0]=0;
  for(int i=1;i<=n;i++){
    DP1[i]=100000;
    for(int j=0;j<i;j++){
      lld A=sum[i]-sum[j];
      //cout<<A<<endl;
      //cout<<(CMP&A)<<endl;
      if((CMP&A)==0){
        DP1[i]=min(DP1[i],DP1[j]+1);
      }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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