SRM 551

这道题就是算出k个sweet的选择数，k个sweet生成树的个数，乘起来就是答案。

选择数是个背包题，容量比较大，分成两段暴力。

生成树个数是无向图生成树个数，矩阵来求的（不会的自行百度）然后会多算了0~k-1个sweet的情况，减去重复即可。

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
using namespace std;

class SweetFruits {
public:
	int countTrees(vector<int> , int);
};
long long pmod = 1000000007;
vector<int> a;
int fu;
vector<pair<int, int> > b1;
vector<pair<int, int> > b2;
long long cc[22];
long long pp[45];
long long v[45];
/*******************************************/
typedef long long llong;
template<class T> inline T MOD(T A, T B) {
	A %= B;
	if (A < 0)
		A += B;
	return A;
}
template<class T> inline void SWAP(T &A, T &B) {
	T buf = A;
	A = B;
	B = buf;
}
#define N 210
llong mat[N][N];
llong guass(llong mat[][N], int n, llong m) {
	if (m == 1)
		return 0;
	llong ans = 1, t, tmp;
	int i, j, k;
	for (i = 0; i < n; ++i)
		for (j = 0; j < n; ++j)
			mat[i][j] = MOD(mat[i][j], m);
	for (i = 0; i < n; ++i) {
		for (j = i + 1; j < n; ++j) {
			while (mat[j][i]) {
				t = mat[i][i] / mat[j][i];
				for (k = 0; k < n; ++k) {
					tmp = mat[i][k];
					tmp -= t * mat[j][k];
					tmp = MOD(tmp, (llong) m);
					mat[i][k] = tmp;
				}
				for (k = 0; k < n; ++k)
					SWAP(mat[i][k], mat[j][k]);
				ans = -ans;
			}
		}
		if (mat[i][i] == 0)
			return 0;
		ans = (ans * mat[i][i] % m + m) % m;
	}
	return ans;
}
/*******************************************/

long long c[55][55];
void pre() {
	int i, j;
	for (i = 0; i < 55; ++i) {
		c[i][i] = c[i][0] = 1;
		for (j = 1; j < i; ++j)
			c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]);
	}
}
int SweetFruits::countTrees(vector<int> sweetness, int m) {
	int n;
	int i, j, k, cnt;
	fu = 0;
	pre();
	a.clear();
	b1.clear();
	b2.clear();
	for (i = 0; i < sweetness.size(); ++i) {
		if (sweetness[i] >= 0)
			a.push_back(sweetness[i]);
		else
			fu++;
	}
	n = a.size();
	for (i = 0; i < (1 << (n / 2)); ++i) {
		k = 0;
		cnt = 0;
		for (j = 0; j < n / 2; ++j)
			if (i & (1 << j)) {
				cnt++;
				k += a[j];
			}
		b1.push_back(make_pair(k, cnt));
	}
	sort(b1.begin(), b1.end());
	for (i = 0; i < (1 << (n - n / 2)); ++i) {
		k = 0;
		cnt = 0;
		for (j = 0; j < (n - n / 2); ++j)
			if (i & (1 << j)) {
				cnt++;
				k += a[j + n / 2];
			}
		b2.push_back(make_pair(k, cnt));
	}
	sort(b2.begin(), b2.end());
	j = -1;
	memset(cc, 0, sizeof(cc));
	memset(pp, 0, sizeof(pp));
	for (i = b1.size() - 1; i >= 0; --i) {
		while (j != b2.size() - 1 && b1[i].first + b2[j + 1].first <= m) {
			j++;
			cc[b2[j].second]++;
		}
		for (k = 0; k <= 20; ++k) {
			pp[b1[i].second + k] += cc[k];
			pp[b1[i].second + k] %= pmod;
		}
	}
	for (k = 0; k <= n; ++k) {
		memset(mat, 0, sizeof(mat));
		for (i = 0; i < k; ++i) {
			for (j = n; j < n + fu; ++j) {
				mat[i][j]--;
				mat[i][i]++;
			}
		}
		for (i = k; i < n; ++i) {
			for (j = k; j < n + fu; ++j) {
				if (i == j)
					continue;
				mat[i][j]--;
				mat[i][i]++;
			}
		}
		for (i = n; i < n + fu; ++i) {
			for (j = 0; j < n + fu; ++j) {
				if (i == j)
					continue;
				mat[i][j]--;
				mat[i][i]++;
			}
		}
		v[n - k] = guass(mat, n + fu - 1, pmod);
	}
	long long ans = 0;
	for (i = 0; i <= n; ++i) {
		for (j = 0; j < i; ++j) {
			v[i] -= c[i][j] * v[j];
			v[i] %= pmod;
			if (v[i] < 0)
				v[i] += pmod;
		}
		ans += v[i] * pp[i] % pmod;
		ans %= pmod;
	}
	return ans;
}