HDU-1495-非常可乐

这个题是BFS题，只要注意相应倾倒的策略即可，剩下的就是细节。

唉~因为几个策略代码比较类似，我直接复制，结果导致忘了将n改为m，WA了N久~悲剧

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
const int inf=1<<28;
struct node
{
    int res;
    int a;
    int b;
    int ans;
};
int s,n,m,ans;
bool vis[500][500];
queue<node> q;
void BFS()
{
    memset(vis,0,sizeof(vis));
    q.push((node){s,0,0,0});
    vis[0][0]=1;
    while(!q.empty())
    {
	node v=q.front();
	if(v.a==s/2&&v.b==s/2||v.b==s/2&&v.res==s/2||v.a==s/2&&v.res==s/2)
	{
	    ans=v.ans;
	    while(!q.empty())
		q.pop();
	    return;
	}
	q.pop();
	if(v.a<n)
	{
	    if(n-v.a>=v.res&&!vis[v.a+v.res][v.b])
	    {
		q.push((node){0,v.a+v.res,v.b,v.ans+1});
		vis[v.a+v.res][v.b]=1;
	    }
	    if(n-v.a<v.res&&!vis[n][v.b])
	    {
		q.push((node){v.res-(n-v.a),n,v.b,v.ans+1});
		vis[n][v.b]=1;
	    }
	    if(n-v.a>=v.b&&!vis[v.a+v.b][0])
	    {
		q.push((node){v.res,v.a+v.b,0,v.ans+1});
		vis[v.a+v.b][0]=1;
	    }
	    if(n-v.a<v.b&&!vis[n][v.b-(n-v.a)])
	    {
		q.push((node){v.res,n,v.b-(n-v.a),v.ans+1});
		vis[n][v.b-(n-v.a)]=1;
	    }
	}
	if(v.b<m)
	{
	    if(m-v.b>=v.res&&!vis[v.a][v.b+v.res])
	    {
		q.push((node){0,v.a,v.b+v.res,v.ans+1});
		vis[v.a][v.b+v.res]=1;
	    }
	    if(m-v.b<v.res&&!vis[v.a][m])
	    {
		q.push((node){v.res-(m-v.b),v.a,m,v.ans+1});
		vis[v.a][m]=1;
	    }
	    if(m-v.b>=v.a&&!vis[0][v.b+v.a])
	    {
		q.push((node){v.res,0,v.a+v.b,v.ans+1});
		vis[0][v.a+v.b]=1;
	    }
	    if(m-v.b<v.a&&!vis[v.a-(m-v.b)][m])
	    {
		q.push((node){v.res,v.a-(m-v.b),m,v.ans+1});
		vis[v.a-(m-v.b)][m]=1;
	    }
	}
	if(v.res<s)
	{
	    if(s-v.res>=v.a&&!vis[0][v.b])
	    {
		q.push((node){v.res+v.a,0,v.b,v.ans+1});
		vis[0][v.b]=1;
	    }
	    if(s-v.res<v.a&&!vis[v.a-(s-v.res)][v.b])
	    {
		q.push((node){s,v.a-(s-v.res),v.b,v.ans+1});
		vis[v.a-(s-v.res)][v.b]=1;
	    }
	    if(s-v.res>=v.b&&!vis[v.a][0])
	    {
		q.push((node){v.res+v.b,v.a,0,v.ans+1});
		vis[v.a][0]=1;
	    }
	    if(s-v.res<v.b&&!vis[v.a][v.b-(s-v.res)])
	    {
		q.push((node){s,v.a,v.b-(s-v.res),v.ans+1});
		vis[v.a][v.b-(s-v.res)]=1;
	    }
	}
    }
}
int main()
{
    while(scanf("%d%d%d",&s,&n,&m)&&(s+m+n))
    {
	ans=inf;
	if(s&1)
	{
	    printf("NO\n");
	    continue;
	}
	BFS();
	if(ans==inf)
	    printf("NO\n");
	else
	    printf("%d\n",ans);
    }
    return 0;
}