oj.uz

답안 #542115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542115 2022-03-25T12:29:26 Z T0p_ Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e3 + 10;

long long dp[N][N];

int main()
{
    int n, a, b;
    scanf(" %d %d %d",&n,&a,&b);

    for(int i=1 ; i<=n ; i++)
    {
        scanf(" %lld",&dp[1][i]);
        dp[1][i] += dp[1][i-1];
    }

    for(int i=2 ; i<=b ; i++)
    {
        for(int j=i ; j<=n ; j++)
        {
            dp[i][j] = 1e18;
            for(int k=i ; k<=j ; k++)
            {
                dp[i][j] = min(dp[i][j], dp[i-1][k-1] | (dp[1][j] - dp[1][k-1]));
            }
        }
    }

    printf("%lld\n",dp[b][n]);
    return 0;
}

Compilation message

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

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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