hdu 1495 非常可乐

#include<bits/stdc++.h>
using namespace std;
const int M = 105;
int s,n,m;
struct cup{
	int v[5];
	int step;
}temp;
int vis[M][M][M],v[5];
void pour(int a,int b){
	int sum = temp.v[a]+temp.v[b];
	if(sum>=v[b]) temp.v[b] = v[b];
	else temp.v[b] = sum;
	temp.v[a] = sum-temp.v[b];
}
void bfs(){
	int i,j;
	queue<cup>q;
	cup cnt;cnt.v[1] = v[1];
	cnt.v[2] = 0;cnt.v[3] = 0;cnt.step = 0;
	q.push(cnt);memset(vis,0,sizeof vis);
	vis[v[1]][0][0] = 1;
	while(!q.empty()){
		cnt = q.front();q.pop();
		if(cnt.v[1]==cnt.v[3]&&cnt.v[2]==0){
			printf("%d\n",cnt.step);
			return ;
		}
		for(i = 1;i<=3;i++){
			for(j = 1;j<=3;j++){
				if(i!=j){
					temp = cnt;pour(i,j);
					if(!vis[temp.v[1]][temp.v[2]][temp.v[3]]){
						temp.step++;q.push(temp);
						vis[temp.v[1]][temp.v[2]][temp.v[3]] = 1;
					}
				}
			}
		}
	}
	printf("NO\n");
}
int main (){
	while(~scanf("%d%d%d",&v[1],&v[2],&v[3])){
		if(v[1]==0&&v[2]==0&&v[3]==0) break;
		if(v[2]>v[3]){
			int t = v[2];v[2] = v[3];v[3] = t;
		}
		bfs();
	}
	return 0;
}

题目链接：https://acm.hdu.edu.cn/showproblem.php?pid=1495