oj.uz

Submission #1096599

# Submission time Handle Problem Language Result Execution time Memory
1096599 2024-10-04T21:15:37 Z Braulinho Stove (JOI18_stove) C++17
100 / 100
 31 ms 2908 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
    ll n, t;
    cin >> n >> t;

    vector<ll> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    vector<ll> gap(n - 1);
    for(int i = 1; i < n; i++) {
        gap[i - 1] = a[i] - a[i - 1] - 1;
    }

    sort(gap.begin(), gap.end(), greater<int>());

    int ans = a[n - 1] - a[0] + 1;

    for(int i = 0; i < t - 1; i++) {
        ans -= gap[i];
    }

    cout << ans << endl;

    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 31 ms 2908 KB Output is correct
17 Correct 30 ms 2864 KB Output is correct
18 Correct 31 ms 2900 KB Output is correct
19 Correct 30 ms 2900 KB Output is correct
20 Correct 29 ms 2908 KB Output is correct
21 Correct 30 ms 2900 KB Output is correct
22 Correct 30 ms 2900 KB Output is correct
23 Correct 30 ms 2900 KB Output is correct
24 Correct 30 ms 2876 KB Output is correct