oj.uz

Submission #698018

# Submission time Handle Problem Language Result Execution time Memory
698018 2023-02-11T21:20:47 Z aqxa Stove (JOI18_stove) C++17
100 / 100
 20 ms 2332 KB 
#include <bits/stdc++.h>
using namespace std;

void IO(string io) { freopen((io+".in").c_str(), "r", stdin); freopen((io+".out").c_str(), "w", stdout); }

const int mxn = 1e5 + 10; 

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

  int n, k; 
  cin >> n >> k; 
  vector<int> a(n); 
  for (int i = 0; i < n; ++i) cin >> a[i]; 
  vector<int> c; 
  for (int i = 0; i < n-1; ++i) c.push_back(a[i+1]-a[i]); 
  sort(c.begin(), c.end()); 
  
  cout << std::accumulate(c.begin(), c.begin()+(n-k), 0) + k; 
  
  return 0; 
}

Compilation message

stove.cpp: In function 'void IO(std::string)':
stove.cpp:4:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    4 | void IO(string io) { freopen((io+".in").c_str(), "r", stdin); freopen((io+".out").c_str(), "w", stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:4:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    4 | void IO(string io) { freopen((io+".in").c_str(), "r", stdin); freopen((io+".out").c_str(), "w", stdout); }
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 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 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 328 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 328 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 17 ms 2332 KB Output is correct
17 Correct 17 ms 2260 KB Output is correct
18 Correct 20 ms 2264 KB Output is correct
19 Correct 17 ms 2256 KB Output is correct
20 Correct 17 ms 2196 KB Output is correct
21 Correct 17 ms 2244 KB Output is correct
22 Correct 17 ms 2252 KB Output is correct
23 Correct 17 ms 2248 KB Output is correct
24 Correct 17 ms 2232 KB Output is correct