oj.uz

Submission #921405

# Submission time Handle Problem Language Result Execution time Memory
921405 2024-02-03T19:12:59 Z AverageAmogusEnjoyer Stove (JOI18_stove) C++17
100 / 100
 14 ms 2204 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> bool cmin(T &i, T j) { return i > j ? i=j,true:false; }
template<class T> bool cmax(T &i, T j) { return i < j ? i=j,true:false; }
const int nax = 100100;
int a[nax],b[nax],n,k;
int main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr);
    cin >> n >> k;
    for (int i=0;i<n;i++) {
        cin >> a[i];
    }
    for (int i=0;i<n-1;i++) {
        b[i] = a[i+1]-a[i]-1;
    }
    sort(b,b+n-1);
    reverse(b,b+n-1);
    int ans = a[n-1] - a[0] + 1;
    for (int i=0;i<k-1;i++) {
        ans -= b[i];
    }
    cout << ans << "\n";
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 1 ms 484 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 1 ms 484 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 2136 KB Output is correct
17 Correct 14 ms 2172 KB Output is correct
18 Correct 14 ms 2204 KB Output is correct
19 Correct 14 ms 2136 KB Output is correct
20 Correct 14 ms 2140 KB Output is correct
21 Correct 14 ms 2136 KB Output is correct
22 Correct 14 ms 2140 KB Output is correct
23 Correct 14 ms 1984 KB Output is correct
24 Correct 14 ms 2140 KB Output is correct