HDU1195弱智广搜

最新推荐文章于 2018-02-21 19:09:04 发布

原创最新推荐文章于 2018-02-21 19:09:04 发布 · 358 阅读

0 ·

CC 4.0 BY-SA版权

ACM练习同时被 2 个专栏收录

312 篇文章

订阅专栏

搜索

17 篇文章

订阅专栏

本文介绍了一种解决特定类型密码锁问题的算法。该算法使用队列和标记方法来找到打开四数字密码锁所需的最小步骤数。通过递增或递减每个数字，甚至与邻居交换位置来遍历所有可能的状态。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description

Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9.
Each time, you can add or minus 1 to any digit. When add 1 to ‘9’, the digit will change to be ‘1’ and when minus 1 to ‘1’, the digit will change to be ‘9’. You can also exchange the digit with its neighbor. Each action will take one step.

Now your task is to use minimal steps to open the lock.

Note: The leftmost digit is not the neighbor of the rightmost digit.

Input

The input file begins with an integer T, indicating the number of test cases.

Each test case begins with a four digit N, indicating the initial state of the password lock. Then followed a line with anotther four dight M, indicating the password which can open the lock. There is one blank line after each test case.

Output

For each test case, print the minimal steps in one line.

Sample Input

2
1234
2144

1111
9999

Sample Output

2
4

这题其实没啥玩意，就是把四个数字的关键字当成一个标记，对每一个标记有7种操作，操作完就入队…..
并不难….
不过对我这种鶸来说是一种新思想
贴代码

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
struct p
{
    int a, b, c, d;
    int ant;
};
int main()
{
    int n;
    cin >> n;
    while (n--)
    {
        int qqq, www;
        int a[4];
        cin >> qqq >> www;
        a[3] = qqq % 10;
        qqq = qqq / 10;
        a[2] = qqq % 10;
        qqq /= 10;
        a[1] = qqq % 10;
        qqq /= 10;
        a[0] = qqq % 10;
        qqq /= 10;
        int ea, eb, ec, ed;
        ed = www % 10;
        www /= 10;
        ec = www % 10;
        www /= 10;
        eb = www % 10;
        www /= 10;
        ea = www;
        int map[10][10][10][10] = { 0 };
        p start = { a[0],a[1],a[2],a[3] ,0};
        map[start.a][start.b][start.c][start.d] = 1;
        queue<p> q;
        q.push(start);
        while (!q.empty())
        {
            p u = q.front();
            q.pop();
            if (u.a == ea&&u.b == eb&&u.c == ec&&u.d == ed)
            {
                cout << u.ant <<endl;
                break;
            }
            for (int b = -1;b <=1;b++)
            {
                if (u.a + b == 10)
                {
                    if (map[1][u.b][u.c][u.d] == 0)
                    {
                        q.push({ 1, u.b, u.c, u.d,u.ant + 1 });
                        map[1][u.b][u.c][u.d] = 1;
                    }
                }
                else if(u.a + b == 0)
                {
                    if (map[9][u.b][u.c][u.d] == 0)
                    {
                        q.push({ 9, u.b, u.c, u.d,u.ant + 1 });
                        map[9][u.b][u.c][u.d] = 1;
                    }
                }
                else
                {
                    if (map[u.a + b][u.b][u.c][u.d] == 0) 
                    {
                        q.push({ u.a + b, u.b, u.c, u.d,u.ant + 1 }); 
                        map[u.a + b][u.b][u.c][u.d] = 1;
                    }
                }
            }
            for (int b = -1;b <= 1;b++)
            {
                if (u.b + b == 10)
                {
                    if (map[u.a][1][u.c][u.d] == 0)
                    {
                        q.push({ u.a, 1, u.c, u.d,u.ant + 1 });
                        map[u.a][1][u.c][u.d] = 1;
                    }
                }
                else if (u.b + b == 0)
                {
                    if (map[u.a][9][u.c][u.d] == 0)
                    {
                        q.push({ u.a, 9, u.c, u.d,u.ant + 1 });
                        map[u.a][9][u.c][u.d] = 1;
                    }
                }
                else
                {
                    if (map[u.a][u.b + b][u.c][u.d] == 0)
                    {
                        q.push({ u.a , u.b + b, u.c, u.d,u.ant + 1 });
                        map[u.a][u.b + b][u.c][u.d] = 1;
                    }
                }
            }
            for (int b = -1;b <= 1;b++)
            {
                if (u.c + b == 10)
                {
                    if (map[u.a][u.b][1][u.d] == 0)
                    {
                        q.push({ u.a,u.b, 1, u.d,u.ant + 1 });
                        map[u.a][u.b][1][u.d] = 1;
                    }
                }
                else if (u.c + b == 0)
                {
                    if (map[u.a][u.b][9][u.d] == 0)
                    {
                        q.push({ u.a, u.b, 9, u.d,u.ant + 1 });
                        map[u.a][u.b][9][u.d] = 1;
                    }
                }
                else
                {
                    if (map[u.a][u.b][u.c + b][u.d] == 0)
                    {
                        q.push({ u.a , u.b , u.c + b, u.d,u.ant + 1 });
                        map[u.a][u.b][u.c + b][u.d] = 1;
                    }
                }
            }
            for (int b = -1;b <= 1;b++)
            {
                if (u.d + b == 10)
                {
                    if (map[u.a][u.b][u.c][1] == 0)
                    {
                        q.push({ u.a,u.b, u.c, 1,u.ant + 1 });
                        map[u.a][u.b][u.c][1] = 1;
                    }
                }
                else if (u.d + b == 0)
                {
                    if (map[u.a][u.b][u.c][9] == 0)
                    {
                        q.push({ u.a, u.b, u.c, 9,u.ant + 1 });
                        map[u.a][u.b][u.c][9] = 1;
                    }
                }
                else
                {
                    if (map[u.a][u.b][u.c][u.d + b] == 0)
                    {
                        q.push({ u.a , u.b , u.c , u.d + b,u.ant + 1 });
                        map[u.a][u.b][u.c][u.d + b] = 1;
                    }
                }
            }
            if (map[u.b][u.a][u.c][u.d] == 0)
            {
                q.push({ u.b,u.a,u.c,u.d,u.ant + 1 });
                map[u.b][u.a][u.c][u.d] = 1;
            }
            if (map[u.a][u.c][u.b][u.d] == 0)
            {
                q.push({ u.a,u.c,u.b,u.d,u.ant + 1 });
                map[u.a][u.c][u.b][u.d] = 1;
            }
            if (map[u.a][u.b][u.d][u.c] == 0)
            {
                q.push({ u.a,u.b,u.d,u.c,u.ant + 1 });
                map[u.a][u.b][u.d][u.c] = 1;
            }
        }
    }
    return 0;
}