Submission #1100939

#TimeUsernameProblemLanguageResultExecution timeMemory
1100939akzytrStove (JOI18_stove)C++17
20 / 100
1068 ms10064 KiB
#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] = 0; } 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); 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; } /* Subtask 1) N<=20 & Ti<=20 N * K * T greedy DP[i][left][on] which means the stove is on on the i'th day DP[i][left][off] */

Compilation message (stderr)

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:54: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]
   54 |     for(ll j = i + 1; j < times.size(); j++) {
      |                       ~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...