제출 #33773

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
33773	2017-11-01 15:47:33	dqhungdl	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	103 ms	10060 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 int64_t MAX=41;
int64_t n,A,B,a[2005],F1[2005];
bool Free[2005][2005],F[2005][2005],Free1[2005];
int64_t f1(int64_t i,int64_t mask)
{
    if(Free1[i]==true)
        return F1[i];
    F1[i]=1e9;
    Free1[i]=true;
    if(i>n)
        return F1[i]=0;
    for(int64_t t=i; t<=n; t++)
    {
        int64_t tmp=a[t]-a[i-1];
        if((mask|tmp)==mask)
            F1[i]=min(F1[i],f1(t+1,mask)+1);
    }
    return F1[i];
}
bool f(int64_t i,int64_t j,int64_t mask)
{
    if(Free[i][j]==true)
        return F[i][j];
    Free[i][j]=true;
    if(j>B)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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