poj3414pots

//此题采用广搜，找到满足条件的最小步数 #include #include using namespace std; #define MAX 101 int v[MAX][MAX]; int A,B,C; bool flag; struct node{ int a,b; int op,pre; int l; }; void f(); int main() { int i=0,j=0; flag=false; for(i=0;i >A>>B>>C; f(); if(!flag) cout<<"impossible"< q,r; node *seq=new node[A*B*6]; int index=0; node s_node,cur_node; s_node.a=0; s_node.b=0; s_node.pre=-1; s_node.l=0; v[0][0]=1; q.push(s_node); while(!q.empty()) { cur_node=q.front(); q.pop(); node ext_node,t_node; for(i=0;i<6;i++) { cur_node.op=i; // copy_node(cur_node,seq[index++]); t_node.a=cur_node.a; t_node.b=cur_node.b; if(!op(t_node,i)) continue; ext_node=t_node; if((ext_node.a==C) || (ext_node.b==C)) { flag=true; ext_node.pre=index-1; int l=cur_node.l+1; cout< < -1;j--) { if(rel[j]==0) cout<<"FILL(1)"<