제출 #1305950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1305950		tnt	Stove (JOI18_stove)	C++20	0 / 100	1 ms	568 KiB

stove

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#define pb push_back                    
#define ll long long  
#define int long long
//#define sz(v) int(v.size())
#define all(v) v.begin(),v.end()

int mod =  1e9 + 7;
const int N = 2e5 + 1;
const ll inf = 2e9;
void solve(){                    
    int n,k;
    cin >> n >> k;
    int a[n + 1];
    int sum = 1;
    for(int i = 0; i < n;i++){
        cin >> a[i];
        if(i != 0) sum += a[i] - a[i - 1];
    }
    int ans1 = sum;
    for(int mask = 0; mask < (1 << n);mask++){
        int last = 1,ans = 0;
        if((__builtin_popcount(mask)) != k || (mask >> (n - 1) & 1) != 1) continue;
        for(int i = 0; i < n; i++){
            if((mask >> i & 1) == 1){
                ans += a[i] - last + 1;
                if(i + 1 < n)last = a[i + 1];
            }
            else{
                if(i < 0 || (mask >> (i - 1) & 1) == 1) last = a[i];
            }
        }
        ans1 =min(ans1,ans);
    }
    cout << ans1;
}
signed main(){
    //freopen("time.in", "r", stdin);
    //freopen("time.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t1 = 1;
    while(t1--){
    	solve();
    }
}                          	

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