zoj 1155 Triangle War

状态压缩

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int N = 1 << 20;
ll mp[9][3] = {{1, 2, 3}, {4, 5, 8}, {3, 5, 6}, {6, 7, 9}, {10, 11, 16}, {8, 11, 12}, {12, 13, 17}, {9, 13, 14}, {14, 15, 18}};
int pos[19][2] = {{}, {1, 2}, {1, 3}, {2, 3}, {2, 4}, {2, 5}, {3, 5}, {3, 6}, {4, 5}, {5, 6}, {4, 7}, {4, 8}, {5, 8}, {5, 9}, {6, 9}, {6, 10}, {7, 8}, {8, 9}, {9, 10}};
int dp[N][2];
int f[N];
int inf = -1000000000;
int bin[25];
ll endstate;

void print(int num) {
	int nnum = (int)num;
	for (int i = 0; i < 18; i++, nnum >>= 1) {
		printf("%d", nnum & 1);
	}
	printf("\n");
}

void build() {
	endstate = 1;
	endstate <<= 18;
	endstate--;
	int k = 1 << 19;
	for (int i = 0; i < k; i++) {
		dp[i][0] = inf;
		dp[i][1] = inf;
	}
	bin[1] = 1;
	for (int i = 2; i <= 18; i++) {
		bin[i] = (bin[i - 1] << 1);
	}
}

int cal(ll state, int k) {
	int a = 0;
	int c = 0;
	for (int i = 0; i < 9; i++) {
		bool flag =	false;
		a = 0;
		for (int j = 0; j < 3; j++) {
			if (mp[i][j] == k) {
				flag = true;
			} else if (bin[mp[i][j]]&state) {
				a++;
			}
		}
		if (!flag)continue;
		if (a == 2) {
			c++;
		}
	}
	return c;
}

int search(ll state, int player, int alp, int bet) {

	int idx;
	int res = inf;
	if (player == 1) {
		idx = 0;
	} else if (player == -1) {
		idx = 1;
	}
	res *= player;

	if (state == endstate) {
		return 0;
	}
	if (dp[state][idx] != inf)return dp[state][idx];

	for (int i = 1; i <= 18; i++) {


		if (bin[i]&state)continue;
		int sum = 0;
		int cnt = cal(state, i);
		ll nstate = state | bin[i];
		if (cnt) {
			sum = player * cnt + search(nstate, player, alp, bet);
		} else {
			sum = search(nstate, player * -1, alp, bet);
		}


		if (idx == 0) {
			res = max(res, sum);
		} else if (idx == 1) {
			res = min(res, sum);
		}
	}
	dp[state][idx ^ 1] = -1 * res;
	return dp[state][idx] = res;
}

int main() {
	int t, n, a, b, gt;
	build();
	scanf("%d", &gt);

	while (gt--) {
		scanf("%d", &t);
		int coun = 0;
		while (t--) {

			scanf("%d", &n);
			ll state = 0;
			int player = 1;
			int sum = 0;
			while (n--) {
				scanf("%d%d", &a, &b);
				if (a > b)swap(a, b);
				for (int i = 1; i <= 18; i++) {
					if (pos[i][0] == a && pos[i][1] == b) {
						int cnt = cal(state, i);
						state |= bin[i];
						if (cnt) {
							sum += player * cnt;
						} else {
							player *= -1;
						}
						break;
					}
				}
			}

			int c = sum + search(state, player, inf, inf * -1);
			if (c > 0) {
				printf("Game %d: A wins.\n", ++coun);
			} else {
				printf("Game %d: B wins.\n", ++coun);
			}
		}
		if (gt)printf("\n");
	}

}

