oj.uz

Submission #1100961

# Submission time Handle Problem Language Result Execution time Memory
1100961 2024-10-15T05:35:10 Z akzytr Stove (JOI18_stove) C++17
50 / 100
 1000 ms 1104 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<int, int>> times(N);
	for(int i = 0; i < N; i++) {
		scanf("%d", &times[i].fi);
		times[i].se = 1;
	}

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

	bool tk = false;

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

	for(int i = N - 1; i >= 0; i--) {
		if(i == N - 1 || times[i].fi + 1 != times[i + 1].fi) {
			for(int left = K; left >= 0; left--) {
				mi_left2[left] = min(mi_left2[left], (tk == 0 ? 0 : (int)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(int left = K; left >= 0; left--) {
			mi_left2[left] = min(mi_left2[left], (int)MXN + times[i].fi);

			if(left == 0) {
				break;
			}
			mi_left[left] = min((int)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("%d", &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 0 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 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 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 0 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 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 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 348 KB Output is correct
12 Correct 6 ms 336 KB Output is correct
13 Correct 16 ms 472 KB Output is correct
14 Correct 17 ms 476 KB Output is correct
15 Correct 17 ms 480 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 0 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 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 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 348 KB Output is correct
12 Correct 6 ms 336 KB Output is correct
13 Correct 16 ms 472 KB Output is correct
14 Correct 17 ms 476 KB Output is correct
15 Correct 17 ms 480 KB Output is correct
16 Correct 11 ms 1104 KB Output is correct
17 Correct 27 ms 1104 KB Output is correct
18 Correct 189 ms 1104 KB Output is correct
19 Execution timed out 1058 ms 1104 KB Time limit exceeded
20 Halted 0 ms 0 KB -