题目:http://poj.org/problem?id=3414
两个空罐子A,B,三种操作:FILL(i)将 i 装满水;DROP(i)将i倒空;POUR(i,j)将 i 中水倒入 j 中,直到 i 为空或 j 装满,问通过这三种操作是否能让A或B中的水为C升?
对于每个罐子都有上述三种操作,所以共有6种操作:
1.将A装满
2.将B装满
3.将A倒空
4.将B倒空
5.把A倒入B,直到A为空或B满
6.把B倒入A,直到B为空或A满
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 7;
int a, b, c;
bool flag = false;
int vis[300][300]; // vis[i][j] = 1表示a中有i升水,b中有j升水的状态出现
string op[8] = {"", "FILL(1)", "FILL(2)", "DROP(1)", "DROP(2)", "POUR(1,2)", "POUR(2,1)"}; // 操作
struct node
{
int x, y, step; // a,b杯中水的含量;当前步数
string s; // 记录操作
node(int _x, int _y, int _step, string _s):x(_x), y(_y), step(_step), s(_s){}
};
void bfs()
{
memset(vis, 0, sizeof(vis));
vis[0][0] = 1;
queue<node> q;
q.push(node(0, 0, 0, "0"));
while(!q.empty())
{
node tmp = q.front(); q.pop();
if(tmp.x == c || tmp.y == c)
{
flag = true;
cout << tmp.step ;
for(int i = 0; i < tmp.s.length(); i++)
cout << op[tmp.s[i] - '0'] << endl;
return ;
}
if(tmp.x < a) // a没满,将a装满
if(!vis[a][tmp.y])
vis[a][tmp.y] = 1, q.push(node(a, tmp.y, tmp.step + 1, tmp.s + "1"));
if(tmp.y < b) // 将b装满
if(!vis[tmp.x][b])
vis[tmp.x][b] = 1, q.push(node(tmp.x, b, tmp.step + 1, tmp.s + "2"));
if(tmp.x != 0) // a不为空,将a倒空
if(!vis[0][tmp.y])
vis[0][tmp.y] = 1, q.push(node(0, tmp.y, tmp.step + 1, tmp.s + "3"));
if(tmp.y != 0) // 将b倒空
if(!vis[tmp.x][0])
vis[tmp.x][0] = 1, q.push(node(tmp.x, 0, tmp.step + 1, tmp.s + "4"));
if(tmp.x != 0 && tmp.y < b) // 将a倒入b
{
int nx, ny;
if(tmp.x <= b - tmp.y) // a可全部倒入b
nx = 0, ny = tmp.x + tmp.y;
else
nx = tmp.x + tmp.y - b, ny = b; // b装满,a中有剩余
if(!vis[nx][ny])
vis[nx][ny] = 1, q.push(node(nx, ny, tmp.step + 1, tmp.s + "5"));
}
if(tmp.y != 0 && tmp.x < a) // 将b倒入a
{
int nx, ny;
if(tmp.y <= a - tmp.x) // b可全部倒入a
nx = tmp.x + tmp.y, ny = 0;
else
nx = a, ny = tmp.x + tmp.y - a; // a装满,b中有剩余
if(!vis[nx][ny])
vis[nx][ny] = 1, q.push(node(nx, ny, tmp.step + 1, tmp.s + "6"));
}
}
}
int main()
{
cin >> a >> b >> c;
bfs();
if(!flag) cout << "impossible" << endl;
return 0;
}