#1188268 (C++17) No.3724 Domination

• 問題: No.3724 Domination
• ユーザー: silv723
• 提出日時: 2026-09-19 13:47:28
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 131 ms / 2,000 ms
• コード長: 4,559 bytes
• コンパイル時間: 4,443 ms
• コンパイル使用メモリ: 344,100 KB
• 実行使用メモリ: 11,392 KB
• 最終ジャッジ日時: 2026-09-19 13:48:14
• 合計ジャッジ時間: 16,582 ms
• ジャッジサーバーID （参考情報）: judge5_0 / judge1_0

サブタスク	配点	結果
部分点	20 %	AC * 8
満点	80 %	AC * 52
合計	2.5 * 100% = 250 点

ソースコード

#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll=long long;
using ld=long double;
using ull=unsigned long long;
using i128 = __int128_t;
#define vs vector<string>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep2(i,n) for(int i=n-1;i>=0;i--)
#define rep3(i,a,b) for(ll i=a;i<=ll(b);i++)
#define rep4(i,a,b) for(ll i=a;i>=ll(b);i--)
#define forv(i,V) for(const auto& i:V)
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define SIZE(x) int(x.size())
constexpr ll mod=998244353;
//constexpr ll mod=1000000007;
#define pi 3.14159265358979323
#define INF32 2147483647
#define INF64 9223372036854775807
#define faster ios::sync_with_stdio(false);std::cin.tie(nullptr)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rev reverse
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvll vector<vector<ll>>
#define prq priority_queue
#define lb lower_bound
#define ub upper_bound
#define popcnt __builtin_popcountll
#define TLE while(true);
#define RE assert(false);
#define MLE vector<vector<vector<long long>>> mle_mle(400,vector<vector<long long>>(1000,vector<long long>(1000)));
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
#define rall(n) (n).rbegin(),(n).rend()
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
template<typename T,typename U>
ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T,typename U>
istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T>
ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>
istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
void scan(){}
template<class Head,class... Tail>
void scan(Head&head,Tail&... tail){cin>>head;scan(tail...);}
template<class T>
void print(const T &t){cout<<t<<'\n';}
template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail){cout<<head<<' ';print(tail...);}
template<class... T>
void fin(const T &... a){print(a...);exit(0);}
ll max(int a,ll b){return max((ll)a,b);}
ll max(ll a,int b){return max((ll)b,a);}
ll min(int a,ll b){return min((ll)a,b);}
ll min(ll a,int b){return min((ll)b,a);}
//a以上b以下の個数
template<typename T>
ll RangeOK(ll a,ll b,vector<T> &v){
  return max(ub(all(v),b)-lb(all(v),a),0);
}
template <typename T>
vector<T> compress(vector<T> &X) {
    vector<T> vals = X;
    sort(vals.begin(), vals.end());
    vals.erase(unique(vals.begin(), vals.end()), vals.end());
    for (int i = 0; i < (int)X.size(); i++) {
        X[i] = lower_bound(vals.begin(), vals.end(), X[i]) - vals.begin();
    }
    return vals;
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
void solve(){
    INT(n);
    vll r(n);
    vll c(n);
    scan(r, c);
    if(n == 1){
        print(1);
        return;
    }
    if(n == 2){
        print(-1);
        return;
    }
    if(n >= 5){
        vvll ans(n, vll(n));
        rep(i, n){
            rep(j, (n+2)/2){
                ans[i][(r[i]-1+j)%n] = r[i];
            }
        }
        rep(i, n){
            rep(j, n){
                if(ans[i][j] == 0) ans[i][j] = c[j];
            }
        }
        rep(i, n) print(ans[i]);
        return;
    }
    vll ind(n);
    rep(i, n) ind[i] = i;
    int isok = 0;
    do{
        isok = 1;
        rep(i, n){
            if(r[i] == c[ind[i]]) isok = 0;
        }
        if(isok == 1) break;
    }while(next_permutation(all(ind)));
    //print(isok, ind);
    if(isok == 1){
        vvll ans(n, vll(n));
        rep(i, n){
            rep(j, n){
                if(j == ind[i]) ans[i][j] = c[j];
                else ans[i][j] = r[i];
            }
            print(ans[i]);
        }
        return;
    }
    print(-1);
}
int main(){
    INT(t);
    //int t = 1;
    while(t--) solve();
}