#1189040 (C++23) No.3724 Domination

• 問題: No.3724 Domination
• ユーザー: yaaya
• 提出日時: 2026-09-19 16:25:17
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 3,686 bytes
• コンパイル時間: 3,572 ms
• コンパイル使用メモリ: 359,640 KB
• 実行使用メモリ: 11,648 KB
• 最終ジャッジ日時: 2026-09-19 16:25:33
• 合計ジャッジ時間: 11,225 ms
• ジャッジサーバーID （参考情報）: judge5_0 / judge3_0

サブタスク	配点	結果
部分点	20 %	AC * 8
満点	80 %	AC * 27 WA * 25
合計	2.5 * 20% = 50 点

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
#define ll long long
#define ull unsigned ll
#define ld long double
#define bl __int128_t
#define fi first
#define se second
#define vel vector<ll>
#define vvel vector<vel>
#define pll pair<ll,ll>
#define vepll vector<pll>
#define vvepll vector<vepll>
#define ves vector<string>
#define vem vector<mint>
#define vvem vector<vem>
#define pmm pair<mint,mint>
#define cleout(i) cout<<fixed<<setprecision(i)
template<class T>using PQ=priority_queue<T,vector<T>,greater<T>>;
//               上  右 下 左
vector<int> di={-1, 0, 1, 0};
vector<int> dj={ 0, 1, 0,-1};

vector<int> dx={ 0, 1, 0,-1};
vector<int> dy={ 1, 0,-1, 0};


vector<int> ddx={ 1, 1, 1, 0, -1, -1, -1, 0 };
vector<int> ddy={ 1, 0, -1, -1, -1, 0, 1, 1 };

ll inf=1000000000000000000;//1e18
// LLONG_MAX

mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count());

void _solve(){
    ll N;
    cin>>N;
    vel r(N);
    vel c(N);
    rep(i,0,N)cin>>r[i];
    rep(i,0,N)cin>>c[i];
    rep(i,0,N)r[i]--;
    vel ir(N);
    rep(i,0,N)ir[r[i]]=i;
    if(*max_element(c.begin(),c.end())==*min_element(c.begin(),c.end())){
        if(N==1){
            cout<<"1\n";
            return ;
        }
        if(N<=4){
            cout<<"-1\n";
            return ;
        }else{
            vvel ans(N,vel(N,-1));
            pll now;
            now={(ir[c[0]-1]+1)%N,0};
            rep(i,0,N){
                if(i+1==N)now.fi++;
                now.fi%=N;
                ans[now.fi][now.se]=c[0]-1;
                now.fi++;
                now.se++;
                now.fi%=N;
                now.se%=N;
            }
            rep(i,0,N){
                if(r[i]==c[0]-1){
                    rep(j,0,N)ans[i][j]=c[0]-1;
                }else{
                    rep(j,0,N){
                        if(ans[i][j]<0){
                            ans[i][j]=r[i];
                        }
                    }
                }
            }
            rep(i,0,N){
                rep(j,0,N)cout<<ans[i][j]+1<<" ";
                cout<<"\n";
            }
            return ;
        }
    }
    rep(j,0,N)c[j]--;
    vvel ans(N,vel(N,-1));
    rep(i,0,N){
        rep(j,0,N){
            if(r[i]==c[j])ans[i][j]=c[j];
        }
    }
    map<ll,ll> ma;
    rrep(i,N,0)ma[c[i]]=i;
    vel v;
    for(auto it=ma.begin();it!=ma.end();it++)v.push_back(it->fi);
    vel ok(N,1);
    rep(i,0,v.size()){
        ans[ir[v[i]]][ma[v[(i+1)%v.size()]]]=v[(i+1)%v.size()];
        ok[ir[v[i]]]=0;
    }
    ll id=0;
    map<ll,vel> cnt;
    rep(i,0,N){
        if(cnt.count(c[i]))cnt[c[i]].push_back(i);
        else cnt[c[i]]={};
    }
    for(auto it=cnt.begin();it!=cnt.end();it++){
        for(ll j:it->se){
            while(ok[id]==0)id++;
            ans[id][j]=it->fi;
        }
    }
    rep(i,0,N){
        rep(j,0,N){
            if(ans[i][j]<0)ans[i][j]=r[i];
        }
    }
    auto check=[&](){
        rep(i,0,N){
            vel cnt(N);
            rep(j,0,N){
                cnt[ans[i][j]]++;
            }
            ll m=*max_element(cnt.begin(),cnt.end());
            rep(j,0,N){
                if(m==cnt[ans[i][j]]&&ans[i][j]!=r[i])return 0;
            }
        }
        return 1;
    };
    if(check()){
        rep(i,0,N){
            rep(j,0,N){
                cout<<ans[i][j]+1<<" ";
            }
            cout<<"\n";
        }
    }else cout<<"-1\n";
}


int main(){
    cin.tie(nullptr);
 	ios_base::sync_with_stdio(false);

    
    ll _;
    bool multitest=1;
    if(multitest)cin>>_;
    else _=1;
    rep(__,0,_){
        _solve();
    }
}