제출 #49403

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
49403	2018-05-28 10:28:27	okaybody10	Bali Sculptures (APIO15_sculpture)	C++11	100 / 100	148 ms	2576 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;
typedef long long ll;
const int N=2007;
ll partsum[N];
bool dp2[N][N];
int n,A,B,dp[N],bit[60];
bool solve()
{
    ll val=0;
    for(int i=0;i<44;i++) val+=bit[i]*(1LL<<i);
    if(A==1)
    {
        dp[0]=0;
        for(int i=1;i<=n;i++)
        {
            dp[i]=N;
            for(int j=0;j<i;j++)
            {
                if(((partsum[i]-partsum[j]) | val)== val) dp[i]=min(dp[i],dp[j]+1);
            }
        }
        if(dp[n]<=B) return true;
        return false;
    }
    dp2[0][0]=true;
    for(int i=1;i<=n;i++) dp2[i][0]=false;
    for(int i=1;i<=B;i++) dp2[0][i]=false;
    for(int i=1;i<=n;i++)
    {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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