第六次训练 H题

问题链接：Problem H

问题简述：

可乐的体积为S，同时有容量M,N（S=N+M)的两个杯子，三个容器间可相互倒可乐，问能否得到两杯体积相等的可乐，若能，则输出最短步骤数。

问题分析：
遵循无刻度的倒水原则，S为奇数时必然不行，可以先剪枝剪掉。而三个杯子的倒水方向可以有6种，可以使用BFS向六个方向搜索，寻找最短路径，当三个容器中两杯可乐体积一致，且另一杯为空时，可视为已经平分。

AC通过的C语言程序如下：

#include<iostream>
#include<cstdio>
#include<cstdlib> 
#include<algorithm>
#include<queue>
#include<set>
#include<cstring>
#include<cmath>
using namespace std;
int s,n,m;
bool vis[105][105][105];
struct node{
	int s;
	int n;
	int m;
	int step;
};
int BFS(){
	queue<node>q;
	node p1;
	p1.s=s;
	p1.n=0;
	p1.m=0;
	p1.step=0;
	int half=s/2;
	vis[s][0][0]=1;
	q.push(p1);
	while(!q.empty()){
		node p2=q.front();
		if(s%2){
			return -1;
		}
		q.pop();
		if((p2.s==p2.m&&p2.s==half)||(p2.s==p2.n&&p2.s==half)||(p2.n==p2.m&&p2.n==half)){
			return p2.step;
		}
		if(p2.s&&p2.n!=n){
			if(p2.s>n-p2.n){
				p1.s=p2.s-(n-p2.n);
				p1.n=n;
				p1.m=p2.m;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
			else{
				p1.s=0;
				p1.n=p2.n+p2.s;
				p1.m=p2.m;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
		}
		if(p2.s&&p2.m!=m){
			if(p2.s>m-p2.m){
				p1.s=p2.s-(m-p2.m);
				p1.n=p2.n;
				p1.m=m;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
			else{
				p1.s=0;
				p1.n=p2.n;
				p1.m=p2.m+p2.s;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}	
		}
		if(p2.n&&p2.s!=s){
			if(p2.n>s-p2.s){
				p1.s=s;
				p1.n=p2.n-(s-p2.s);
				p1.m=p2.m;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
			else{
				p1.s=p2.s+p2.n;
				p1.n=0;
				p1.m=p2.m;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
		}
		if(p2.n&&p2.m!=m){
			if(p2.n>m-p2.m){
				p1.s=p2.s;
				p1.n=p2.n-(m-p2.m);
				p1.m=m;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
			else{
				p1.s=p2.s;
				p1.n=0;
				p1.m=p2.m+p2.n;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}	
		}
		if(p2.m&&p2.s!=s){
			if(p2.m>s-p2.s){
				p1.s=s;
				p1.n=p2.n;
				p1.m=p2.m-(s-p2.s);
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
			else{
				p1.s=p2.s+p2.m;
				p1.n=p2.n;
				p1.m=0;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
		}
		if(p2.m&&p2.n!=n){
			if(p2.m>n-p2.n){
				p1.s=p2.s;
				p1.n=n;
				p1.m=p2.m-(n-p2.n);
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
			else{
				p1.s=p2.s;
				p1.n=p2.n+p2.m;
				p1.m=0;
				p1.step=p2.step+1;
				if(vis[p1.s][p1.n][p1.m]==0){
					q.push(p1);
					vis[p1.s][p1.n][p1.m]=1;
				}
			}
		}
	}
	return -1;
}
int main(){
	std::ios::sync_with_stdio(false);
	while(cin>>s>>n>>m){
		if(!s&&!n&&!m){
			break;
		}
		memset(vis,0,sizeof(vis));
		int ans=BFS();
		if(ans==-1){
			cout<<"NO"<<endl;
		}
		else{
			cout<<ans<<endl;
		}
	}
}