oj.uz

Submission #295763

# Submission time Handle Problem Language Result Execution time Memory
295763 2020-09-09T22:16:04 Z aZvezda Stove (JOI18_stove) C++14
0 / 100
 1 ms 256 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
template<class T> inline void fix(T &x) {if(x >= mod | x <= -mod) {x %= mod;} if(x < 0) {x += mod;}}
#define out(x) cout << __LINE__ << ": " << (#x) << " = " << (x) << endl

signed main() {
    //ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll last = -1;
    ll n, k;
    cin >> n >> k;
    if(n == 1) {
        cout << 1 << endl;
        return 0;
    }
    ll total = 0;
    priority_queue<ll> pq;
    for(ll i = 0; i < n; i ++) {
        ll t;
        //cout << "Input";
        cin >> t;
        if(i != 0 && last != t - 1) {
            pq.push(t - last - 2);
        } else if(i != 0) {
            last = t;
            continue;
        } else {
            total -= t - 1;
        }
        last = t;
    }
    //cout << "!!" << last << " " << total << " " << total + last + 1 << endl;
    total += last + 1;
    total -= k;
    while(k > 1 && !pq.empty()) {
        //cout << "Wtf" << pq.top() << endl;
        total -= pq.top();
        pq.pop();
        k --;
    }
    cout << total << endl;
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -