zoukankan      html  css  js  c++  java
  • POJ 1606 Jugs

    Jugs
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 4280   Accepted: 2533   Special Judge

    Description

    In the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given a 3-gallon jug and a 5-gallon jug and were asked to fill the 5-gallon jug with exactly 4 gallons. This problem generalizes that puzzle. 

    You have two jugs, A and B, and an infinite supply of water. There are three types of actions that you can use: (1) you can fill a jug, (2) you can empty a jug, and (3) you can pour from one jug to the other. Pouring from one jug to the other stops when the first jug is empty or the second jug is full, whichever comes first. For example, if A has 5 gallons and B has 6 gallons and a capacity of 8, then pouring from A to B leaves B full and 3 gallons in A. 

    A problem is given by a triple (Ca,Cb,N), where Ca and Cb are the capacities of the jugs A and B, respectively, and N is the goal. A solution is a sequence of steps that leaves exactly N gallons in jug B. The possible steps are 

    fill A 
    fill B 
    empty A 
    empty B 
    pour A B 
    pour B A 
    success 

    where "pour A B" means "pour the contents of jug A into jug B", and "success" means that the goal has been accomplished. 

    You may assume that the input you are given does have a solution.

    Input

    Input to your program consists of a series of input lines each defining one puzzle. Input for each puzzle is a single line of three positive integers: Ca, Cb, and N. Ca and Cb are the capacities of jugs A and B, and N is the goal. You can assume 0 < Ca <= Cb and N <= Cb <=1000 and that A and B are relatively prime to one another.

    Output

    Output from your program will consist of a series of instructions from the list of the potential output lines which will result in either of the jugs containing exactly N gallons of water. The last line of output for each puzzle should be the line "success". Output lines start in column 1 and there should be no empty lines nor any trailing spaces.

    Sample Input

    3 5 4 
    5 7 3 

    Sample Output

    fill B 
    pour B A 
    empty A 
    pour B A 
    fill B 
    pour B A 
    success 
    fill A 
    pour A B 
    fill A 
    pour A B 
    empty B 
    pour A B 
    success 
    解题方法:类似于三个水杯倒水问题,用广搜。
    #include <stdio.h>
    #include <iostream>
    #include <string.h>
    using namespace std;
    
    typedef struct cup
    {
        int a;
        int b;
        int pre;
        int step;
    }Cup;
    
    Cup Queue[100000];
    int nCount = 0;
    
    void PrintStep(int step)
    {
        switch(step)
        {
        case 0:
            printf("fill A
    ");
            break;
        case 1:
            printf("fill B
    ");
            break;
        case 2:
            printf("empty A
    ");
            break;
        case 3:
            printf("empty B
    ");
            break;
        case 4:
            printf("pour A B
    ");
            break;
        case 5:
            printf("pour B A
    ");
            break;
        }
    }
    
    void Print(int front)
    {
        int k = front, j;
        for (;;)
        {
            j = k;
            k = Queue[k].pre;
            if (Queue[j].pre == -1)
            {
                Queue[j].pre = -2;
                break;
            }
            else
            {
                Queue[j].pre = -2;
            }
        }
        for (int i = 0; i <= nCount; i++)
        {
            if (Queue[i].pre == -2)
            {
                PrintStep(Queue[i].step);
            }
        }
        printf("success
    ");
    }
    
    bool IsExit(int a, int b)
    {
        for (int i = 0; i <= nCount; i++)
        {
            if (Queue[i].a == a && Queue[i].b == b)
            {
                return true;
            }
        }
        return false;
    }
    
    void BFS(int va, int vb, int result)
    {
        if (va == result)
        {
            printf("fill A
    success
    ");
            return;
        }
        if (vb == result)
        {
            printf("fill B
    success
    ");
            return;
        }
        int front = -1;
        int rear = -1;
        memset(Queue, 0, sizeof(Queue));
        ++nCount;
        Queue[++rear].pre = -1;
        Queue[rear].a = va;
        Queue[rear].b = 0;
        Queue[rear].step = 0;
        ++nCount;
        Queue[++rear].pre = -1;
        Queue[rear].a = 0;
        Queue[rear].b = vb;
        Queue[rear].step = 1;
        int a, b;
        while(front <= rear)
        {
            int cura = Queue[++front].a;
            int curb = Queue[front].b;
            if (cura == result || curb == result)
            {
                Print(front);
                return;
            }
            if (cura > 0)
            {
                if (cura + curb > vb)
                {
                    a = cura + curb - vb;
                    b = vb;
                    if (!IsExit(a, b))
                    {
                        Queue[++rear].a = a;
                        Queue[rear].b = b;
                        Queue[rear].pre = front;
                        Queue[rear].step = 4;
                        ++nCount;
                    }
                }
                else
                {
                    a = 0;
                    b = cura + curb;
                    if (!IsExit(a, b))
                    {
                        Queue[++rear].a = a;
                        Queue[rear].b = b;
                        Queue[rear].pre = front;
                        Queue[rear].step = 4;
                        ++nCount;
                    }
                }
                a = 0;
                b = curb;
                if (!IsExit(a, b))
                {
                    Queue[++rear].a = a;
                    Queue[rear].b = b;
                    Queue[rear].pre = front;
                    Queue[rear].step = 2;
                    ++nCount;
                }
            }
            a = va;
            b = curb;
            if (!IsExit(a, b))
            {
                Queue[++rear].a = a;
                Queue[rear].b = b;
                Queue[rear].pre = front;
                Queue[rear].step = 0;
                ++nCount;
            }
            if (curb > 0)
            {
                if (cura + curb > va)
                {
                    a = va;
                    b = cura + curb - va;
                    if (!IsExit(a, b))
                    {
                        Queue[++rear].a = a;
                        Queue[rear].b = b;
                        Queue[rear].pre = front;
                        Queue[rear].step = 5;
                        ++nCount;
                    }
                }
                else
                {
                    a = cura + curb;
                    b = 0;
                    if (!IsExit(a, b))
                    {
                        Queue[++rear].a = a;
                        Queue[rear].b = b;
                        Queue[rear].pre = front;
                        Queue[rear].step = 5;
                        ++nCount;
                    }
                }
                a = cura;
                b = 0;
                if (!IsExit(a, b))
                {
                    Queue[++rear].a = a;
                    Queue[rear].b = b;
                    Queue[rear].pre = front;
                    Queue[rear].step = 3;
                    ++nCount;
                }
            }
            a = cura;
            b = vb;
            if (!IsExit(a, b))
            {
                Queue[++rear].a = a;
                Queue[rear].b = b;
                Queue[rear].pre = front;
                Queue[rear].step = 1;
                ++nCount;
            }
        }
    }
    
    int main()
    {
        int va, vb, result;
        while(scanf("%d%d%d", &va, &vb, &result) != EOF)
        {
            nCount = -1;
            memset(Queue, 0, sizeof(Queue));
            BFS(va, vb, result);
        }
        return 0;
    }
  • 相关阅读:
    基于windows的mysql读写分离和amoeba配置
    windows环境下mysql主从配置
    Mysql主从报错锦集
    Nginx流控
    windows_windows下的rsync
    Kafka+ZooKeeper高可用集群部署
    通过Nginx、Consul、Upsync实现动态负载均衡和服务平滑发布
    Redis性能指标监控
    MongoDB用户权限管理
    ZooKeeper原理详解及常用操作
  • 原文地址:https://www.cnblogs.com/lzmfywz/p/3201623.html
Copyright © 2011-2022 走看看