| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1033660 |
2024-07-25T04:11:07 Z |
trucmai |
Stove (JOI18_stove) |
C++17 |
|
19 ms |
2908 KB |
#include <bits/stdc++.h>
#include <functional>
#ifdef LOCAL
#include "/home/trcmai/code/tools.h"
#define debug(x...) \
cerr << "\e[91m" << __func__ << ":" << __LINE__ << " [" << #x << "] = ["; \
_print(x); \
cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
#define endl '\n'
const int N = 1e6 + 6, LOG = 27, MOD = 1e9 + 7;
const ll INF = 1e9;
int n, k;
int T[N];
signed main()
{
cin.tie(0)->sync_with_stdio(0);
auto solver = [&]() {
cin >> n >> k;
vector<int> diff(n + 1);
for (int i = 1; i <= n; ++i)
cin >> T[i];
for (int i = 1; i + 1 <= n; ++i)
diff[i] = T[i + 1] - T[i] - 1;
sort(diff.begin() + 1, diff.end(), greater<int>());
int res = T[n] - T[1] + 1;
for (int i = 1; i <= k - 1; ++i)
res -= diff[i];
cout << res << endl;
};
int t = 1; // cin>>t;
while (t--)
solver();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 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 |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 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 |
1 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 |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 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 |
1 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 |
12 ms |
2908 KB |
Output is correct |
| 17 |
Correct |
12 ms |
2908 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2908 KB |
Output is correct |
| 19 |
Correct |
19 ms |
2908 KB |
Output is correct |
| 20 |
Correct |
12 ms |
2908 KB |
Output is correct |
| 21 |
Correct |
19 ms |
2908 KB |
Output is correct |
| 22 |
Correct |
12 ms |
2908 KB |
Output is correct |
| 23 |
Correct |
18 ms |
2908 KB |
Output is correct |
| 24 |
Correct |
14 ms |
2908 KB |
Output is correct |
