oj.uz

Submission #678055

# Submission time Handle Problem Language Result Execution time Memory
678055 2023-01-05T05:57:43 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 18 ms 1900 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (x).size() 
#define all(x) (x).begin(), (x).end()
 
using namespace std;
 
string alphabet = "abcdefghijklmnopqrstuvwxyz";

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ull n,k;
    cin >> n >> k;

    vector <ull> a(n),pref(n - 1);

    ull mx = 0,mn = 999999999999999;

    for(ull i = 0; i < n; i++)
    {
        cin >> a[i];

        mx = max(mx,a[i]);
        mn = min(mn,a[i]);

        if(i != 0)
        {
            pref[i - 1] = a[i] - a[i - 1];
        }
    }

    ull sum = mx - mn + 1;

    if(k == 1)
    {
        cout << (a[n - 1] - a[0]) + 1;
    }
    else if(n == k) 
    {
        cout << n;
    }
    else 
    {
        sort(all(pref));

        reverse(all(pref));

        for(ull i = 0; i < k - 1; i++)
        {
            sum -= pref[i] - 1;
        }

        cout << sum;
    }
    

    return 0;
}

/*
    
*/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 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 340 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 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 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 16 ms 1876 KB Output is correct
17 Correct 16 ms 1900 KB Output is correct
18 Correct 15 ms 1876 KB Output is correct
19 Correct 17 ms 1876 KB Output is correct
20 Correct 16 ms 1876 KB Output is correct
21 Correct 16 ms 1896 KB Output is correct
22 Correct 18 ms 1876 KB Output is correct
23 Correct 16 ms 1876 KB Output is correct
24 Correct 16 ms 1876 KB Output is correct