HDOJ 4277 USACO ORZ 搜索 剪枝

//HDOJ 4277 USACO ORZ 搜索 剪枝

/*
题意：将n跟木棒分成3堆，3堆木棒的总和分别为a,b,c，满足能以a，b，c组成三角形，问有多少种不同的情况

思路：暴搜+剪枝 先固定一根木棒在某一堆
*/

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<map>
using namespace std;
//#define int64 long long
#define int64 __int64

#define N 16
int T, n, m, ans, sum;
int edge[N], seg[5], tmp[5];
map<int64, bool> mark;

int cmp(const void *a, const void *b) {
    return *(int *) a - *(int *) b;
}

bool check() {
    int i, j, a, b, c;
    for (i = 0; i < 3; ++i) {
        if (seg[i] == 0)
            return false;
        tmp[i] = seg[i];
    }
    qsort(tmp, 3, sizeof (tmp[0]), cmp);
    a = tmp[0];
    b = tmp[1];
    c = tmp[2];
    if (a + b > c && a + c > b && b + c > a) {
        if (!mark[a * 150000 + b]) {
            mark[a * 150000 + b] = true;
            return true;
        }
        return false;
    }
    return false;
}

void dfs(int deep) {
    int i;
    if (deep == n) {
        if (check())
            ++ans;
        return;
    }
    for (i = 0; i < 3; ++i) {
        seg[i] += edge[deep];
        if (seg[i] <= sum / 2)
            dfs(deep + 1);
        seg[i] -= edge[deep];
    }
}

int main() {
    int i, j;
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        sum = 0;
        for (i = 0; i < n; ++i) {
            scanf("%d", &edge[i]);
            sum += edge[i];
        }
        memset(seg, 0, sizeof (seg));
        mark.clear();
        seg[0] = edge[0];
        ans = 0;
        dfs(1);
        printf("%d\n", ans);
    }
    return 0;
}