oj.uz

답안 #1100937

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100937 2024-10-15T04:35:15 Z akzytr Stove (JOI18_stove) C++17
0 / 100
 1 ms 336 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++) {
		cin >> 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] = {};
	bool tk = false;

	for(int i = 0; i <= K; i++) {
		mi_left[i] = 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 ? 0 : (ll)1e18);
			dp[i][left][1] = (ll)1e18;

            if(left == 0){
                break;
            }
			if(occ[i]) {
				for(ll j = i + 1; j < times.size(); j++) {
					dp[i][left][1] = min(dp[i][left][1], dp[j][left - 1][0] + times[j].fi - times[i].fi);
				}
				mi_left[left] = dp[i][left][1];
			} else {
				dp[i][left][0] = mi_left[left];
			}
		}
	}
	cout << min(dp[0][K][0], dp[0][K][1]) << endl;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:30: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]
   30 |  for(int i = 0; i < times.size(); i++) {
      |                 ~~^~~~~~~~~~~~~~
stove.cpp:53:25: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long 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]
   53 |     for(ll j = i + 1; j < times.size(); j++) {
      |                       ~~^~~~~~~~~~~~~~

Subtask #1
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 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

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 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 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 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -