CF—构造序列

#include <bits/stdc++.h>
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
using namespace std;
constexpr int N = 2e5 + 10, INF = 2e9;
#define x first
#define y second
typedef pair<int, int> pii;
pii pre[N];
int a[N];
int st[N];
int b[N];
int temp[N];
int p[N];
int q[N];
bool vis[N];
bool cmp(pii a, pii b)
{
    return a.first > b.first;
}
void solve()
{
    memset(st, 0, sizeof st);
    int n;
    cin >> n;
    bool flag = true;
    vector<int> vi; // 统计没访问过的
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        p[i] = q[i] = 0;
        vis[i] = 0;
        st[a[i]]++;
        if (st[a[i]] >= 2)
        {
            if (st[1] == 2)
            {
                flag = false;
            }
            if (st[a[i]] > 2)
            {
                flag = false;
            }
        }
        pre[i] = {a[i], i};
        temp[i] = a[i];
    }
    if (flag == false) // 1出现两次,或者一个数出现两次以上;
    {
        NO;
        return;
    }
    sort(temp + 1, temp + n + 1);
    for (int i = 1; i <= n; i++)
    {
        if (temp[i] < i)
        {
            NO;
            return;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (st[i] == 0)
        {
            vi.push_back(i);
        }
    }
    YES;
    sort(vi.begin(), vi.end(), greater<int>());
    int l = 0, r = 0;
    sort(pre + 1, pre + n + 1, cmp);
    for (int i = 1; i <= n; i++)
    {
        int x = pre[i].x, id = pre[i].y;
        if (st[x] == 1)
        {
            p[id] = x;
            q[id] = x;
            continue;
        }
        if (!vis[x])
        {
            p[id] = x;
            vis[x] = true;
        }
        else
        {
            q[id] = x;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        int x = pre[i].x, id = pre[i].y;
        if (p[id] == 0)
        {
            p[id] = vi[l++];
        }
        if (q[id] == 0)
        {
            q[id] = vi[r++];
        }
    }
    for (int i = 1; i <= n; i++)
    {
        cout << p[i] << ' ';
    }
    cout << endl;
    for (int i = 1; i <= n; i++)
    {
        cout << q[i] << ' ';
    }
    cout << endl;
}

signed main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}