[백준] 박스채우기 1493번 c++ 풀이

https://www.acmicpc.net/problem/1493

1493번: 박스 채우기

#include <cstdio>
#include<cmath>
int length, width, height, n, a, b, cubes[20];
bool flag = true;
int recursive_func(int l, int w, int h){
    if((l<=0) || (w<=0) || (h<=0)){
        return 0;
    }
    int k = l;
    if(w<k){k = w;}
    if(h<k){k = h;}
    int t=log2(k);
    while(t>=0){
        int x = pow(2, t);
        if(cubes[t] > 0){
            cubes[t]--;
            return recursive_func(l-x, x, h) + recursive_func(x, x, h-x) + recursive_func(l, w-x, h) + 1;
        }
        t = t - 1;
    }
    
    flag = false;
    return -1;
}
 
int main(){
    scanf("%d %d %d", &length, &width, &height);
    scanf("%d", &n);
    for(int i=0; i<n; i++){
        scanf("%d %d", &a, &b);
        cubes[a] = b;
    }
    int answer = recursive_func(length, width, height);
    if(flag){
        
        printf("%d", answer);
    }
    else{
        printf("%d", -1);
    }
        
}

 

그리디 분할정복