oj.uz

Submission #685307

# Submission time Handle Problem Language Result Execution time Memory
685307 2023-01-24T03:41:49 Z zeroesandones Stove (JOI18_stove) C++17
100 / 100
 20 ms 3200 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define sp " "

#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb emplace_back

const ll inf = 1e15;

void solve()
{
    ll n, k;
    cin >> n >> k;

    ll a[n];
    FOR(i, 0, n)
        cin >> a[i];

    ll total = a[n - 1] + 1 - a[0];

    vi diff;
    FOR(i, 1, n) {
        diff.pb(a[i] - a[i - 1] - 1);
    }

    /* for(auto i : diff) */
    /*     cout << i << sp; */
    /* cout << nl; */

    sort(all(diff));
    reverse(all(diff));
    FOR(i, 0, min((ll) diff.size(), k - 1)) {
        total -= diff[i];
    }

    cout << total << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 372 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 372 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 372 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 372 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 20 ms 3152 KB Output is correct
17 Correct 17 ms 3136 KB Output is correct
18 Correct 17 ms 3144 KB Output is correct
19 Correct 18 ms 3132 KB Output is correct
20 Correct 18 ms 3148 KB Output is correct
21 Correct 20 ms 3200 KB Output is correct
22 Correct 19 ms 3200 KB Output is correct
23 Correct 17 ms 3132 KB Output is correct
24 Correct 17 ms 3124 KB Output is correct