hdu 1495(bfs)

题解：倒水问题，不同的是在bfs之前如果初始体积是奇数一定无法平分，因为三个容器体积都是整数。

#include <stdio.h>
#include <string.h>
#include <queue>
#include <cmath>
using namespace std;
const int N = 105;

struct ST {
	int ke[3];
	int step;
}st, st1;
queue<ST> q;
int vis[N][N];
int n, m, s, flag[3];

int judge(ST temp) {
	int a = 0;
	for (int i = 0; i < 3; i++)
		if (temp.ke[i] == (s / 2))
			a++;
	if (a == 2)
		return 1;
	return 0;
}

int bfs() {
	while (!q.empty())
		q.pop();
	memset(vis, 0, sizeof(vis));
	vis[st.ke[0]][st.ke[1]] = 1;
	q.push(st);
	while (!q.empty()) {
		st = q.front();
		q.pop();
		for (int i = 0; i < 3; i++) {
			for (int j = 0; j < 3; j++) {
				if (i == j)
					continue;
				st1 = st;
				int temp = flag[j] - st.ke[j];
				if (st.ke[i] > temp) {	
					st1.ke[j] = flag[j];
					st1.ke[i] = st.ke[i] - temp;
				}
				else {
					st1.ke[j] = st.ke[j] + st.ke[i];
					st1.ke[i] = 0;
				}
				if (!vis[st1.ke[1]][st1.ke[2]]) {
					vis[st1.ke[1]][st1.ke[2]] = 1;
					st1.step++;
					if (judge(st1))
						return st1.step;
					q.push(st1);
				}
			}
		}
	}
	return -1;
}

int main() {
	while (scanf("%d%d%d", &s, &n, &m) && (s + n + m)) {
		flag[0] = s;
		flag[1] = n;
		flag[2] = m;
		st.step = 0;
		st.ke[0] = s;
		st.ke[1] = st.ke[2] = 0;
		if (s % 2 == 0) {
			int ans = bfs();
			if (ans == -1)
				printf("NO\n");
			else
				printf("%d\n", ans);
		}
		else
			printf("NO\n");
	}
	return 0;
}