poj3414Pots(倒水BFS)

Pots

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13231		Accepted: 5553		Special Judge

Description

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 j is 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 operations K. 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)

#include"cstdio"
#include"cstring"
#include"queue"
#include"algorithm"
using namespace std;
const int MAXN=;
struct node{
    int a,b,op,pre;
    node(int ca,int cb,int co,int cp):a(ca),b(cb),op(co),pre(cp){}
    node(){}
};
const char* opit[]={"","FILL(1)","FILL(2)","DROP(1)","DROP(2)","POUR(1,2)","POUR(2,1)"};
int vis[MAXN][MAXN];
int A,B,C;
node step[MAXN*MAXN];
int cnt;
void print(int now,int ans)//??????
{
    node no = step[now];
    if(no.pre==-)
    {
        printf("%d\n",ans);
        return ;
    }
    print(no.pre,ans+);
    printf("%s\n",opit[no.op]);
}
void bfs()
{
    memset(vis,,sizeof(vis));
    cnt=;
    queue<node> que;
    que.push(node(,,,-));
    while(!que.empty())
    {
        node now = que.front();que.pop();
        step[cnt++]=now;
        if(now.a==C||now.b==C)
        {
            print(cnt-,);
            return ;
        }
        int ta,tb;
        //第一种操作 FILL(A)
        ta=A,tb=now.b;
        if(!vis[ta][tb])
        {
            vis[ta][tb]=;
            que.push(node(ta,tb,,cnt-));
        }
 
        //第二种操作 FILL(B)
        ta=now.a,tb=B;
        if(!vis[ta][tb])
        {
            vis[ta][tb]=;
            que.push(node(ta,tb,,cnt-));
        }
        //第三种操作 DROP(A)
        ta=,tb=now.b;
        if(!vis[ta][tb])
        {
            vis[ta][tb]=;
            que.push(node(ta,tb,,cnt-));
        }
        //第四种操作 DROP(B)
        ta=now.a,tb=;
        if(!vis[ta][tb])
        {
            vis[ta][tb]=;
            que.push(node(ta,tb,,cnt-));
        }
        //第五种操作 POUR(A,B)
        ta=now.a-min(B-now.b,now.a);
        tb=now.b+min(B-now.b,now.a);
        if(!vis[ta][tb])
        {
            vis[ta][tb]=;
            que.push(node(ta,tb,,cnt-));
        }
        //第六种操作 POUR(B,A)
        ta=now.a+min(A-now.a,now.b);
        tb=now.b-min(A-now.a,now.b);
        if(!vis[ta][tb])
        {
            vis[ta][tb]=;
            que.push(node(ta,tb,,cnt-));
        }
    }
    printf("impossible\n");
}
int main()
{
    while(scanf("%d%d%d",&A,&B,&C)!=EOF)
    {
        bfs();
    }
    return ;
}