제출 #936207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
936207		Whisper	Stove (JOI18_stove)	C++17	20 / 100	5 ms	31932 KiB

stove

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int MAX = 2e3 + 5;
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, nMatches;
int a[MAX];
int dp[MAX][MAX];
int s[MAX];
void Whisper(){
    cin >> nArr >> nMatches;
    for (int i = 1; i <= nArr; ++i) cin >> a[i];
    memset(dp, 0x3f, sizeof dp);
    for (int i = 1; i <= nArr; ++i) dp[i][1] = a[i] - a[1] + 1;
    for (int v = 2; v <= nMatches; ++v){
        for (int i = v; i <= nArr; ++i){
            for (int j = 1; j <= i; ++j){
                minimize(dp[i][v], dp[j - 1][v - 1] + a[i] - a[j] + 1);
            }
        }
    }
    cout << dp[nArr][nMatches];
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50