oj.uz

Submission #570649

# Submission time Handle Problem Language Result Execution time Memory
570649 2022-05-30T22:40:30 Z nohaxjustsoflo Stove (JOI18_stove) C++17
100 / 100
 20 ms 2284 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen(-1e9, 1e8); ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN = 1e6+50000;
const int mod = 998244353;
const int mxlogN = 34;
const int mxK = 26;
const int inf = 1e9;
const int K = 100000;
int a[mxN];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, k; cin >> n >> k;
    for(int i=0; i<n; i++) cin >> a[i];
    vector<int> b;
    for(int i=1; i<n; i++) b.push_back(a[i]-a[i-1]-1);
    sort(b.begin(), b.end());
    ll cost=a[n-1]-a[0]+1;
    while(--k&&b.size())
    {
        cost-=b.back();
        b.pop_back();
    }
    cout << cost << "\n";
}
/**
1 2 3 4 5 6
*/

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 336 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 336 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 368 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 392 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 336 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 368 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 392 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 2264 KB Output is correct
17 Correct 18 ms 2284 KB Output is correct
18 Correct 17 ms 2264 KB Output is correct
19 Correct 18 ms 2264 KB Output is correct
20 Correct 17 ms 2256 KB Output is correct
21 Correct 18 ms 2248 KB Output is correct
22 Correct 17 ms 2264 KB Output is correct
23 Correct 18 ms 2264 KB Output is correct
24 Correct 19 ms 2264 KB Output is correct