oj.uz

답안 #473057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
473057 2021-09-15T03:13:51 Z jalsol Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 332 KB 
// looking to shine brighter in this world...

#define TASK "sculpture"

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 100 + 5;

int n, lo, hi;
int a[maxn];
ll pref[maxn];

ll dp[maxn][maxn];

ll go(int i, int np) {
    if (i == 0 && np == 0) {
        return 0;
    }
    if (i == 0 || np == 0) {
        return linf;
    }

    ll& ret = dp[i][np];
    if (ret != -1) return ret;

    ret = linf;
    Ford (j, i, 1) {
        chmin(ret, (pref[i] - pref[j - 1]) | go(j - 1, np - 1));
    }

    return ret;
}

signed main() {
    cin >> n >> lo >> hi;
    For (i, 1, n) {
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }


    ll ans = linf;
    Ford (i, hi, lo) {
        memset(dp, -1, sizeof(dp));
        chmin(ans, go(n, i));
    }

    cout << ans << '\n';

    return 0;
}

// there is no way this thing is gonna work lmao
// as expected, very funni haha

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 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.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 #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 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -