poj 3414 pots (bfs+路径记录)

Mon, 27 Jul 2015 08:44:00 +0000

好爽,一遍ac

 1
 2
/*************************************************************************
> File Name: code/2015summer/searching/H.cpp
> Author: 111qqz
> Email: rkz2013@126.com
> Created Time: 2015年07月27日 星期一 09时11分28秒
************************************************************************/
 9
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<stack>
#define y0 abc111qqz
#define y1 hust111qqz
#define yn hez111qqz
#define j1 cute111qqz
#define tm crazy111qqz
#define lr dying111qqz
using namespace std;
#define REP(i, n) for (int i=0;i<int(n);++i)
typedef long long LL;
typedef unsigned long long ULL;
const int N=1E2+5;
int A,B,C;
int d[N][N];
bool flag;
struct node
{
int d,opt,par,prea,preb;
}q[N][N];
 40
void print(int x,int y)
{
// cout<<"x:"<<x<<"y:"<<y<<endl;
if (q[x][y].prea!=-1&&q[x][y].preb!=-1)
{
// 	 cout<<"who is 111qqz"<<endl;
 print(q[x][y].prea,q[x][y].preb);
 if (q[x][y].opt==1){
	printf("FILL(%d)\n",q[x][y].par);
 }
 if (q[x][y].opt==2)
 {
	printf("DROP(%d)\n",q[x][y].par);
 }
 if (q[x][y].opt==3)
 {
	printf("POUR(%d,%d)\n",q[x][y].par,3-q[x][y].par);
 }
}
 60
}
void bfs()
{
memset(q,-1,sizeof(q));
queue<int>a;
queue<int>b;
a.push(0);
b.push(0);
q[0][0].d=0;
while (!a.empty()&&!b.empty())
{
 int av = a.front();a.pop();
 int bv = b.front();b.pop();
// 	 cout<<"av:"<<av<<"bv:"<<bv<<endl;
 if (av==C||bv==C)
 {
	flag = true;
	//cout<<"yeah~~~~~~~~~~~~~~~"<<endl;
	cout<<q[av][bv].d<<endl;
// 		cout<<"prea:"<<q[av][bv].prea<<"preb:"<<q[av][bv].preb<<endl;
	print(av,bv);
 	return;
 }
 if (av<A&&q[A][bv].d==-1)
 {
	q[A][bv].d=q[av][bv].d+1;
	q[A][bv].opt=1;
	q[A][bv].par=1;
	q[A][bv].prea=av;
	q[A][bv].preb=bv;
	a.push(A);
	b.push(bv);
 }
 if (av>0&&q[0][bv].d==-1)
 {
	q[0][bv].d=q[av][bv].d+1;
	q[0][bv].opt=2;
	q[0][bv].par=1;
	q[0][bv].prea=av;
	q[0][bv].preb=bv;
	a.push(0);
	b.push(bv);
103
 }
 if (bv<B&&q[av][B].d==-1)
 {
	q[av][B].d=q[av][bv].d+1;
	q[av][B].opt=1;
	q[av][B].par=2;
	q[av][B].prea = av;
	q[av][B].preb = bv;
	a.push(av);
	b.push(B);
114
 }
 if (bv>0&&q[av][0].d==-1)
 {
	q[av][0].d=q[av][bv].d+1;
	q[av][0].opt=2;
	q[av][0].par=2;
	q[av][0].prea=av;
	q[av][0].preb=bv;
	a.push(av);
	b.push(0);
 }
126
 if (av+bv<=B&&q[0][av+bv].d==-1)
 {
	q[0][av+bv].d=q[av][bv].d+1;
	q[0][av+bv].opt=3;
	q[0][av+bv].par=1;
	q[0][av+bv].prea=av;
	q[0][av+bv].preb=bv;
	a.push(0);
	b.push(av+bv);
 }
 if (av+bv>B&&q[av-(B-bv)][B].d==-1) //把1往2里倒入的两种情况
 {
139
	int tmp = av-(B-bv);
	q[tmp][B].d=q[av][bv].d+1;
	q[tmp][B].opt=3;
	q[tmp][B].par=1;
	q[tmp][B].prea=av;
	q[tmp][B].preb=bv;
	a.push(tmp);
	b.push(B);
 }
149
 if (bv+av<=A&&q[av+bv][0].d==-1)
 {
	q[av+bv][0].d=q[av][bv].d+1;
	q[av+bv][0].opt=3;
	q[av+bv][0].par=2;
	q[av+bv][0].prea=av;
	q[av+bv][0].preb=bv;
	a.push(av+bv);
	b.push(0);
 }
 if (bv+av>A&&q[A][bv-(A-av)].d==-1)
 {
	int tmp = bv-(A-av);
	q[A][tmp].d=q[av][bv].d+1;
	q[A][tmp].opt=3;
	q[A][tmp].par=2;
	q[A][tmp].prea=av;
	q[A][tmp].preb=bv;
	a.push(A);
	b.push(tmp);
 }
}
}
int main()
{
175
flag = false;
cin>>A>>B>>C;
bfs();
if (!flag)
{
 cout<<"impossible"<<endl;
}
183
184
return 0;
}

poj 3984 迷宫问题

Sat, 25 Jul 2015 05:53:00 +0000

迷宫问题

 1
 2
 3
/*************************************************************************
> File Name: code/2015summer/searching/KK.cpp
> Author: 111qqz
> Email: rkz2013@126.com
> Created Time: 2015年07月25日 星期六 13时33分00秒
************************************************************************/
10
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<stack>
#define y0 abc111qqz
#define y1 hust111qqz
#define yn hez111qqz
#define j1 cute111qqz
#define tm crazy111qqz
#define lr dying111qqz
using namespace std;
#define REP(i, n) for (int i=0;i<int(n);++i)
typedef long long LL;
typedef unsigned long long ULL;
int a[10][10];
int head = 0;
int tail = 1;
int dirx[2]={1,0};
int diry[2]={0,1};
struct node
{
int x,y,pre;
}q[10];
42
void print(int x)
{
if (q[x].pre!=-1)
{
 print(q[x].pre);
 printf("(%d, %d)\n",q[x].x,q[x].y);
}
}
void bfs()
{
q[head].x=0;
q[head].y=0;
q[head].pre=-1;
while (head<tail)
{
 if (q[head].x==4&&q[head].y==4)
 {
	print(head);
	return;
 }
 for (int i = 0 ; i < 2 ; i++ )
 {
	int newx=dirx[i]+q[head].x;
	int newy=diry[i]+q[head].y;
	if (newx>=0&&newx<5&&newy>=0&&newy<5&&a[newx][newy]==0)
	{
	 q[tail].x=newx;
	 q[tail].y=newy;
	 q[tail].pre=head;
	 tail++;
	}
 }
 head++;
}
77
}
int main()
{
for ( int i = 0 ; i < 5 ; i++ )
{
 for ( int j = 0 ; j < 5; j++)
 {
	cin>>a[i][j];
 }
}
printf("(0, 0)\n");
bfs();
90
return 0;
}

路径记录 on 111qqz's blog

poj 3414 pots (bfs+路径记录)

poj 3984 迷宫问题