用的方法比较麻烦 不过是自己想的哈哈哈
这个游戏先手必输(小声）

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;

ll mp[20];//记录每个三角形的二进制形式
int pos[20][20];//每条边对应的编号
int vis[20];//记录已经存在的三角形
ll endstate;
void inti() {
	memset(vis, 0, sizeof(vis));
}

void bulid() {
	endstate = 1;
	endstate = endstate << 18;
	endstate--;
	memset(mp, 0, sizeof(mp));
	memset(pos, 0, sizeof(pos));
	int x1 = 0;
	int x2 = 0;
	int x3 = 0;


	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 0;
	x2 <<= 1;
	x3 <<= 2;
	mp[1] |= x1;
	mp[1] |= x2;
	mp[1] |= x3;

	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 3;
	x2 <<= 4;
	x3 <<= 7;
	mp[2] |= x1;
	mp[2] |= x2;
	mp[2] |= x3;

	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 2;
	x2 <<= 4;
	x3 <<= 5;
	mp[3] |= x1;
	mp[3] |= x2;
	mp[3] |= x3;

	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 5;
	x2 <<= 6;
	x3 <<= 8;
	mp[4] |= x1;
	mp[4] |= x2;
	mp[4] |= x3;

	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 9;
	x2 <<= 10;
	x3 <<= 15;
	mp[5] |= x1;
	mp[5] |= x2;
	mp[5] |= x3;

	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 7;
	x2 <<= 10;
	x3 <<= 11;
	mp[6] |= x1;
	mp[6] |= x2;
	mp[6] |= x3;

	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 11;
	x2 <<= 12;
	x3 <<= 16;
	mp[7] |= x1;
	mp[7] |= x2;
	mp[7] |= x3;

	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 8;
	x2 <<= 12;
	x3 <<= 13;
	mp[8] |= x1;
	mp[8] |= x2;
	mp[8] |= x3;

	x1 = 1;
	x2 = 1;
	x3 = 1;
	x1 <<= 13;
	x2 <<= 14;
	x3 <<= 17;
	mp[9] |= x1;
	mp[9] |= x2;
	mp[9] |= x3;


	pos[1][2] = 1;
	pos[1][3] = 2;
	pos[2][3] = 3;
	pos[2][4] = 4;
	pos[2][5] = 5;
	pos[3][5] = 6;
	pos[3][6] = 7;
	pos[4][5] = 8;
	pos[5][6] = 9;
	pos[4][7] = 10;
	pos[4][8] = 11;
	pos[5][8] = 12;
	pos[5][9] = 13;
	pos[6][9] = 14;
	pos[6][10] = 15;
	pos[7][8] = 16;
	pos[8][9] = 17;
	pos[9][10] = 18;

}

ll addpos(int p, ll state) {
	int x = 1;
	x = x << (p - 1);
	state |= x;
	return state;
}

int judge(ll state) {
	int cnt = 0;
	for (int i = 1; i <= 9; i++) {
		if (vis[i] == 0 && ((mp[i] & state) == mp[i])) {
			vis[i] = 1;
			cnt++;
		}
	}
	return cnt;
}

bool dfs(ll cur, int v[20], int now, int aget, int bget) {

//	cout << "123" << endl;

	if (cur == endstate) {

		if (aget == bget)cout << aget + bget << endl;

		if (now % 2 != 0) {
			if (aget > bget) {
				return true;
			} else {
				return false;
			}

		} else {
			if (bget > aget) {
				return true;
			} else {
				return false;
			}
		}
	}

	int x = 1;

	for (int i = 1; i <= 18; i++) {
		x = 1;
		x = x << (i - 1);
		if ((cur & x) == 0) {
			ll newcur = addpos(i, cur);
			int cnt = 0;
			int nv[20];


			for (int k = 1; k <= 9; k++) {
				nv[k]=v[k];
			}

			for (int i = 1; i <= 9; i++) {
				if (nv[i] == 0 && ((mp[i] & newcur) == mp[i])) {
					cnt++;
					nv[i] = 1;
				}
			}

			if (cnt != 0) {
				if (now % 2 != 0) {
					if (dfs(newcur, nv, now, aget + cnt, bget)) {
						return true;
					}
				} else {
					if (dfs(newcur, nv, now, aget, bget + cnt)) {
						return true;
					}
				}
			} else {
				if (!dfs(newcur, nv, now + 1, aget, bget)) {
					return true;
				}
			}
		}
	}
	return false;
}

int main() {
	bulid();
	int coun = 0;
	int t, m, n;
	int a, b, p;
	int aget, bget, get;
	scanf("%d", &t);
	while (t--) {
		coun = 0;
		scanf("%d", &n);
		while (n--) {
			aget = 0;
			bget = 0;
			inti();
			scanf("%d", &m);
			int now = 1;
			ll cur = 0;
			for (int i = 0; i < m; i++) {
				scanf("%d%d", &a, &b);
				if (a < b)swap(a, b);
				if (pos[a][b]) {
					p = pos[a][b];
				} else {
					p = pos[b][a];
				}

				cur = addpos(p, cur);

				get = judge(cur);
				if (get) {
					if (now % 2 != 0) {
						aget += get;
					} else {
						bget += get;
					}
				} else {
					now++;
				}
			}

			if (dfs(cur, vis, now, aget, bget)) {
				if (now % 2 != 0) {
					printf("Game %d: A wins.\n", ++coun);
				} else {
					printf("Game %d: B wins.\n", ++coun);
				}
			} else {
				if (now % 2 != 0) {
					printf("Game %d: B wins.\n", ++coun);
				} else {
					printf("Game %d: A wins.\n", ++coun);
				}
			}
		}
		
		if(t)printf("\n");


	}
}