UVa 10603 - Fill

倒水问题，bfs+哈希，需要将每一步的总倒水量全部存起来，最后再排一次序，将小于等于d 的最大的d及其匹配的总到水量输出即可。

代码如下：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>

using namespace std;
const int MAXSIZE = 250003;
const int p1[6] = {2, 2, 1, 1, 0, 0};
const int p2[6] = {0, 1, 0, 2, 1, 2};
int head[MAXSIZE], next[MAXSIZE];
int jug[MAXSIZE][3], dist[MAXSIZE], swater[MAXSIZE];
int vol[3], d, num;
struct ss
{
    int water, vd;
} save[MAXSIZE];
int cmp(const void *a, const void *b)
{
    struct ss *aa = (struct ss*)a;
    struct ss *bb = (struct ss*)b;
    if(aa->vd != bb->vd)
        return aa->vd - bb->vd;
    return bb->water - aa->water;
}
int Hash(int s)
{
    int v = 0;
    v += jug[s][0] * 31;
    v += jug[s][1] * 71;
    v += jug[s][2] * 131;
    return v % MAXSIZE;
}
int insert(int s)
{
    int h = Hash(s);
    int u = head[h];
    while(u)
    {
        if( !memcmp(jug[u], jug[s], sizeof(jug[s])) )
            return 0;
        u = next[u];
    }
    next[s] = head[h];
    head[h] = s;
    return 1;
}
int bfs()
{
    memset(head, 0, sizeof(head));
    int front = 1, rear = 2, pour;
    while(front < rear)
    {
        for(int i=0; i<6; i++)
        {
            int jg1 = jug[front][p1[i]];
            int jg2 = jug[front][p2[i]];
            if(jg1 && jg2 != vol[p2[i]])
            {
                memcpy(jug[rear], jug[front] , sizeof(jug[front]));
                if(jg1 <= vol[p2[i]] - jg2)
                {
                    pour = jg1;
                    jug[rear][p1[i]] = 0;
                    jug[rear][p2[i]] += jg1;
                }
                else
                {
                    pour = vol[p2[i]] - jg2;
                    jug[rear][p1[i]] -= pour;
                    jug[rear][p2[i]] = vol[p2[i]];
                }
                if(insert(rear))
                {
                    dist[rear] = dist[front] + 1;
                    swater[rear] = swater[front] + pour;
                    for(int j=0; j<3; j++)
                    {
                        save[num].water = swater[rear];
                        save[num].vd = jug[rear][j];
                        num++;
                    }
                    ++rear;
                }
            }
        }
        ++front;
    }
    return rear - 1;
}
void print()
{
    int i;
    qsort(save, num, sizeof(save[0]), cmp);//将所有装水量状态存起来，然后按装水量的大小从小到大排一次序，装水量相同的再按总的到水量小大到小排序。
    for(i=num-1; i>=0; i--)
        if(save[i].vd <= d) // 最后找到第一个小于等于d的状态，输出
            break;
    printf("%d %d\n", save[i].water, save[i].vd);
}
int main()
{
#ifdef test
    freopen("sample.txt", "r", stdin);
#endif
    int t;
    scanf("%d", &t);
    swater[1] = 0;
    while(t--)
    {
        num = 0;
        scanf("%d%d%d%d", &vol[0], &vol[1], &vol[2], &d);
        if(vol[2] == d)
        {
            printf("0 %d\n", d);
            continue;
        }
        jug[1][0] = jug[1][1] = 0;
        jug[1][2] = vol[2];
        bfs();
        print();
    }
    return 0;
}