20124330102 【 搜索 -- 深度优先搜索 】 POJ 3414 Pots

Online Judge	Problem Set	Authors	Online Contests	User
Web Board Home Page F.A.Qs Statistical Charts	Problems Submit Problem Online Status Prob.ID:	Register Update your info Authors ranklist	Current Contest Past Contests Scheduled Contests Award Contest	wilson1068 Log Out Mail:0(0) Login Log Archive

3 5 4

6
FILL(2)
POUR(2,1)
DROP(1)
POUR(2,1)
FILL(2)
POUR(2,1)

#include <stdio.h>
#include <string.h>
#include <string>
#include <queue>
using namespace std;
#define MAXN 111
int m[MAXN][MAXN];
int a, b, c;

struct P{
int x, y;
string s;
};

P point(int x, int y, string s){
P ret;
ret.x = x,	ret.y = y,	ret.s = s;
return ret;
}

string bfs(){
queue<P> q;
P k = point(0, 0, ""), t;
memset(m, 0, sizeof(m));
m[k.x][k.y] = 1;
q.push(k);
while( !q.empty() ){
k = q.front();	q.pop();
if( !m[a][k.y] )	m[a][k.y] = 1,	q.push( point(a, k.y, k.s+'a') );
if( !m[k.x][b] )	m[k.x][b] = 1,	q.push( point(k.x, b, k.s+'b') );
if( !m[0][k.y] )	m[0][k.y] = 1,	q.push( point(0, k.y, k.s+'A') );
if( !m[k.x][0] )	m[k.x][0] = 1,	q.push( point(k.x, 0, k.s+'B') );
int kk = k.x+k.y;
int tx = kk < a ? kk : a;
int ty = kk < b ? kk : b;
if( !m[tx][kk-tx] )
if( tx==c || kk-tx==c )	return k.s+'1';
else			m[tx][kk-tx]=1,	q.push( point(tx, kk-tx, k.s+'1') );
if( !m[kk-ty][ty] )
if( kk-ty==c || ty==c )	return k.s+'2';
else			m[kk-ty][ty]=1,	q.push( point(kk-ty, ty, k.s+'2') );
}
return "";
}

int main(){
while( EOF != scanf("%d%d%d", &a, &b, &c) ){
if( !c ){	printf("1\n");	continue;	}
if( a==c ){	printf("1\nFILL(1)");	continue;	}
if( b==c ){	printf("1\nFILL(2)");	continue;	}
string ans = bfs();
if( ans.length() ){
printf("%d\n", ans.length());
for(int i=0; ans[i]; i++){
if( 'a'==ans[i] || 'b'==ans[i] )
printf("FILL(%d)\n", ans[i]-'a'+1);
else if( 'A'==ans[i] || 'B'==ans[i] )
printf("DROP(%d)\n", ans[i]-'A'+1);
else
printf("POUR(%d,%c)\n", '3'-ans[i], ans[i]);
}
}
else	printf("impossible\n");
}
return 0;
}