POJ 3414 Pots【广搜】

Description

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

FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;
DROP(i) empty the pot ito the drain;
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)

code：

View Code

#include<stdio.h>#include<string.h>#define clr(x)memset(x,0,sizeof(x))int v[1001][1001];int va;int vb;struct node{int x,y,xu,step;}q[100000];int pre[100000];//1 full 1   2 full 2   3 drop 1   4  drop 2   5 from a to b  6 from b to avoid print(int x){if(pre[x]!=0)        print(pre[x]);//printf("%d\n",q[x].xu);    if(q[x].xu==1)    printf("FILL(1)\n");else if(q[x].xu==2)    printf("FILL(2)\n");else if(q[x].xu==3)    printf("DROP(1)\n");else if(q[x].xu==4)    printf("DROP(2)\n");else if(q[x].xu==5)    printf("POUR(1,2)\n");else printf("POUR(2,1)\n");}int main(){int a,b,c,i,j,front,rear,tmp,v1,v2,res,ans;while(scanf("%d%d%d",&a,&b,&c)!=EOF)    {        va=vb=0;        front=rear=0;        q[rear].xu=0; q[rear].step=0;  q[rear].x=0; q[rear++].y=0;        res=-1;        v[0][0]=1;

        memset(pre,0,sizeof(pre));while(front<=rear)        {           va=q[front].x; vb=q[front].y;//printf("%d %d\n",va,vb);           if(va==c||vb==c) { res=q[front].step;ans=front; break;}if(!v[a][vb]) { v[a][vb]=1; q[rear].x=a;  q[rear].y=vb; q[rear].xu=1; pre[rear]=front;   q[rear++].step=q[front].step+1; }if(!v[va][b]) { v[va][b]=1; q[rear].x=va; q[rear].y=b;  q[rear].xu=2; pre[rear]=front;   q[rear++].step=q[front].step+1; }if(!v[0][vb]) { v[0][vb]=1; q[rear].x=0;  q[rear].y=vb; q[rear].xu=3; pre[rear]=front;   q[rear++].step=q[front].step+1; }if(!v[va][0]) { v[va][0]=1; q[rear].x=va; q[rear].y=0;  q[rear].xu=4; pre[rear]=front;   q[rear++].step=q[front].step+1; }if((va+vb)/b<1){if(!v[0][va+vb]){ v[0][va+vb]=1; q[rear].x=0; q[rear].y=va+vb; q[rear].xu=5; pre[rear]=front; q[rear++].step=q[front].step+1; }           }else if(!v[va-(b-vb)][b]) { v[va-(b-vb)][b]=1; q[rear].x=va-(b-vb); q[rear].y=b; q[rear].xu=5; pre[rear]=front; q[rear++].step=q[front].step+1; }if((va+vb)/a<1){if(!v[va+vb][0]){ v[va+vb][0]=1; q[rear].x=va+vb; q[rear].y=0; q[rear].xu= 6; pre[rear]=front; q[rear++].step=q[front].step+1; }           }else if(!v[a][vb-(a-va)]) { v[a][vb-(a-va)]=1; q[rear].x=a; q[rear].y=vb-(a-va); q[rear].xu=6; pre[rear]=front; q[rear++].step=q[front].step+1; }           front++;        }if(res==-1)printf("impossible\n");else {                printf("%d\n",res);                print(ans);        }    }return 0;}

转载于:https://www.cnblogs.com/dream-wind/archive/2012/03/22/2412181.html

POJ 3414 Pots【广搜】相关推荐

POJ 3414 Pots（深搜并打印路径）
POJ 3414 Pots(深搜并打印路径) You are given two pots, having the volume of A and B liters respectively. The ...
POJ 3414 Pots【BFS】+ Python
原题链接: 3414 -- Pots 参考资料:POJ 3414 - Pots | 眈眈探求 POJ 3414 Pots[BFS][图搜] - it610.com 一特别注意: 1. 每一种操作对应 ...
POJ 3414 Pots（罐子）
POJ 3414 Pots(罐子) Time Limit: 1000MS Memory Limit: 65536K Description - 题目描述 You are given two po ...
POJ 3414 Pots
题目链接 Description You are given two pots, having the volume of A and B liters respectively. The follo ...
poj 1426 栈广搜
题目意思很简单 : 就是找一个十进制的数,全由 1 0 组成,是输入那个数字的整数倍答案有很多种,所以是special judge 需要用到 : 同余取模定理广搜因为是广搜我们就可以用栈当然也 ...
poj 3414 Pots（广搜BFS+路径输出）
转载请注明出处:http://blog.csdn.net/u012860063?viewmode=contents 题目链接:http://poj.org/problem?id=3414 此题和poj ...
poj 3414 Pots BFS
参考文章:思路公式代码思路原来的代码有点瑕疵,这是最新的AC代码 #pragma warning(disable:4996) #include<iostream> #include&l ...
H - Pots POJ - 3414(两个锅互相倒水)
H - Pots POJ - 3414 题意: (两个锅互相倒水)希望能通过题目中的几种操作使一个锅中的水量为目标水量 bfs 搜索每一步的每种操作,直到所有操作用完,则impossible,否则输出 ...
Pots POJ - 3414（bfs）
You are given two pots, having the volume of A and B liters respectively. The following operations c ...

POJ 3414 Pots【广搜】

POJ 3414 Pots【广搜】相关推荐

最新文章

热门文章