#1189677 (C++23(gcc16)) No.3724 Domination

• 問題: No.3724 Domination
• ユーザー: yuma220284
• 提出日時: 2026-09-19 22:29:54
• 言語: C++23(gcc16) (gcc 16.1.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 3,756 bytes
• コンパイル時間: 7,357 ms
• コンパイル使用メモリ: 388,960 KB
• 実行使用メモリ: 10,044 KB
• 最終ジャッジ日時: 2026-09-19 22:30:12
• 合計ジャッジ時間: 15,888 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_1

サブタスク	配点	結果
部分点	20 %	AC * 7 WA * 1
満点	80 %	AC * 30 WA * 22
合計	2.5 * 0% = 0 点

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
// #define F first
// #define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}

void Solve() {
    int N;
    cin >> N;
    vector<int> A(N), IA(N), B(N);
    rep(i,0,N) cin >> A[i], A[i]--, IA[A[i]] = i;
    rep(i,0,N) cin >> B[i], B[i]--;
    if (N == 1) {
        cout << 1 << endl;
        return;
    }
    if (N == 2) {
        cout << -1 << endl;
        return;
    }
    vector<vector<int>> ANS(N, vector<int>(N, -1));
    rep(i,0,N) rep(j,0,N) ANS[i][j] = A[i];
    bool check = true;
    rep(i,0,N-1) if (B[i] != B[i+1]) check = false;
    if (check) {
        if (N <= 4) {
            cout << -1 << endl;
            return;
        }
        else {
            int tmp = 0;
            rep(i,0,N) {
                if (A[i] == B[0]) continue;
                ANS[i][tmp] = B[0];
                tmp++;
            }
            rep(i,0,N) {
                if (A[i] == B[0]) continue;
                ANS[i][tmp] = B[0];
                break;
            }
            rep(i,0,N) {
                rep(j,0,N) cout << ANS[i][j]+1 << (j+1==N?'\n':' ');
            }
        }
        return;
    }
    vector<int> C(N,-1);
    vector<bool> used(N,false);
    rep(i,0,N) {
        rep(j,0,N) {
            if (used[j]) continue;
            if (A[j] != B[i]) {
                C[i] = j;
                used[j] = true;
                break;
            }
        }
    }
    if (C.back() == -1) {
        int unused = -1;
        rep(i,0,N) if (!used[i]) unused = i;
        rep(i,0,N) {
            if (B[i] != B.back()) {
                C.back() = C[i];
                C[i] = unused;
            }
        }
    }
    rep(i,0,N) ANS[C[i]][i] = B[i];
    rep(i,0,N) {
        rep(j,0,N) cout << ANS[i][j]+1 << (j+1==N?'\n':' ');
    }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    ll _ = 1;
    cin>>_;
    while(_--){
        Solve();
    }
    return 0;
}