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

• 問題: No.3724 Domination
• ユーザー: i_am_noob
• 提出日時: 2026-11-06 16:23:31
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: TLE
• 実行時間: -
• コード長: 7,007 bytes
• コンパイル時間: 1,077 ms
• コンパイル使用メモリ: 168,672 KB
• 実行使用メモリ: 9,908 KB
• 最終ジャッジ日時: 2026-11-06 16:23:53
• 合計ジャッジ時間: 21,984 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge4_0

サブタスク	配点	結果
部分点	20 %	AC * 8
満点	80 %	AC * 51 TLE * 1
合計	2.5 * 20% = 50 点

ソースコード

// BEGIN: main.cpp
#line 1 "main.cpp"
// BEGIN: default.hpp
#line 1 "default.hpp"
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <array>
#include <cstdint>
#include <bitset>

using namespace std;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

using ll=long long;
using u32=unsigned int;
using u64=unsigned long long;
using i128=__int128;
using u128=unsigned __int128;
using f128=__float128;

using pii=pair<int,int>;
using pll=pair<ll,ll>;

template<typename T> using vc=vector<T>;
template<typename T> using vvc=vc<vc<T>>;
template<typename T> using vvvc=vc<vvc<T>>;

using vi=vc<int>;
using vll=vc<ll>;
using vvi=vc<vi>;
using vvll=vc<vll>;

#define vv(type,name,n,...) \
    vector<vector<type>> name(n,vector<type>(__VA_ARGS__))
#define vvv(type,name,n,m,...) \
    vector<vector<vector<type>>> name(n,vector<vector<type>>(m,vector<type>(__VA_ARGS__)))

template<typename T> using min_heap=priority_queue<T,vector<T>,greater<T>>;
template<typename T> using max_heap=priority_queue<T>;

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))

template<typename T, typename S> constexpr T ifloor(const T a, const S b){return a/b-(a%b&&(a^b)<0);}
template<typename T, typename S> constexpr T iceil(const T a, const S b){return ifloor(a+b-1,b);}

template<typename T>
void sort_unique(vector<T> &vec){
    sort(vec.begin(),vec.end());
    vec.resize(unique(vec.begin(),vec.end())-vec.begin());
}

template<typename T, typename S> constexpr bool chmin(T &a, const S b){if(a>b) return a=b,true; return false;}
template<typename T, typename S> constexpr bool chmax(T &a, const S b){if(a<b) return a=b,true; return false;}

template<typename T, typename S> istream& operator >> (istream& i, pair<T,S> &p){return i >> p.first >> p.second;}
template<typename T, typename S> ostream& operator << (ostream& o, const pair<T,S> &p){return o << p.first << ' ' << p.second;}

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

template<typename T> void print(vector<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(unordered_set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(T && x) {cout << x << "\n";}
template<typename T, typename... S> void print(T && x, S&&... y) {cout << x << ' ';print(y...);}

template<typename T> istream& operator >> (istream& i, vector<T> &vec){for(auto &x: vec) i >> x; return i;}

vvi read_graph(int n, int m, int base=1){
    vvi adj(n);
    for(int i=0,u,v; i<m; ++i){
        cin >> u >> v,u-=base,v-=base;
        adj[u].pb(v),adj[v].pb(u);
    }
    return adj;
}

vvi read_tree(int n, int base=1){return read_graph(n,n-1,base);}

template<typename T, typename S> pair<T,S> operator + (const pair<T,S> &a, const pair<T,S> &b){return {a.first+b.first,a.second+b.second};}

template<typename T> constexpr T inf=0;
template<> constexpr int inf<int> = 0x3f3f3f3f;
template<> constexpr ll inf<ll> = 0x3f3f3f3f3f3f3f3f;

template<typename T> vector<T> operator += (vector<T> &a, int val){for(auto &i: a) i+=val; return a;}

template<typename T> T isqrt(const T &x){T y=sqrt(x+2); while(y*y>x) y--; return y;}

#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())// END: default.hpp
#line 2 "main.cpp"

//#include "mod/modint.hpp"
//using mint=modint<998244353>;
//#include "mod/modint_basic.hpp"

void mango(){
    int n; cin >> n;
    vi r(n),c(n); cin >> r >> c;
    if(n<=4){
        vv(int,res,n,n);
        auto get=[&](vi a){
            vi cnt(n+1);
            for(auto i: a) cnt[i]++;
            int p=max_element(all(cnt))-cnt.begin();
            rep(n+1) if(i!=p&&cnt[i]>=cnt[p]){
                return -1;
            }
            return p;
        };
        bool found=0;
        auto dfs=[&](auto &dfs, int i, int j){
            if(found) return;
            if(i>=n){
                found=1;
                return;
            }
            rep(t,1,n+1){
                if(found) return;
                res[i][j]=t;
                bool fail=0;
                if(j==n-1){
                    if(get(res[i])!=r[i]){
                        fail=1;
                    }
                }
                if(fail) continue;
                if(i==n-1){
                    vi tmp(n);
                    rep(p,n) tmp[p]=res[p][j];
                    if(get(tmp)!=c[j]){
                        fail=1;
                    }
                }
                else if(t!=c[j]){
                    rep(p,i){
                        if(res[p][j]==t){
                            fail=1;
                            break;
                        }
                    }
                }
                if(fail) continue;
                if(j+1==n) dfs(dfs,i+1,0);
                else dfs(dfs,i,j+1);
            }
        };
        dfs(dfs,0,0);
        if(!found){
            print(-1);
            return;
        }
        rep(n){
            rep(j,n) cout << res[i][j] << ' ';
            cout << "\n";
        }
        return;
    }
    vv(int,res,n,n,-1);
    int k=n/2+1;
    rep(n) rep(j,k){
        res[i][(i+j)%n]=r[i];
    }
    rep(n) rep(j,n){
        if(res[i][j]==-1) res[i][j]=c[j];
    }
    rep(n){
        rep(j,n) cout << res[i][j] << ' ';
        cout << "\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cout << fixed << setprecision(20);
    int t=1;
    cin >> t;
    while(t--) mango();
}// END: main.cpp