oj.uz

답안 #74277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
74277 2018-08-30T19:39:49 Z Vardanyan Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 90 ms 95028 KB 
//#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 = k;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][j].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];
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

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: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
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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