POJ - 1737 Connected Graph

题目

思路：

求满足的不好求，那就求不满足的。

把不满足的情况看成两个步骤。

1号点参与的联通分量为，剩下的个点随便连。

结果很大，需要用大数进行运算。

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vll;

const int MAXN = 1e6 + 10;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const double eps = 1e-8;
const double PI = acos(-1.0);

int n, m, k;

string add(string a, string b){
	if(a.length() > b.length())
		swap(a, b);
	for(int u = 0, v = a.length() - 1; u < v; u++, v--)
		swap(a[u], a[v]);
	for(int u = 0, v = b.length() - 1; u < v; u++, v--)
		swap(b[u], b[v]);
	int carry = 0;
	string res;
	for(int i = 0; i < (int)a.length(); i++){
		res.push_back((a[i] - '0' + b[i] - '0' + carry) % 10 + '0');
		carry = (a[i] - '0' + b[i] - '0' + carry) / 10;
	}
	for(int i = a.length(); i < (int)b.length(); i++){
		res.push_back((b[i] - '0' + carry) % 10 + '0');
		carry = (b[i] - '0' + carry) / 10;
	}
	if(carry)
		res.push_back(carry + '0');
	for(int u = 0, v = res.length() - 1; u < v; u++, v--)
		swap(res[u], res[v]);
	return res;
}

string Minus(string a, string b){
	bool smaller = false;
	if(a.length() == b.length())
		smaller = a < b ? (swap(a, b), true) : false;
	else
		smaller = a.length() < b.length() ? (swap(a, b), true) : false;
	for(int u = 0, v = a.length() - 1; u < v; u++, v--)
		swap(a[u], a[v]);
	for(int u = 0, v = b.length() - 1; u < v; u++, v--)
		swap(b[u], b[v]);
	int carry = 0;
	string res;
	for(int i = 0; i < (int)b.length(); i++){
		int cur = 0;
		while(a[i] + 10 * cur - carry - b[i] < 0)
			cur++;
		res.push_back(a[i] + 10 * cur - carry - b[i] + '0');
		carry = cur;
	}
	for(int i = b.length(); i < (int)a.length(); i++){
		int cur = 0;
		while(a[i] - '0' + 10 * cur - carry < 0)
			cur++;
		res.push_back(a[i] + 10 * cur - carry);
		carry = cur;
	}
	for(int u = 0, v = res.length() - 1; u < v; u++, v--)
		swap(res[u], res[v]);
	while(res.length() > 1 && res.front() - '0' == 0)
		res.erase(res.begin());
	return (smaller ? "-" : "") + res;
}

string multiply(string a, string b){
	for(int u = 0, v = a.length() - 1; u < v; u++, v--)
		swap(a[u], a[v]);
	for(int u = 0, v = b.length() - 1; u < v; u++, v--)
		swap(b[u], b[v]);
	string res = "0";
	for(int i = 0; i < (int)a.length(); i++){
		int carry = 0;
		string tmp;
		for(int j = 0; j < i; j++)
			tmp.push_back('0');
		for(int j = 0; j < (int)b.length(); j++){
			tmp.push_back(((a[i] - '0') * (b[j] - '0') + carry) % 10 + '0');
			carry = ((a[i] - '0') * (b[j] - '0') + carry) / 10;
		}
		if(carry)
			tmp.push_back(carry + '0');
		for(int u = 0, v = tmp.length() - 1; u < v; u++, v--)
			swap(tmp[u], tmp[v]);
		res = add(res, tmp);
		while(res.length() > 1 && res.front() == '0')
			res.erase(res.begin());
	}
	return res;
}

string str(int x){
	string res;
	while(x){
		res.push_back(x % 10 + '0');
		x /= 10;
	}
	for(int u = 0, v = res.length() - 1; u < v; u++, v--)
		swap(res[u], res[v]);
	return res;
}

vector<string> b, tot, f, d;
vector< vector<string> > c;

int main(void)
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << setprecision(10) << fixed;
	b.push_back("1");
	for(int i = 1; i <= 49; i++)
		b.push_back(multiply(b.back(), "2"));
	for(int i = 0; i <= 50; i++){
		if(!i)
			tot.push_back("1");
		else
			tot.push_back(multiply(tot.back(), b[i * (i - 1) / 2 - (i - 1) * (i - 2) / 2]));
	}
	c.resize(51);
	for(int i = 0; i <= 50; i++)
		c[i].resize(i + 1);
	for(int i = 0; i <= 50; i++){
		c[i][0] = c[i][i] = "1";
		if(i)
			c[i][1] = c[i][i - 1] = str(i);
	}
	for(int i = 4; i <= 50; i++)
		for(int j = 2; i - j > 1; j++)
			c[i][j] = add(c[i - 1][j], c[i - 1][j - 1]);
	for(int i = 0; i <= 50; i++){
		string cur = "0";
		for(int j = 1; j < i; j++)
			cur = add(cur, multiply(multiply(c[i - 1][j - 1], f[j]), tot[i - j]));
		d.push_back(cur);
		f.push_back(Minus(tot[i], cur));
	}
	while(cin >> n && n)
		cout << f[n] << endl;
	cerr << "execute time : " << (double)clock() / CLOCKS_PER_SEC << endl;
	return 0;
}

 

未来可期。