oj.uz

Submission #970637

# Submission time Handle Problem Language Result Execution time Memory
970637 2024-04-27T01:47:44 Z Roumak77 Stove (JOI18_stove) C++17
100 / 100
 16 ms 2908 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <limits>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
using namespace std;

using ll = long long;

void solve(){

    ll n, k;
    cin >> n >> k;

    if(n == 1){
        cout << 1 << endl;
        return;
    }

    vector<ll> list_n(n, 0);

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

    vector<ll> diff(n - 1, 0);

    for(ll i = 0; i < n - 1; i++){
        diff[i] = list_n[i + 1] - list_n[i];
    }

    sort(diff.begin(), diff.end());


    ll total = n;

    for(ll i = 0; i < n - k; i++){
        total += diff[i] - 1;
    }

    cout << total;


}


int main(){

    ios_base::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);

    ll t = 1;

    while(t--){
        solve();
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 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 452 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 452 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 452 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 2908 KB Output is correct
17 Correct 14 ms 2908 KB Output is correct
18 Correct 14 ms 2908 KB Output is correct
19 Correct 16 ms 2908 KB Output is correct
20 Correct 14 ms 2908 KB Output is correct
21 Correct 14 ms 2908 KB Output is correct
22 Correct 14 ms 2900 KB Output is correct
23 Correct 14 ms 2908 KB Output is correct
24 Correct 14 ms 2776 KB Output is correct