oj.uz

답안 #523109

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523109 2022-02-07T05:45:03 Z vonatlus Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 332 KB 
/// adil sultanov | vonat1us 

#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")

#include<bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
 
using namespace std;

using ll = long long;
using pii = pair<int, int>;                                   

const int MOD = 1e9 + 7; 
const int INF = 1e9 + 1e2;
  
void fin() {
#ifdef AM
    freopen(".in", "r", stdin);
#endif        
}                   

const bool flag = 0;

const int N = 2e3+10;

ll dp[N][N];

void ma1n() {
    int n, L, R;
    cin >> n >> L >> R;
    vector<int> a(n);
    for (int& x : a) cin >> x;
    for (int i = 0; i < n; ++i) {
        dp[i][1] = (i ? dp[i-1][1] : 0ll) + a[i];
    }
    for (int k = 2; k <= R; ++k) {
        for (int i = 0; i < n; ++i) {
            ll sum = 0;            
            dp[i][k] = (1ll<<50);
            for (int j = i; j >= k-1; --j) {
                sum += a[j];
                dp[i][k] = min(dp[i][k], (dp[j-1][k-1]|sum));
            } 
        }
    }
    ll ans = (1ll<<50);
    for (int k = L; k <= R; ++k) {
        ans = min(ans, dp[n-1][k]);
    }
    cout << ans;
} 

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr), fin();
    int ts = 1;
    if (flag) {
        cin >> ts;
    }
    while (ts--) {
        ma1n(); 
    }
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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