oj.uz

Submission #470834

# Submission time Handle Problem Language Result Execution time Memory
470834 2021-09-05T22:26:50 Z jalsol Stove (JOI18_stove) C++17
20 / 100
 69 ms 460 KB 
// looking to shine brighter in this world...

#define TASK "stove"

#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 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 = 1e5 + 5;

int n, k;
int a[maxn];

signed main() {
    cin >> n >> k;
    For (i, 1, n) cin >> a[i];
    assert(n <= 20);

    int ans = inf;
    Rep (mask, 1 << n) {
        int sum = 0;
        int cnt = 0;

        Rep (i, n) {
            int p = i + 1;
            while (p < n && (mask >> i & 1) == (mask >> p & 1)) {
                ++p;
            }

            sum += a[p] + 1 - a[i + 1];
            i = p - 1;
            ++cnt;
        }

        if (cnt <= k) chmin(ans, sum);
    }

    cout << ans << '\n';

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 2 ms 316 KB Output is correct
8 Correct 69 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 2 ms 316 KB Output is correct
8 Correct 69 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Runtime error 1 ms 460 KB Execution killed with signal 6
11 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 2 ms 316 KB Output is correct
8 Correct 69 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Runtime error 1 ms 460 KB Execution killed with signal 6
11 Halted 0 ms 0 KB -