poj2288

能ac但有数据过不了

13 78
2 2 2 2 2 2 2 2 2 2 2 2 2
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 8
0 9
0 10
0 11
0 12
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
4 5
4 6
4 7
4 8
4 9
4 10
4 11
4 12
5 6
5 7
5 8
5 9
5 10
5 11
5 12
6 7
6 8
6 9
6 10
6 11
6 12
7 8
7 9
7 10
7 11
7 12
8 9
8 10
8 11
8 12
9 10
9 11
9 12
10 11
10 12
11 12

待补坑

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int n, m;
int t;
int mapp[20][20],v[20];
int dp[9000][20][20];
ll num[9000][20][20];
int main()
{
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d%d", &n, &m);
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &v[i]);
		}
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
				mapp[i][j] = 0;
		}
		if (n == 1)
		{
			printf("%d %d\n", v[0], 1);
			continue;
		}
		for (int i = 0; i < (1 << n); i++)
		{
			for (int j = 0; j < n; j++)
			{
				for (int k = 0; k < n; k++)
				{
					dp[i][j][k] = -2000000000;
					num[i][j][k] = 0;
				}
			}
		}
		for (int i = 0; i < m; i++)
		{
			int a, b;
			scanf("%d%d", &a, &b);
			a--, b--;
			mapp[a][b] = 1, mapp[b][a] = 1;
			int kind = (1 << a) + (1 << b);
			dp[kind][a][b] = v[a] + v[b];
				dp[kind][a][b] += v[a] * v[b];
			dp[kind][b][a] = v[a] + v[b];
				dp[kind][b][a] += v[a] * v[b];
			num[kind][a][b] = num[kind][b][a] = 1;
		}
		if (n == 2)
		{
			if (mapp[0][1])
				printf("%d %d\n", v[0] + v[1] + v[0] * v[1], 1);
			else
				printf("0 0\n");
			continue;
		}
		int realans = -2000000000;
		for (int i = 0; i < (1 << n); i++)
		{
			for (int j = 0; j < n; j++)
			{
				if ((i&(1 << j)) == 0)
					continue;
				for (int k = 0; k < n; k++)
				{
					if (((i&(1 << k) )== 0) || (j == k)||mapp[j][k]==0)
						continue;
					for (int q = 0; q < n; q++)
					{
						if (mapp[j][q] == 1 && ((i&(1 << q)))&&q!=i)
						{
							int temppp = i - (1 << q);
							if (dp[temppp][k][j] == -2000000000)
								continue;
							int ans = dp[temppp][k][j] + v[q];
							ll numm = num[temppp][k][j];
							if (mapp[q][k])
								ans += v[q] * v[j] * v[k];
								ans += v[q] * v[j];
							int kind = i;
							if (dp[kind][j][q] == ans)
							{
								num[kind][j][q] += numm;
							}
							else
							{
								if (dp[kind][j][q] < ans)
								{
									dp[kind][j][q] = ans;
									num[kind][j][q] = numm;
									//realans = max(realans, ans);
								}
							}
						}
					}
				}
			}
		}
	 ll numm = 0;
		int i = (1 << n) - 1;
			for (int j = 0; j < n; j++)
			{
				for (int k = 0; k < n; k++)
				{
					if (k == j)
						continue;
					if (dp[i][j][k]>realans)
						realans = dp[i][j][k], numm = num[i][j][k];
					else
					if (dp[i][j][k]== realans&&mapp[j][k])
					{
						numm += num[i][j][k];
					}
				}
			}
		if (numm == 0)
			printf("0 0\n");
		else
		{
			   printf("%d %lld\n", realans, numm/2);
		}
	}
}