刚开始还是弄不好各个状态之间怎么转换,e而且也不懂怎么去储存已经遍历过的状态,后来看到了哈希,感觉挺好的,这道题也就是深搜了。。基本的都看得懂
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
typedef struct
{
int cur[3];
int v[3];
int step;
}data;
queue<data> Q;
data begin, end;
//vector<int> vis;
int vis[1000010];
int ok;
int finl(data u, data v)
{
if(u.cur[0]==v.cur[0]&&u.cur[1]==v.cur[1]&&u.cur[2]==v.cur[2])
return 1;
return 0;
}
int hash(data u)
{
return 10000 * u.cur[0] + 100 * u.cur[1] + u.cur[2];
}
int i, j;
int main()
{
int N;
scanf("%d",&N);
while(N--)
{
scanf("%d%d%d", &begin.v[0], &begin.v[1], &begin.v[2]);
begin.cur[0] = begin.v[0];
begin.cur[1] = begin.cur[2] = 0;
begin.step = 0;
scanf("%d%d%d", &end.cur[0], &end.cur[1], &end.cur[2]);
ok = 0;
memset(vis, 0, sizeof(vis));
Q.push(begin);
vis[hash(begin)] = 1;
while(!Q.empty())
{
data u = Q.front();
Q.pop();
if(finl(u, end))
{
printf("%d\n", u.step);
ok = 1;
break;
}
for(i = 0; i <= 2; i++)
for(j = 0; j <= 2; j++)
if(i != j)
{
int min = u.v[j] - u.cur[j];
if(u.cur[i] < min)
min = u.cur[i];
data v = u;
v.cur[i] -= min;
v.cur[j] += min;
v.step = u.step +1;
if( !vis[hash(v)])
{
vis[hash(v)] = 1;
Q.push(v);
}
}
}
if(!ok)
{
printf("-1\n");
}
while(!Q.empty())
{
Q.pop();
}
}
system("pause");
return 0;
}