poj3414有向图的搜索BFS+路径记录

代码偏长只是大体思路

//这道题不能深度回溯的方法，因为倒水的状态是有向图
//那么只能用宽度搜索的方法
//同时我们应该记录路径当找到最优解就退出
//388K 0MS
#include <iostream>
#include <queue>
using namespace std;


#define  MAX_N 103
#define  For(i,a,b) for(int i=a;i<=b;++i)
#define  Rep(i,a,b) for(int i=a;i>=b;--i)
enum oper
{
FILLA,FILLB,DROPA,DROPB,POURA,POURB
};
static struct state
{
int a,b;
int patha,pathb;
int t;
oper op;
}States[110][110];
static int vis[110][110];
static int A,B,C;




static void findpath(int ea,int eb,int t)
{
int eea,eeb;
oper path[1000];
int cnt = 0;
Rep(i,t,1)
{
path[cnt++] = States[ea][eb].op;
eea = ea;eeb = eb;
ea = States[eea][eeb].patha;eb=States[eea][eeb].pathb;
}
Rep(i,cnt-1,0)
{
if (path[i]==FILLA)
printf("FILL(1)\n");
else if (path[i]==FILLB)
printf("FILL(2)\n");
else if (path[i]==DROPA)
printf("DROP(1)\n");
else if (path[i]==DROPB)
printf("DROP(2)\n");
else if (path[i]==POURA)
printf("POUR(1,2)\n");
else if(path[i]==POURB)
printf("POUR(2,1)\n");
}


}


static void BFS()
{
int finda,findb;
state s,s1;
queue<state>que;
s.a = 0;s.b = 0;s.t=0;
que.push(s);
int ans = -1;
while(!que.empty())
{
s = que.front();que.pop();
//判断是否已经找到结果
if (s.a==C||s.b==C)
{
ans = s.t;finda = s.a;findb = s.b;
break;
}
//对于A杯子有3种选择
if (s.a<A)//加满水
{
s1.a = A;s1.b = s.b;s1.t = s.t+1;
if(!vis[s1.a][s1.b]){
que.push(s1);
States[s1.a][s1.b].op = FILLA;
States[s1.a][s1.b].patha = s.a;
States[s1.a][s1.b].pathb = s.b;
vis[s1.a][s1.b] = 1;
}
}
if (s.a>0)
{
s1.a = 0;s1.b = s.b;s1.t = s.t+1;
if(!vis[s1.a][s1.b]){
que.push(s1);
States[s1.a][s1.b].op = DROPA;
States[s1.a][s1.b].patha = s.a;
States[s1.a][s1.b].pathb = s.b;
vis[s1.a][s1.b] = 1;
}
}
if (s.a>0&&s.b<B)
{
if (B-s.b<s.a)
{
s1.a = s.a - (B-s.b);s1.b = B;s1.t = s.t+1;
if(!vis[s1.a][s1.b]){
que.push(s1);
vis[s1.a][s1.b] = 1;
States[s1.a][s1.b].op = POURA;
States[s1.a][s1.b].patha = s.a;
States[s1.a][s1.b].pathb = s.b;
}
}
else
{
s1.a = 0;s1.b = s.b+s.a;s1.t = s.t+1;
if(!vis[s1.a][s1.b]){
que.push(s1);
vis[s1.a][s1.b] = 1;
States[s1.a][s1.b].op = POURA;
States[s1.a][s1.b].patha = s.a;
States[s1.a][s1.b].pathb = s.b;
}
}
}
//对于B杯子的水
if (s.b<B)//加满水
{
s1.a = s.a;s1.b = B;s1.t = s.t+1;s1.patha = s.a;s1.pathb = s.b;
if(!vis[s1.a][s1.b]){
que.push(s1);
vis[s1.a][s1.b] = 1;
States[s1.a][s1.b].op = FILLB;
States[s1.a][s1.b].patha = s.a;
States[s1.a][s1.b].pathb = s.b;
}
}
if (s.b>0)
{
s1.a = s.a;s1.b = 0;s1.t = s.t+1;s1.patha = s.a;s1.pathb = s.b;
if(!vis[s1.a][s1.b]){
que.push(s1);
vis[s1.a][s1.b] = 1;
States[s1.a][s1.b].op = DROPB;
States[s1.a][s1.b].patha = s.a;
States[s1.a][s1.b].pathb = s.b;
}
}
if (s.b>0&&s.a<A)
{
if (A-s.a<s.b)
{
s1.b = s.b - (A-s.a);s1.a = A;s1.t = s.t+1;s1.patha = s.a;s1.pathb = s.b;
if(!vis[s1.a][s1.b]){
que.push(s1);
vis[s1.a][s1.b] = 1;
States[s1.a][s1.b].op = POURB;
States[s1.a][s1.b].patha = s.a;
States[s1.a][s1.b].pathb = s.b;
}
}
else
{
s1.a = s.a+s.b;s1.b = 0;s1.t = s.t+1;s1.patha = s.a;s1.pathb = s.b;
if(!vis[s1.a][s1.b]){
que.push(s1);
vis[s1.a][s1.b] = 1;
States[s1.a][s1.b].op = POURB;
States[s1.a][s1.b].patha = s.a;
States[s1.a][s1.b].pathb = s.b;
}
}
}
}
s.a = s.b = 0;
if (ans==-1)
{
printf("impossible\n");
return;
}
printf("%d\n",ans);
findpath(finda,findb,ans);


}




int main()
{
scanf("%d %d %d",&A,&B,&C);
BFS();
return 0;
}