POJ3414 bfs

这个题第一眼感觉就是分情况讨论。当时推了好久，但感觉很混乱而且太麻烦，没想到是BFS。

其实根据BFS的一些性质应该是能想到的：有限个确定的方式+树的宽度不大（数据不大）

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
#define ll long long int 
#define res register int 
#define inf 0x3f3f3f3f
const int maxn=105;
int A,B,C;
struct Node{
	int prea,preb,a,b,way;
}node[maxn][maxn];
//FILL(1) FILL(2) DROP(1) DROP(2)  
//POUR(1,2) POUR(2,1)

void output(int x,int y,int n){
	if(x==0&&y==0){
		printf("%d\n",n);
		return ;
	}
	output(node[x][y].prea,node[x][y].preb,n+1);
	switch(node[x][y].way)
	{
		case 1: printf("FILL(1)\n"); break;
		case 2: printf("FILL(2)\n"); break;
		case 3: printf("DROP(1)\n"); break;
		case 4: printf("DROP(2)\n"); break;
		case 5: printf("POUR(1,2)\n"); break;
		case 6: printf("POUR(2,1)\n"); break;
	}
}

bool bfs()
{
	queue<Node> q;
	node[0][0]=(Node){-1,-1,0,0,-1};
	q.push(node[0][0]);
	while(!q.empty()){
		Node now=q.front();
		q.pop();
		if(now.a==C||now.b==C){
			output(now.a,now.b,0);
			return true;
		}
		if(now.a!=A&&!node[A][now.b].way){
			node[A][now.b]=(Node){now.a,now.b,A,now.b,1};
			q.push(node[A][now.b]);
		}
			
		if(now.b!=B&&!node[now.a][B].way){
			node[now.a][B]=(Node){now.a,now.b,now.a,B,2};
			q.push(node[now.a][B]);
		}
		if(now.a!=0&&!node[0][now.b].way){
			node[0][now.b]=(Node){now.a,now.b,0,now.b,3};
			q.push(node[0][now.b]); 
		}
		if(now.b!=0&&!node[now.a][0].way){
			node[now.a][0]=(Node){now.a,now.b,now.a,0,4};
			q.push(node[now.a][0]);	
		}
		if(now.a!=0&&now.b!=B){
			int a=now.a+now.b-B,b=now.a+now.b;
			if(a<0) a=0;
			if(b>B) b=B;
			if(!node[a][b].way){
				node[a][b]=(Node){now.a,now.b,a,b,5};
				q.push(node[a][b]);
			}
		}
		if(now.a!=A&&now.b!=0){
			int a=now.a+now.b,b=now.a+now.b-A;
			if(a>A) a=A;
			if(b<0) b=0;
			if(!node[a][b].way){
				node[a][b]=(Node){now.a,now.b,a,b,6};
				q.push(node[a][b]);
			}
		}
	}
	return false;	
}

int main()
{
	cin>>A>>B>>C;
	if(!bfs()) printf("impossible");
	return 0;
}