oj.uz

Submission #1083902

# Submission time Handle Problem Language Result Execution time Memory
1083902 2024-09-04T13:23:41 Z May27_th Stove (JOI18_stove) C++17
100 / 100
 24 ms 2808 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define i64 long long
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()

void Solve(void) {
  int N, K; cin >> N >> K;
  vector<int> T(N + 1);
  vector<bool> en(N + 1, false);
  vector<pair<int, int>> d;
  for (int i = 1; i <= N; i ++) {
    cin >> T[i];
    if (i > 1) {
      d.pb(mp(T[i] - T[i - 1], i - 1));
    }
  }
  sort(d.rbegin(), d.rend());
  for (int i = 0; i < K - 1; i ++) {
    en[d[i].second] = true;
    // cout << d[i].second << "\n";
  }
  int prev = -1;
  i64 ans = 0;
  for (int i = 1; i <= N; i ++) {
    if (prev == -1) prev = T[i];
    if (en[i]) {
      ans += T[i] + 1 - prev;
      prev = -1;
    }
  }
  if (prev != -1) ans += T[N] + 1 - prev;
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  int Tests = 1; // cin >> Tests; 
  while (Tests --) {
    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 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 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 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 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 492 KB Output is correct
13 Correct 1 ms 348 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 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 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 492 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 16 ms 2780 KB Output is correct
17 Correct 17 ms 2776 KB Output is correct
18 Correct 16 ms 2776 KB Output is correct
19 Correct 15 ms 2780 KB Output is correct
20 Correct 16 ms 2776 KB Output is correct
21 Correct 21 ms 2808 KB Output is correct
22 Correct 24 ms 2776 KB Output is correct
23 Correct 16 ms 2780 KB Output is correct
24 Correct 15 ms 2776 KB Output is correct