题意:给定两个数组a,b给定一个op方法,能够将一个数转化为它的位数值,要求两个数组为相同集合的不同或相同排列数量的op数
思路:看有很多人模拟过了,想来模拟应该也是能过的,但我疯狂wa2,模拟的思路还觉得没问题,思路如下:首先两数组去重,让后将>10的数全部转换为小于10的数,再去一遍重,然后再将所有数op为1(原先为1的不动),此时的操作数即ans,但是wa2,而且是操作数少了,如果有大佬看到了,告诉一下为什么?
所以当开始疯狂wa时就要转换思路,op是将一个不等于1的数在两步以内变为1的操作,简单的想,它不会将一个数变大,因此我们看a,b的数时,从大到小的看,如果ai!=bi,那么大的数是必须要变小的,即必须将较大值op。一想到这,”简单“,大多数人就想到优先队列了,确实,见code
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>
//#define int ll
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 998244353;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int n, m, k;
int a[N], b[N];
bool st[N];
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
inline void init() {}
inline int fun(int x) {
return log10(x) + 1;
}
void slove()
{
priority_queue<int> qa, qb;
cin >> n;
pre(i, 1, n) {
cin >> a[i];
qa.push(a[i]);
}
pre(i, 1, n) {
cin >> b[i];
qb.push(b[i]);
}
int ans = 0;
while(qa.size())
{
int u = qa.top(); qa.pop();
int v = qb.top(); qb.pop();
if (u == v)continue;
if (u > v) {
qa.push(fun(u));
ans++;
qb.push(v);
}else {
qa.push(u);
qb.push(fun(v));
ans++;
}
}
cout << ans << endl;
return;
}
signed main()
{
int _;
si(_);
//_ = 1;
init();
while (_--)
{
slove();
}
return 0;
}