POJ - 3414 （隐式图搜索+记录路径）

Pots

 

You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:

1. FILL(i)        fill the pot i (1 ≤ i ≤ 2) from the tap;
2. DROP(i)      empty the pot i to the drain;
3. POUR(i,j)    pour from pot i to pot j; after this operation either the pot jis full (and there may be some water left in the pot i), or the pot i is empty (and all its contents have been moved to the pot j).

Write a program to find the shortest possible sequence of these operations that will yield exactly C liters of water in one of the pots.

Input

On the first and only line are the numbers A, B, and C. These are all integers in the range from 1 to 100 and C≤max(A,B).

Output

The first line of the output must contain the length of the sequence of operationsK. The following K lines must each describe one operation. If there are several sequences of minimal length, output any one of them. If the desired result can’t be achieved, the first and only line of the file must contain the word ‘impossible’.

Sample Input

3 5 4

Sample Output

6
FILL(2)
POUR(2,1)
DROP(1)
POUR(2,1)
FILL(2)
POUR(2,1)

思路：之前做过一道类似的题，但没有要求记录路径，看见这道题的时候不知道怎样记录状态，后来知道用数字来记录，总共有六种状态，每种状态确定一个数字。运用广搜去扩展状态，同时标记出现过的状态，此题最多有10000种状态，用结构体数组记录路径，每次都把前面的步骤都记录下来，所以最后在一个结构体种直接输出。

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;

int a,b,c;
struct node
{
    int x,y,step;
    int state[10000];
} t1,t2;
queue<node> Q;
int vis[110][110];
void Push()
{
    int x = t2.x,y = t2.y;
    if(!vis[x][y])
    {
        vis[x][y] = 1;
        Q.push(t2);
    }
}
int main()
{
    while(~scanf("%d%d%d",&a,&b,&c))
    {
        while(!Q.empty())
            Q.pop();
        t1.x = 0,t1.y = 0,t1.step = 0;
        t1.state[0] == 0;
        Q.push(t1);
        memset(vis,0,sizeof(vis));
        vis[0][0] = 1;
        int f = 0;
        while(!Q.empty())
        {
            t1 = Q.front();
            if(t1.x == c || t1.y == c)
            {
                printf("%d\n",t1.step);
                for(int i = 1;i<=t1.step;i++)
                {
                    int j = t1.state[i];
                    if(j == 1) printf("FILL(1)\n");
                    if(j == 2) printf("FILL(2)\n");
                    if(j == 3) printf("DROP(1)\n");
                    if(j == 4) printf("DROP(2)\n");
                    if(j == 5) printf("POUR(1,2)\n");
                    if(j == 6) printf("POUR(2,1)\n");
                }
                f = 1;
                break;
            }
            Q.pop();
            t1.step = t1.step+1;
            int s = t1.step+1;
            if(t1.x<a)
            {
                t2 = t1;
                t2.x = a;
                t2.state[s] = 1;
                Push();
            }
            if(t1.y<b)
            {
                t2 = t1;
                t2.y = b;
                t2.state[s] = 2;
                Push();
            }
            if(t1.x>0)
            {
                t2 = t1;
                t2.x = 0;
                t2.state[s] = 3;
                Push();
                t2 = t1;
                t2.state[s] = 5;
                if(t1.x+t1.y >= b)
                {
                    t2.x = t1.x+t1.y-b;
                    t2.y = b;
                }
                else
                {
                    t2.x = 0;
                    t2.y = t1.y+t1.x;
                }
                Push();
            }
            if(t1.y>0)
            {
                t2 = t1;
                t2.y = 0;
                t2.state[s] = 4;
                Push();
                t2 = t1;
                t2.state[s] = 6;
                if(t1.x+t1.y >= a)
                {
                    t2.x = a;
                    t2.y = t1.x+t1.y-a;
                }
                else
                {
                    t2.x = t1.x+t1.y;
                    t2.y = 0;
                }
                Push();
            }
        }
        if(!f) printf("impossible\n");
    }
    return 0;
}