oj.uz

답안 #161971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161971 2019-11-05T14:04:13 Z impri Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 3 ms 376 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,a,b;
int y[101];
int sum[101][101];
int dp[101][101];
int get(int num,int r){
if(r==1)return sum[1][num];
if(num==1)return y[1];
int res=sum[1][num];

if(dp[num][r]>=0)return dp[num][r];
for(int i=1;i<num;i++)
    res=min(res,get(i,r-1)|sum[i+1][num]);
return dp[num][r]=res;



}
int main()
{  
   memset(dp,-1,sizeof(dp));

  cin >> n >> a >> b;
  for(int i=1;i<=n;i++)
    cin >> y[i];
  for(int i=1;i<=n;i++){
    int r=0;
    for(int j=i;j<=n;j++){
        r+=y[j];
        sum[i][j]=r;
    }
  }
  cout << get(n,b);
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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