开放原子开发者工作坊

题目连接

http://acm.hdu.edu.cn/showproblem.php?pid=1195

Open the Lock

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

简单的广索题。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
using std::cin;
using std::cout;
using std::endl;
using std::swap;
using std::sort;
using std::map;
using std::pair;
using std::queue;
using std::vector;
using std::multimap;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) decltype((c).begin())
#define cls(arr,val) memset(arr,val,sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
const int N = 10010;
typedef unsigned long long ull;
bool vis[N];
int start, end;
struct Node {
    int v, s;
    Node(int i = 0, int j = 0) :v(i), s(j) {}
};
inline void calc_1(int *arr, int v) {
    int i, t, j = 0;
    do arr[j++] = v % 10; while (v /= 10);
    for (i = 0, --j; i < j; i++, j--) {
        t = arr[i];
        arr[i] = arr[j];
        arr[j] = t;
    }
}
inline int calc_2(int *arr) {
    int sum = 0;
    rep(i, 4) sum = sum * 10 + arr[i];
    return sum;
}
inline void calc_3(queue<Node> &q, int k, int s) {
    if (!vis[k]) {
        q.push(Node(k, s + 1));
        vis[k] = true;
    }
}
int bfs() {
    int v, k, tmp[10];
    cls(vis, false);
    queue<Node> q;
    q.push(Node(start, 0));
    vis[start] = true;
    while (!q.empty()) {
        Node t = q.front(); q.pop();
        if (t.v == end) return t.s;
        calc_1(tmp, t.v);
        rep(i, 4) {
            v = tmp[i];
            if (v + 1 == 10) tmp[i] = 1;
            else tmp[i] = v + 1;
            k = calc_2(tmp);
            calc_3(q, k, t.s);
            tmp[i] = v;
            if (v - 1 == 0) tmp[i] = 9;
            else tmp[i] = v - 1;
            k = calc_2(tmp);
            calc_3(q, k, t.s);
            tmp[i] = v;
        }
        rep(i, 3) {
            calc_1(tmp, t.v);
            swap(tmp[i], tmp[i + 1]);
            k = calc_2(tmp);
            calc_3(q, k, t.s);
        }
    }
    return 0;
}
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%d %d", &start, &end);
        printf("%d\n", bfs());
    }
    return 0;
}