oj.uz

Submission #1115596

# Submission time Handle Problem Language Result Execution time Memory
1115596 2024-11-20T16:42:50 Z staszic_ojuz Stove (JOI18_stove) C++17
100 / 100
 21 ms 1784 KB 
// Patryk Niemczyk stov.cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

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

	int n, k;
	cin >> n >> k;

	vector<int> odstepy(n - 1);

	int ost;
	cin >> ost;
	for (int i = 1; i < n; ++i)
	{
		int akt;
		cin >> akt;
		odstepy[i - 1] = akt - ost - 1;
		ost = akt;
	}

	sort(odstepy.begin(), odstepy.end());

	auto it1 = lower_bound(odstepy.begin(), odstepy.end(), 0);
	auto it2 = upper_bound(odstepy.begin(), odstepy.end(), 0);

	int lzer = it2 - it1, wynik = n;
	int doDobrania = n - lzer - k;

	for (int i = lzer; i < lzer + doDobrania; ++i)
		wynik += odstepy[i];

	cout << wynik << '\n';
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 336 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 336 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 14 ms 1616 KB Output is correct
17 Correct 14 ms 1784 KB Output is correct
18 Correct 21 ms 1616 KB Output is correct
19 Correct 15 ms 1616 KB Output is correct
20 Correct 15 ms 1616 KB Output is correct
21 Correct 17 ms 1616 KB Output is correct
22 Correct 15 ms 1628 KB Output is correct
23 Correct 15 ms 1624 KB Output is correct
24 Correct 15 ms 1616 KB Output is correct