| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1017696 |
2024-07-09T09:31:19 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
30 ms |
2892 KB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main()
{
int n , k;
cin >> n >> k;
vector<int> a(n) , b;
for (int i = 0; i < n; i++){
cin >> a[i];
if (i > 0)
b.push_back(a[i] - (a[i - 1]) - 1);
}
sort(b.rbegin() , b.rend());
int m = (int)b.size();
vector<int> pf(b.begin() , b.end());
for (int i = 1; i < m; i++)
pf[i] += pf[i - 1];
if (k == 1)
cout << a[n - 1] - a[0] + 1;
else
cout << a[n - 1] - pf[k - 2] - a[0] + 1 << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 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 |
29 ms |
2760 KB |
Output is correct |
| 17 |
Correct |
29 ms |
2760 KB |
Output is correct |
| 18 |
Correct |
29 ms |
2768 KB |
Output is correct |
| 19 |
Correct |
29 ms |
2760 KB |
Output is correct |
| 20 |
Correct |
30 ms |
2756 KB |
Output is correct |
| 21 |
Correct |
29 ms |
2768 KB |
Output is correct |
| 22 |
Correct |
29 ms |
2756 KB |
Output is correct |
| 23 |
Correct |
29 ms |
2892 KB |
Output is correct |
| 24 |
Correct |
29 ms |
2768 KB |
Output is correct |
