非常可乐-BFS

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;
const int MX = 105;
int s, m, n, vis[MX][MX];
struct Node{
    int x, y, s, step;
};
int bfs()
{
    queue<Node> q;
    Node now;
    now.x = 0;
    now.y = 0;
    now.s = s;
    now.step = 0;
    q.push(now);
    vis[m][n] = 1;
    while(!q.empty())
    {
        now = q.front();
        Node node;
        q.pop();
        if(now.x == s / 2 && now.s == s / 2)
        {
            return now.step;
        }
        if(now.s != 0 && now.x != m)
        {
            int x = m - now.x;
            if(now.s >= x)
            {
                node.s = now.s - x;
                node.x = m;
            }
            else
            {
                node.s = 0;
                node.x = now.x + now.s;
            }
            node.y = now.y;
            node.step = now.step + 1;
            if(vis[node.x][node.y] == 0)
            {
                vis[node.x][node.y] = 1;
                q.push(node);
            }
        }
        if(now.s != 0 && now.y != n)
        {
            int x = n - now.y;
            if(now.s >= x)
            {
                node.s = now.s - x;
                node.y = n;
            }
            else
            {
                node.s = 0;
                node.y = now.y + now.s;
            }
            node.x = now.x;
            node.step = now.step + 1;
            if(vis[node.x][node.y] == 0)
            {
                vis[node.x][node.y] = 1;
                q.push(node);
            }
        }
        if(now.x != 0 && now.s != s)
        {
            int x = s - now.s;
            if(now.x >= x)
            {
                node.x = now.x - x;
                node.s = s;
            }
            else
            {
                node.x = 0;
                node.s = now.s + now.x;
            }
            node.y = now.y;
            node.step = now.step + 1;
            if(vis[node.x][node.y] == 0)
            {
                vis[node.x][node.y] = 1;
                q.push(node);
            }
        }
        if(now.x != 0 && now.y != n)
        {
            int x = n - now.y;
            if(now.x >= x)
            {
                node.x = now.x - x;
                node.y = n;
            }
            else
            {
                node.x = 0;
                node.y = now.y + now.x;
            }
            node.s = now.s;
            node.step = now.step + 1;
            if(vis[node.x][node.y] == 0)
            {
                vis[node.x][node.y] = 1;
                q.push(node);
            }
        }
        if(now.y != 0 && now.s != s)
        {
            int x = s - now.s;
            if(now.y >= x)
            {
                node.y = now.y - x;
                node.s = s;
            }
            else
            {
                node.y = 0;
                node.s = now.s + now.y;
            }
            node.x = now.x;
            node.step = now.step + 1;
            if(vis[node.x][node.y] == 0)
            {
                vis[node.x][node.y] = 1;
                q.push(node);
            }
        }
        if(now.y != 0 && now.x != m)
        {
            int x = m - now.x;
            if(now.y >= x)
            {
                node.y = now.y - x;
                node.x = m;
            }
            else
            {
                node.y = 0;
                node.x = now.x + now.y;
            }
            node.s = now.s;
            node.step = now.step + 1;
            if(vis[node.x][node.y] == 0)
            {
                vis[node.x][node.y] = 1;
                q.push(node);
            }
        }
    }
    return -1;
}
int main()
{
    while(scanf("%d%d%d", &s, &m, &n) != EOF && (s + m + n))
    {
        memset(vis, 0, sizeof(vis));
        if(s & 1)
        {
            printf("NO\n");
            continue;
        }
        if(m < n)
            swap(m, n);
        int x = bfs();
        if(x != -1)
            printf("%d\n", x);
        else
            printf("NO\n");
    }
    return 0;
}