| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 987436 |
2024-05-22T18:35:35 Z |
mateuszwes |
Stove (JOI18_stove) |
C++17 |
|
20 ms |
3116 KB |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define pq priority_queue
#define pl pair<ll,ll>
using namespace std;
constexpr int debug = 0;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
pq<ll> inter;
ll n, match; cin >> n >> match;
vector<ll> cur;
match--;
for(int i = 0; i < n; i++){
ll a1; cin >> a1;
if(i > 0) inter.push(a1-cur.back()-1);
cur.pb(a1);
}
ll entire = cur.back() - cur[0] + 1;
//cout << entire << endl;
while((match > 0) && (!inter.empty())){
entire -= inter.top();
inter.pop();
match--;
//cout << entire << '\n';
}
cout << entire;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 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 |
2 ms |
752 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 |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 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 |
2 ms |
752 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 |
11 ms |
3024 KB |
Output is correct |
| 17 |
Correct |
11 ms |
3116 KB |
Output is correct |
| 18 |
Correct |
11 ms |
3024 KB |
Output is correct |
| 19 |
Correct |
12 ms |
3024 KB |
Output is correct |
| 20 |
Correct |
16 ms |
3024 KB |
Output is correct |
| 21 |
Correct |
20 ms |
3024 KB |
Output is correct |
| 22 |
Correct |
20 ms |
3020 KB |
Output is correct |
| 23 |
Correct |
20 ms |
3024 KB |
Output is correct |
| 24 |
Correct |
20 ms |
3024 KB |
Output is correct |
