제출 #145986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145986		mhy908	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	180 ms	524 KiB

sculpture

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
int n, a, b;
LL arr[2010], sum[2010];
int dp[2010];
bool ch[110][110];
bool poss(LL num)
{
    if(a==1){
        for(int i=1; i<=n; i++){
            dp[i]=b+1;
            for(int j=1; j<=i; j++){
                LL t=sum[i]-sum[j-1];
                if((t&(~num))==0){
                    dp[i]=min(dp[i], dp[j-1]+1);
                }
            }
        }
        return dp[n]<=b;
    }
    else{
        memset(ch, 0, sizeof(ch));
        ch[0][0]=true;
        for(int i=1; i<=n; i++){
            for(int j=1; j<=i; j++){
                for(int k=1; k<=i; k++){
                    LL t=sum[i]-sum[k-1];
                    if(ch[k-1][j-1]&&((t&(~num))==0)){
                        ch[i][j]=true;
                    }
                }
            }
        }
        for(int i=a; i<=b; i++){
            if(ch[n][i])return true;
        }
        return false;
    }
}
int main()
{
    scanf("%d %d %d", &n, &a, &b);
    for(int i=1; i<=n; i++){
        scanf("%lld", &arr[i]);
        sum[i]=sum[i-1]+arr[i];
    }
    LL ans=(1LL<<55)-1LL;
    for(int i=54; i>=0; i--){
        LL temp=(1LL<<i);
        if(poss(ans&(~temp)))ans&=(~temp);
    }
    printf("%lld", ans);
}

컴파일 시 표준 에러 (stderr) 메시지

sculpture.cpp: In function 'int main()':
sculpture.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &a, &b);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:50:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~~~

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