oj.uz

Submission #871149

# Submission time Handle Problem Language Result Execution time Memory
871149 2023-11-10T04:39:21 Z aaron_dcoder Stove (JOI18_stove) C++17
100 / 100
 16 ms 3132 KB 
#define NDEBUG

#ifdef NDEBUG
#define dbg(TXTMSG) if constexpr (false) cerr << "lol"
#define dbgv(VARN) ((void)0)
#define dbgfor(COND) if constexpr (false) for (COND)

#else
#define _GLIBCXX_DEBUG 1
#define _GLIBCXX_DEBUG_PEDANTIC 1
#pragma GCC optimize("trapv")
#define dbg(TXTMSG) cerr << "\n" << TXTMSG
#define dbgv(VARN) cerr << "\n" << #VARN << " = "<< VARN << ", line: " << __LINE__ << "\n"
#define dbgfor(COND) for (COND)

#endif

#include <bits/stdc++.h>
using namespace std;
using ll = long long; 
using pll = pair<ll,ll>;
#define e0 first
#define e1 second
constexpr ll INFTY = 2e18;


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

	ll N,K;
	cin >> N >> K;

	vector<ll> T(N);

	for (ll i = 0; i < N; ++i)
	{
	 	cin >> T[i];
	}


	vector<ll> segs(N-1);
	for (ll i = 0; i < N-1; ++i)
	{
		segs[i] = T[i+1]-T[i] -1;
	}
	sort(segs.begin(),segs.end());
	K--;

	ll savings=0;

	while (!segs.empty() && K>0) {
		savings += *segs.crbegin();
		segs.pop_back();
		K--;
	}
	dbgv(savings);

	cout << T[N-1]-T[0]+1 - savings;



}

Subtask #1
20.0 / 20.0

# 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 1 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct

Subtask #2
30.0 / 30.0

# 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 1 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 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 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 508 KB Output is correct

Subtask #3
50.0 / 50.0

# 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 1 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 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 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 508 KB Output is correct
16 Correct 14 ms 2764 KB Output is correct
17 Correct 14 ms 2904 KB Output is correct
18 Correct 16 ms 3132 KB Output is correct
19 Correct 14 ms 2908 KB Output is correct
20 Correct 15 ms 2780 KB Output is correct
21 Correct 14 ms 2776 KB Output is correct
22 Correct 14 ms 2904 KB Output is correct
23 Correct 14 ms 2908 KB Output is correct
24 Correct 16 ms 2908 KB Output is correct