oj.uz

Submission #1100962

# Submission time Handle Problem Language Result Execution time Memory
1100962 2024-10-15T05:36:09 Z akzytr Stove (JOI18_stove) C++17
50 / 100
 1000 ms 2140 KB 
#include <bits/stdc++.h>
using namespace std;
template <typename T> using ve = vector<T>;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define endl '\n'

int main() {

	int N, K;
	cin >> N >> K;

	ve<pair<ll, ll>> times(N);
	for(ll i = 0; i < N; i++) {
		scanf("%lld", &times[i].fi);
		times[i].se = 1;
	}

	ll mi_left[K + 1] = {};
	ll mi_left2[K + 1] = {};

	bool tk = false;

	const ll MXN = 1e16;
	for(ll i = 0; i <= K; i++) {
		mi_left[i] = 0;
		mi_left2[i] = MXN;
	}

	for(ll i = N - 1; i >= 0; i--) {
		if(i == N - 1 || times[i].fi + 1 != times[i + 1].fi) {
			for(ll left = K; left >= 0; left--) {
				mi_left2[left] = min(mi_left2[left], (tk == 0 ? 0 : (ll)MXN) + times[i].fi + 1);
				if(left == 0) {
					break;
				}
				mi_left2[left] = min(mi_left2[left], mi_left[left] + times[i].fi + 1);
			}
		}

		tk = 1;
		for(ll left = K; left >= 0; left--) {
			mi_left2[left] = min(mi_left2[left], (ll)MXN + times[i].fi);

			if(left == 0) {
				break;
			}
			mi_left[left] = min((ll)MXN, mi_left2[left - 1] - times[i].fi);
		}
	}

	cout << mi_left[K] << endl;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   scanf("%lld", &times[i].fi);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 504 KB Output is correct
7 Correct 0 ms 504 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 0 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 504 KB Output is correct
7 Correct 0 ms 504 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 7 ms 336 KB Output is correct
13 Correct 11 ms 336 KB Output is correct
14 Correct 16 ms 520 KB Output is correct
15 Correct 16 ms 528 KB Output is correct

Subtask #3
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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 504 KB Output is correct
7 Correct 0 ms 504 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 7 ms 336 KB Output is correct
13 Correct 11 ms 336 KB Output is correct
14 Correct 16 ms 520 KB Output is correct
15 Correct 16 ms 528 KB Output is correct
16 Correct 11 ms 1872 KB Output is correct
17 Correct 27 ms 1992 KB Output is correct
18 Correct 185 ms 1872 KB Output is correct
19 Execution timed out 1054 ms 2140 KB Time limit exceeded
20 Halted 0 ms 0 KB -