oj.uz

Submission #608345

# Submission time Handle Problem Language Result Execution time Memory
608345 2022-07-27T07:05:23 Z Sharky Stove (JOI18_stove) C++17
100 / 100
 25 ms 3220 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
using vi = vector<int>;
using vb = vector<bool>;
using pi = pair<int, int>;
 
#define pb push_back
#define all(x) x.begin(), x.end()
#define FOR(i, a, b) for (int i = (int) a; i < (int) b; i++)
#define rep(i, n) for (int i = 0; i < (int) n; i++)
#define rep1(i, n) for (int i = 1; i <= (int) n; i++)
#define sz(x) (int) x.size()
#define fi first
#define se second
#define rd(a, sz) rep(i, n) cin >> a[i];
#define rd1(a, sz) rep1(i, n) cin >> a[i];
 
void __print(int x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << '}';}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
#define debug(...)
#endif
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
const int MOD = 1e9 + 7;
const int inf = 1e18;
 
void solve(int tc) {
    int n, k, cnt = 1; 
    cin >> n >> k;
    int ans = n;
    vector<int> t(n);
    priority_queue<int, vector<int>, greater<int>> q;
    rd(t, n);
    for (int i = 1; i < n; i++) {
            cnt++;
            q.push(t[i] - t[i-1] - 1);
    }
    while (!q.empty() && cnt > k) {
        cnt--;
        ans += q.top();
        q.pop();
    }
    cout << ans << "\n";
}
 
signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    solve(73);
    return 0;
}

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 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 320 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 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 320 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 332 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 376 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 376 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 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 320 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 332 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 376 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 25 ms 3144 KB Output is correct
17 Correct 24 ms 3152 KB Output is correct
18 Correct 23 ms 3148 KB Output is correct
19 Correct 21 ms 3148 KB Output is correct
20 Correct 17 ms 3220 KB Output is correct
21 Correct 13 ms 3136 KB Output is correct
22 Correct 13 ms 3156 KB Output is correct
23 Correct 15 ms 3144 KB Output is correct
24 Correct 18 ms 3144 KB Output is correct