hdu1495倒水问题BFS

添加链接描述

#include<bits/stdc++.h>
using namespace std;
int s,m,n;
int vis[101][101][101];
struct pos{
	int s,m,n;
	int step;
}a[101];
void bfs(){
	queue<pos> q;
	memset(vis,0,sizeof vis);
	pos p1;
	p1.s =s;
	p1.m =0;
	p1.n =0;
	p1.step =0;
	q.push(p1);
	vis[p1.s ][0][0]=1;
	while(!q.empty()){
		p1=q.front();
		q.pop();
		if(p1.s ==s/2&&p1.m ==s/2||p1.s ==s/2&&p1.n ==s/2||p1.m ==s/2&&p1.n ==s/2){
			printf("%d\n",p1.step );
			return;
		}
		pos p2;
		if(p1.s !=0){
			if(p1.s >m-p1.m ){
				p2.s =p1.s -(m-p1.m );
				p2.m =m;
				p2.n =p1.n ;
				p2.step =p1.step +1;
			}
			else{
				p2.s =0;
				p2.m =p1.m +p1.s ;
				p2.n =p1.n ;
				p2.step =p1.step +1;
			}
			if(vis[p2.s ][p2.m ][p2.n ]==0){
				vis[p2.s ][p2.m ][p2.n ]=1;
				q.push(p2);
			}
		}
		if(p1.s !=0){
			if(p1.s >n-p1.n ){
				p2.s =p1.s -(n-p1.n );
				p2.m =p1.m ;
				p2.n =n;
				p2.step =p1.step +1;
			}
			else{
				p2.s =0;
				p2.m =p1.m ;
				p2.n =p1.n +p1.s ;
				p2.step =p1.step +1;
			}
			if(vis[p2.s ][p2.m ][p2.n ]==0){
				vis[p2.s ][p2.m ][p2.n ]=1;
				q.push(p2);
			}
		}
		if(p1.m !=0){
			if(p1.m >s-p1.s ){
				p2.s =s;
				p2.m =p1.m -(s-p1.s );
				p2.n =p1.n ;
				p2.step =p1.step +1;
			}
			else{
				p2.m =0;
				p2.s =p1.m +p1.s ;
				p2.n =p1.n;
				p2.step =p1.step +1;
			}
			if(vis[p2.s ][p2.m ][p2.n ]==0){
				vis[p2.s ][p2.m ][p2.n ]=1;
				q.push(p2);
			}
		}
		if(p1.m !=0){
			if(p1.m >n-p1.n ){
				p2.s =p1.s ;
				p2.m =p1.m -(n-p1.n );
				p2.n =n ;
				p2.step =p1.step +1;
			}
			else{
				p2.m =0;
				p2.s =p1.s ;
				p2.n =p1.n+p1.m ;
				p2.step =p1.step +1;
			}
			if(vis[p2.s ][p2.m ][p2.n ]==0){
				vis[p2.s ][p2.m ][p2.n ]=1;
				q.push(p2);
			}
		}
		if(p1.n !=0){
			if(p1.n >s-p1.s ){
				p2.s =s ;
				p2.m =p1.m;
				p2.n =p1.n -(s-p1.s ) ;
				p2.step =p1.step +1;
			}
			else{
				p2.m =p2.m ;
				p2.s =p1.s +p1.n ;
				p2.n =0;
				p2.step =p1.step +1;
			}
			if(vis[p2.s ][p2.m ][p2.n ]==0){
				vis[p2.s ][p2.m ][p2.n ]=1;
				q.push(p2);
			}
		}
		if(p1.n !=0){
			if(p1.n >m-p1.m ){
				p2.s =p1.s ;
				p2.m =m;
				p2.n =p1.n -(m-p1.m ) ;
				p2.step =p1.step +1;
			}
			else{
				p2.m =p1.m +p1.n ;
				p2.s =p1.s ;
				p2.n =0;
				p2.step =p1.step +1;
			}
			if(vis[p2.s ][p2.m ][p2.n ]==0){
				vis[p2.s ][p2.m ][p2.n ]=1;
				q.push(p2);
			}
		}
	}
	printf("NO\n");
}
int main()
{
	while(scanf("%d%d%d",&s,&n,&m)!=EOF){
		if(s==0&&n==0&&m==0) break;
		if(s%2!=0){
			cout<<"NO"<<endl;
			continue;
		}
		bfs();	
	}
	return 0;
}