oj.uz

답안 #45728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
45728 2018-04-16T04:54:53 Z Just_Solve_The_Problem Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 2 ms 584 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");

const int N = (int)2e3 + 7;
const int inf = (int)1e9 + 7;

int n, a, b;
int ar[N];
ll dp[N][N];
ll pref[N];

ll get(int l, int r) {
  return pref[r] - pref[l - 1];
}

main() {
  scanf("%d %d %d", &n, &a, &b);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &ar[i]);
    pref[i] = pref[i - 1] + ar[i];
  }
  for (int j = 1; j <= n; j++) {
    dp[1][j] = pref[j];
//    cout << dp[1][j] << ' ';
  }
//  cout << endl;
  for (int i = 2; i <= b; i++) {
    for (int j = 1; j <= n; j++) {
      dp[i][j] = dp[i - 1][j];
      for (int k = 2; k <= j; k++) {
        dp[i][j] = min(dp[i][j], dp[i - 1][k - 1] | get(k, j));
      }
//      cout << dp[i][j] << ' ';
    }
//    cout << endl;
  }
  ll mn = 1e18;
  for (int i = a; i <= b; i++) {
    mn = min(mn, dp[i][n]);
  }
  cout << mn;
}
/*
5 4 5
6 2 2 9 0
11
*/

Compilation message

sculpture.cpp:30:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:31:8: 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:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &ar[i]);
     ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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