제출 #1284423

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284423		beka19	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	572 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define sped ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define s second
#define f first
const int N = 5e5 + 10;
void okok(){
   int n,m;
   cin >> n >> m;
   int a[n + 1];
   for(int i = 0;i < n;i++){
    cin >> a[i];
   }
   int mx = n;
   for(int i = 0;i < (1<<n);i++){
     int cur = 0;
     for(int j = 0;j < n;j++){
        if( (i & (1<<j)) != 0 ){
            cur+=m;
        }
        else{
            if(cur + m < a[i]){
            cur = -1;
                break;
            }
            else{
                cur = a[i];
            }
        }
     }
     if(cur == -1){
        continue;
     }
     mx = min(mx,__builtin_popcount(i));
   }
}
signed main() {
//freopen("bank.in", "r", stdin) ;
//freopen("bank.out", "w", stdout);
sped
int tt = 1;
//cin >> tt;
while(tt--){
    okok();
    cout << '\n';
    }
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37