POJ - 3414 Pots（BFS）

POJ - 3414 Pots（BFS）

#include<iostream>
#include<queue>
using namespace std;
typedef pair<int,int> PII;
string s[105][105], ans;
bool dist[105][105];
int main(){
    int a,b,c;cin>>a>>b>>c;
    queue<PII> q;
    q.push((PII){0,0}); 
	dist[0][0] = 1;
    while(q.size())
	{
    	PII t=q.front(); q.pop();
    	int x=t.first,y=t.second;
        if(x == c || y == c) {ans = s[x][y]; break;}
        string ts=s[x][y];
        if(!dist[a][y]) { s[a][y] = ts + '1'; dist[a][y] = 1;q.push((PII){a, y});}
        if(!dist[x][b]) { s[x][b] = ts + '2'; dist[x][b] = 1;q.push((PII){x, b});}
        if(!dist[0][y]) { s[0][y] = ts + '3'; dist[0][y] = 1;q.push((PII){0, y});}
        if(!dist[x][0]) { s[x][0] = ts + '4'; dist[x][0] = 1;q.push((PII){x, 0});}
        int w = min(x, b - y);
        if(!dist[x - w][y + w]) { s[x - w][y + w] = ts + '5'; dist[x - w][y + w] = 1;q.push((PII){x - w, y + w});}
        w = min(a - x, y);
        if(!dist[x + w][y - w]) { s[x + w][y - w] = ts + '6'; dist[x + w][y - w] = 1;q.push((PII){x + w, y - w});}
    }
    if(ans.size() == 0) cout <<"impossible\n";
    else
	{
        cout << ans.size() << endl;
        for(int i=0;i<(int)ans.size();i++)
		{
            if(ans[i]=='1') cout << "FILL(1)\n";
            if(ans[i]=='2') cout << "FILL(2)\n";
            if(ans[i]=='3') cout << "DROP(1)\n";
            if(ans[i]=='4') cout << "DROP(2)\n";
            if(ans[i]=='5') cout << "POUR(1,2)\n";
            if(ans[i]=='6') cout << "POUR(2,1)\n";
        }
    }
    return 0;
}