제출 #850967

#제출 시각아이디문제언어결과실행 시간메모리
850967NamPEStove (JOI18_stove)C++17
20 / 100
1058 ms604 KiB
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
ll dfs(vector<ll>& a, ll i, ll k, ll state) {
    if(i == a.size()) {
        return (!state ? 0 : INT_MAX);
    }
 
    ll res = INT_MAX;
 
    if(!state && k) {
        res = min(res, dfs(a, i + 1, k - 1, 0) + 1);
        res = min(res, dfs(a, i + 1, k - 1, 1) - a[i]);
    } else if(state) {
        res = min(res, dfs(a, i + 1, k, 1));
        res = min(res, dfs(a, i + 1, k, 0) + a[i] + 1);
    }
 
    return res;
}
 
int main() {
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    
    ll n, k;
    cin >> n >> k;
 
    vector<ll> a(n);
 
    for(ll& i : a) {
        cin >> i;
    }
 
    cout << dfs(a, 0, k, 0);
}

컴파일 시 표준 에러 (stderr) 메시지

stove.cpp: In function 'll dfs(std::vector<long long int>&, ll, ll, ll)':
stove.cpp:7:10: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     if(i == a.size()) {
      |        ~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...