上海高校金马五校赛 C 序列变换【全排列】

链接：https://www.nowcoder.com/acm/contest/91/C
来源：牛客网

时间限制：C/C++ 2秒，其他语言4秒
空间限制：C/C++ 131072K，其他语言262144K
64bit IO Format: %lld
题目描述
给定两个长度为n的序列，ai, bi(1<=i<=n), 通过3种魔法使得序列a变换为序列b，也就是ai=bi(1<=i<=n).

魔法1： 交换ai和aj，i!=j

首先通过若干次的魔法1将序列a变换成序列c

魔法2： 对1个数乘2或者加1

魔法3： 对1个数除以2或者减1，如果是奇数，则不能除以2

若ci>bi, 则只能对ci实施魔法3，若ci

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<string>
#include<map>
#include<queue>
#include<vector>
using namespace std;
#define ll long long int
#define INF 0x3f3f3f3f
#define Irish_Moonshine main
const int maxn = 1e6 + 2333;
int T, n;
int a[maxn], b[maxn];
int cost[20][20];
int p[maxn];
int u[maxn];
int f[maxn];

int work(int x, int y) {
    if (x == y) return 0;
    if (x < y) swap(x, y);
    int sum = 0;
    while (1) {
        if (x % 2 == 0) {
            if (x / 2 >= y) sum++, x = x / 2;
            else return sum + x - y;
        }
        else {
            if (x == y) return sum;
            else sum++, x--;
        }
    }
    return sum;
}
int get() {
    int sum = 0;
    for (int i = 1; i <= n; i++) {
        u[i] = p[i];
    }
    for (int i = 1; i <= n; i++) {
        if (u[i] == i) continue;
        sum++;
        for (int j = i + 1; j <= n; j++) {
            if (u[j] == i) {
                swap(u[i], u[j]);
                break;
            }
        }
    }
    return sum;
}
int Irish_Moonshine()
{
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
        }
        for (int i = 1; i <= n; i++) {
            scanf("%d", &b[i]);
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                cost[i][j] = work(a[i], b[j]);
                //cout << a[i] << " -> " << b[j] << " : " << cost[i][j] << endl;
            }
        }
        for (int i = 1; i <= n; i++) {
            p[i] = i;
        }
        int ans = 2e9;
        do {
            int tmp = get();
            for (int i = 1; i <= n; i++) {
                tmp = tmp + cost[p[i]][i];
            }
            ans = min(ans, tmp);
        } while (next_permutation(p + 1, p + 1 + n));
        printf("%d\n", ans);
    }
    return 0;
}
//_CRT_SECURE_NO_WARNINGS