제출 #74280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
74280		Vardanyan	Bali Sculptures (APIO15_sculpture)	C++17	9 / 100	261 ms	263168 KiB

sculpture

//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int A[N];
int K;
int n;
vector<long long> dp[N][N];
int main()
{
    int a,b;
    scanf("%d%d%d",&n,&a,&b);
    for(int i = 1;i<=n;i++) scanf("%d",&A[i]);
    long long c = 0;
    for(int i = 1;i<=n;i++){
        c+=A[i];
        dp[i][1].push_back(c);
    }
    long long ans = 10000000000000007;
    for(int k = 2;k<=b;k++){
        for(int i = 1;i<=n;i++){
            c = A[i];
            for(int j = i-1;j>=1;j--){
                for(int q = 0;q<dp[j][k-1].size();q++){
                    dp[i][k].push_back(dp[j][k-1][q]|c);
               //     if(k>=a && i == n) ans = min(ans,dp[j][k-1][q]|c);
                }
                c+=A[j];
            }
        }
    }
    for(int i = a;i<=b;i++){
        for(int j = 0;j<dp[n][i].size();j++){
            ans = min(ans,dp[n][i][j]);
        }
    }
    cout<<ans<<endl;
    return 0;
}

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

sculpture.cpp: In function 'int main()':
sculpture.cpp:24:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int q = 0;q<dp[j][k-1].size();q++){
                               ~^~~~~~~~~~~~~~~~~~
sculpture.cpp:33:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0;j<dp[n][i].size();j++){
                       ~^~~~~~~~~~~~~~~~
sculpture.cpp:12: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:13:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1;i<=n;i++) scanf("%d",&A[i]);
                             ~~~~~^~~~~~~~~~~~

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