oj.uz

답안 #1100942

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100942 2024-10-15T04:41:26 Z akzytr Stove (JOI18_stove) C++17
20 / 100
 209 ms 262144 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;
	}
	for(int i = 0; i < N - 1; i++) {
		if(times[i + 1].fi != times[i].fi + 1) {
			times.push_back({times[i].fi + 1, 0ll});
		}
	}

	times.push_back({times[N - 1].fi + 1, 0ll});

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

	ve<ll> occ(times.size(), 0);
	for(int i = 0; i < times.size(); i++) {
		occ[i] = times[i].se;
	}

	ll dp[times.size() + 2][K + 1][2];

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

	bool tk = false;

	for(int i = 0; i <= K; i++) {
		mi_left[i] = 0;
		mi_left2[i] = (ll)1e18;
	}

	for(ll i = times.size() - 1; i >= 0; i--) {
		for(ll left = K; left >= 0; left--) {
			tk = (tk || occ[i]);
			dp[i][left][0] = (!tk ? 0 : (ll)1e18);
			mi_left2[left] = min(mi_left2[left], (tk == 0 ? 0 : (ll)1e18) + times[i].fi);
			dp[i][left][1] = (ll)1e18;

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

				mi_left2[left] = min(mi_left2[left], dp[i][left][0] + times[i].fi);
			}
		}
	}
	cout << min(dp[0][K][0], dp[0][K][1]) << endl;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:31:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for(int i = 0; i < times.size(); i++) {
      |                 ~~^~~~~~~~~~~~~~
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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 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 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 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 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 1360 KB Output is correct
11 Correct 10 ms 10064 KB Output is correct
12 Correct 94 ms 94652 KB Output is correct
13 Correct 170 ms 188520 KB Output is correct
14 Runtime error 209 ms 262144 KB Execution killed with signal 9
15 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 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 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 1360 KB Output is correct
11 Correct 10 ms 10064 KB Output is correct
12 Correct 94 ms 94652 KB Output is correct
13 Correct 170 ms 188520 KB Output is correct
14 Runtime error 209 ms 262144 KB Execution killed with signal 9
15 Halted 0 ms 0 KB -