uva10603

题目大意：
给定三个水杯的容量和所要达到的目标水量，或者找不到目标水量就一直递减到找到。最后输出你最少需要倒到别的杯子的水量是多少。

思路：
自己的代码TLE了，如下。
使用Bfs，还需要用到vis的二维数组进行判重，用两层for,如果i的杯子中有水的话且j的杯子中还没有满就倒入j的杯子中然后更新杯子的状态，否则不倒入。

代码：

include

include

include

include

include

using namespace std;

define MAXN 210

const int INF = 0x3f3f3f3f;

struct node
{
int v[3];
int mincost;
};

int ans, d;
bool vis[MAXN][MAXN];
int jugs[3];
node p, q;
queue Q;

void init()
{
ans = INF;
while(!Q.empty()) Q.pop();
memset(vis, 0, sizeof(vis));
}

void bfs()
{
init();
p.v[0] = 0, p.v[1] = 0, p.v[2] = jugs[2], p.mincost = 0;
vis[0][0] = 1;
Q.push(p);
while(!Q.empty())
{
p = Q.front();
Q.pop();
for(int i = 0; i < 3; i++)
{
if(p.v[i] == d)
{
ans = min(ans, p.mincost);
break;
}
else for(int j = 0; j < 3; j++) if(i != j) //自己不能倒给自己
{
q = p;
if(p.v[i] && jugs[j] > p.v[j]) //满足条件
{
int m = min(p.v[i], jugs[j]-p.v[j]);
// printf(“%d “,m);
q.mincost += m;
q.v[i] -= m;
q.v[j] += m; //更新
if(!vis[q.v[0]][q.v[1]]) //判重
{
vis[q.v[0]][q.v[1]] = 1;
Q.push(q);
}
}
}
}
}
}
int main()
{
int T;
scanf(“%d”, &T);
while(T–)
{
scanf(“%d%d%d%d”, &jugs[0], &jugs[1], &jugs[2], &d);
bfs();
if(ans == INF)
{
for(;;)
{
d–;
bfs();
if(ans != INF) break;
} //枚举每一个可能的值
}
printf(“%d %d\n”, ans, d);
}
return 0;
}

别人AC代码：
思路：
用一个reach数组去保存每达到一个数最少需要倒的水量。

#include<iostream>
#include<queue>
#include<string.h>
using namespace std;

const int N = 200 + 5;
struct state {
    int water[3];
    int sum;
}st,st1;

queue<state> q;
int tar;
int vis[N][N];
int reach[N];
int w[3];

void init() {
    while(!q.empty())
        q.pop();
    for (int i = 0 ; i < N ;i++) {
        for (int j = 0 ; j < N ; j++) {
            vis[i][j] = 0;
        }
        reach[i] = -1;
    }
}
state cmp (state st1 ,int k) {
    if(reach[st1.water[k]] < 0)
        reach[st1.water[k]] = st1.sum;
    else 
        reach[st1.water[k]] = reach[st1.water[k]] < st1.sum ? reach[st1.water[k]] : st1.sum;
}
void bfs() {
    //  init();
    while(!q.empty())
        q.pop();
    memset(vis , 0 ,sizeof(vis));
    memset(reach ,-1 ,sizeof(reach));
    st.water[0] = 0;
    st.water[1] = 0;
    st.water[2] = w[2];
    st.sum = 0;
    q.push(st);
    reach[0] = reach[st.water[2]] = 0;
    vis[0][0] = 1;
    while (!q.empty()) {
        st = q.front();
        q.pop();
        for (int i = 0 ;i < 3 ;i++) {
            for (int j = 0 ; j < 3 ;j++) {
                if (i == j)
                    continue;
                st1 = st;
                int m = w[j] - st.water[j] < st.water[i] ? w[j] - st.water[j] : st.water[i] ;
                st1.water[i] -= m;
                st1.water[j] += m;

                while(!vis[st1.water[0]][st1.water[1]] || reach[st1.water[0]] > (st.sum + m) || reach[st1.water[1]] > (st.sum + m) || reach[st1.water[2]] > (st.sum + m))
                {
                    vis[st1.water[0]][st1.water[1]] = 1;
                    st1.sum = st.sum + m;
                    for (int k = 0; k < 3;k++) {
                        cmp(st1,k);
                    }
                    q.push(st1);
                }
            }
        }

    }
}
int main () {
    int T ;
    cin >> T;
    while (T--) {
        cin >> w[0] >> w[1] >> w[2] >>tar;
        bfs();
        for (int i = tar ; i >= 0 ;i--) {
            if(reach[i] >= 0) {
                cout << reach[i] <<" " << i <<endl;
                break;
            }

        }
    }
    return 0;
}