POJ 3414 Pots (BFS/DFS)

Pots

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7783		Accepted: 3261		Special Judge

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 i to 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)

Source

Northeastern Europe 2002, Western Subregion

问题链接：POJ3414 Pots。

扫描二维码关注公众号，回复： 4314985 查看本文章

题意简述：

　　给出两个壶的容量A和B, 一个目标水量C，对A、B可以有３种操作，求最少经过几步操作能够在某个壶中得到目标水量C。输入A、B和C，输入最少操作数和操作过程。

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 potj is full (and there may be some water left in the poti), or the poti is empty (and all its contents have been moved to the potj).
问题分析：

　　把A和B壶中水量作为状态，初始状态为<0,0>，每个操作都是状态变化的过程。因为有２个壶，所以总共有６种操作。使用ＢＦＳ搜索来找到最少的操作步数。同时需要考虑操作的条件，以减少操作来加快程序运行速度。

程序说明：

　　搜索过的状态就不需要再搜索了，用数组notvist[][]来标记搜索过的状态。操作的前提条件已经写在程序中。

BFS实现代码

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>

using namespace std;

const int maxn=110;

string op[7]={"","FILL(1)","FILL(2)","DROP(1)","DROP(2)","POUR(2,1)","POUR(1,2)"};

int l,r;
int a,b,c;
int vis[maxn][maxn],step[maxn*maxn];

struct node{
    int x,y;
    int opr;
    int pre;
}info[maxn*maxn];

void Solve(int x,int y,int opr){
    if(vis[x][y])
        return ;
    vis[x][y]=1;
    info[r].x=x;
    info[r].y=y;
    info[r].opr=opr;
    info[r].pre=l;
    r++;
}

void Print(){
    int ans=0;
    while(l!=0){
        step[ans++]=info[l].opr;
        l=info[l].pre;
    }
    printf("%d\n",ans);
    for(int i=ans-1;i>=0;i--)
        cout<<op[step[i]]<<endl;
}

void BFS(){
    info[0].x=0;
    info[0].y=0;
    vis[0][0]=1;
    l=0;
    r=1;
    int tx,ty;
    while(l!=r){
        if(info[l].x==c || info[l].y==c){
            Print();
            return ;
        }

        tx=a;
        ty=info[l].y;
        Solve(tx,ty,1);

        tx=info[l].x;
        ty=b;
        Solve(tx,ty,2);

        tx=0;
        ty=info[l].y;
        Solve(tx,ty,3);

        tx=info[l].x;
        ty=0;
        Solve(tx,ty,4);

        tx=info[l].x+min(a-info[l].x,info[l].y);
        ty=info[l].y-min(a-info[l].x,info[l].y);
        Solve(tx,ty,5);

        tx=info[l].x-min(b-info[l].y,info[l].x);
        ty=info[l].y+min(b-info[l].y,info[l].x);
        Solve(tx,ty,6);

        l++;
    }
    if(l>=r)
        printf("impossible\n");
}

int main(){

    //freopen("input.txt","r",stdin);

    while(~scanf("%d%d%d",&a,&b,&c)){
        memset(vis,0,sizeof(vis));
        BFS();
    }
    return 0;
}

View Code

DFS实现代码

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

int a, b, c;
int va, vb;

const int MAX = 999999;
int ans = MAX;

int arr[100000] = {0};
int arr1[100000] = {0};
int k = 0;

int m[200][200] = {0};

// 1:fill(1) 2: drop(1) 3: pour(1,2) 4: fill(2) 5: drop(2) 6: pour(2,1);

int dfs(int a, int b, int cnt)
{
    if(m[a][b] )
    {
        return 0;
    }
    else
    {
        m[a][b] = 1;
    }
    if(a == c || b == c)
    {
        if(ans >= cnt)
        {
            ans = cnt;
            for(int i = 0; i < cnt; i++)
            {
                arr1[i] = arr[i];
            }
            m[a][b] = 0;
            return 0;
        }
    }

    arr[cnt] = 1;
    dfs(va, b, cnt + 1);
    
    arr[cnt] = 2;
    //printf("cnt = %d\n", cnt);
    dfs(0, b, cnt + 1);
    
    arr[cnt] = 3;
    if(vb - b < a)
    {
        dfs(a - vb + b, vb, cnt + 1);
    }
    else
    {
        dfs(0, b + a, cnt + 1);
    }
    
    arr[cnt] = 4;
    dfs(a, vb, cnt + 1);
    
    arr[cnt] = 5;
    dfs(a, 0, cnt + 1);
    
    arr[cnt] = 6;
    if(va - a < b)
    {
        dfs(va, b - va + a, cnt + 1);
    }
    else
    {
        dfs(a + b, 0, cnt + 1);
    }

    m[a][b] = 0;
}

int main()
{
    scanf("%d%d%d", &va, &vb, &c);
    a = 0;
    b = 0;
    dfs(0, 0, 0);

    if(ans == MAX)
    {
        printf("impossible\n");
    }
    else
    {
        printf("%d\n", ans);
        
        for(int i = 0; i < ans; i++)
        {
            if(arr1[i] == 1)
            {
                printf("FILL(1)\n");
            }
            
            else if(arr1[i] == 2)
            {
                printf("DROP(1)\n");
            }
            
            else if(arr1[i] == 3)
            {
                printf("POUR(1,2)\n");
            }
            
            else if(arr1[i] == 4)
            {
                printf("FILL(2)\n");
            }
            
            else if(arr1[i] == 5)
            {
                printf("DROP(2)\n");
            }
            
            else
            {
                printf("POUR(2,1)\n");
            }
        }
    }

    return 0;
}

View Code

POJ 3414 Pots (BFS/DFS)

猜你喜欢