oj.uz

답안 #1100933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100933 2024-10-15T04:26:55 Z akzytr Stove (JOI18_stove) C++17
20 / 100
 1000 ms 9808 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];
	for(ll i = 0; i < times.size(); i++) {
		for(ll j = 0; j <= K; j++) {
			dp[i][j][0] = (ll)1e18;
			dp[i][j][1] = (ll)1e18;
		}
	}

	for(ll i = times.size() - 1; i >= 0; i--) {
		if(occ[i]) {
			break;
		}
		for(ll k = 0; k <= K; k++) {
			dp[i][k][0] = 0;
		}
	}

	for(ll i = times.size() - 1; i >= 0; i--) {
		for(ll left = K; left >= 1; left--) {
			// ON
			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);
				}
			} else {
				for(ll j = i + 1; j < times.size(); j++) {
					if(occ[j] == 1) {
						dp[i][left][0] = min(dp[i][left][0], dp[j][left][1]);
						break;
					}
				}
			}
		}
	}

	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:35:18: 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]
   35 |  for(ll i = 0; i < times.size(); i++) {
      |                ~~^~~~~~~~~~~~~~
stove.cpp:55: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]
   55 |     for(ll j = i + 1; j < times.size(); j++) {
      |                       ~~^~~~~~~~~~~~~~
stove.cpp:59: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]
   59 |     for(ll j = i + 1; j < times.size(); j++) {
      |                       ~~^~~~~~~~~~~~~~

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 1 ms 508 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 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
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 508 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 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 156 ms 1596 KB Output is correct
11 Execution timed out 1066 ms 9808 KB Time limit exceeded
12 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 508 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 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 156 ms 1596 KB Output is correct
11 Execution timed out 1066 ms 9808 KB Time limit exceeded
12 Halted 0 ms 0 KB -