Submission #1305953

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305953		tnt	Stove (JOI18_stove)	C++20	20 / 100	1095 ms	580 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,m = n - 1;
    for(int mask = 0; mask < (1 << m);mask++){
        int last = 1,ans = n;
        if((__builtin_popcount(mask)) + 1 > k) continue;
        for(int i = 0; i < m; i++){
            if(!(mask >> i & 1) == 1){
                ans += (a[i + 1] - (a[i] + 1));
            }
        }
        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: 20 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50