oj.uz

답안 #111216

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111216 2019-05-14T08:39:32 Z ppnxblstr Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 2 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
int arr[2048];
long long qs[2048];
int dp[2048];
int main(){
    int n,a,b;
    scanf("%d%d%d",&n,&a,&b);
    for(int i = 1; i <= n; i++){
        scanf("%d",arr+i);
        qs[i] = qs[i-1] + arr[i];
    }
    long long ans = 0ll;
    for(int i = 50; i >= 0; i--){
        dp[0] = 0;
        for(int j = 1; j <= n; j++){
            dp[j] = 1e9;
            for(int l = 0; l < j; l++){
                if((((qs[j] - qs[l]) >> (long long)i) << (long long)i) == ans){
                    dp[j] = min(dp[j], dp[l]+1);
                }
            }
        }
        if(dp[n] > b){
            ans += 1ll << (long long)i;
        }
    }
    printf("%lld\n",ans);
    return 0;
}
/*
6 1 3
8 1 2 1 5 4
 */

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:8: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:10:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",arr+i);
         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -