#1187927 (C++23(gcc16)) No.3334 I hate Image Convolution

• 問題: No.3334 I hate Image Convolution
• ユーザー: twins_fuyu
• 提出日時: 2026-09-19 09:48:21
• 言語: C++23(gcc16) (gcc 16.1.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 95 ms / 3,000 ms
• コード長: 3,878 bytes
• コンパイル時間: 3,747 ms
• コンパイル使用メモリ: 306,756 KB
• 実行使用メモリ: 11,136 KB
• 最終ジャッジ日時: 2026-09-19 09:48:51
• 合計ジャッジ時間: 14,833 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_0

ファイルパターン	結果
sample	AC * 1
other	AC * 56

ソースコード

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <cstdint>
#include <queue>
#include <tuple>
#include <cassert>
#include <atcoder/all>
#include <iomanip>
#include <cmath>
#include <cstring>
using namespace std;
using ll = int64_t; using ull = uint64_t;
using vl = vector<ll>; using vvl = vector<vl>;using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>;using vvvb = vector<vvb>;
using vs = vector<string>; using vvs=vector<vector<string>>;
using pl = pair<ll,ll>; using vpl = vector<pl>;using vvpl = vector<vpl>;
using tl = tuple<ll,ll,ll>; using vtl = vector<tl>;using vvtl = vector<vector<tl>>;
using sl = set<ll>; using vsl = vector<sl>; using vvsl = vector<vsl>;
using ml = map<ll,ll>; using vml = vector<ml>; using vvml = vector<vml>;
using usl = unordered_set<ll>; using vusl = vector<usl>; using vvusl = vector<vusl>;
using uml = unordered_map<ll,ll>; using vuml = vector<uml>; using vvuml = vector<vuml>;
using mint = atcoder::modint998244353; 
using vm = vector<mint>; using vvm = vector<vector<mint>>; using vvvm = vector<vvm>;
#define rep1(a) for (ll _ = 0; _ < ll(a); ++_)
#define rep2(i, a) for (ll i = 0; i < ll(a); ++i)
#define rep3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define rrep1(a) for (ll i = (a)-1; i >= ll(0); --i)
#define rrep2(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define rrep3(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define overload3(a, b, c, d, ...) d
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) overload3(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define in(i,vec) for (auto i:(vec))
#define siz(a) ll(a.size())
void YesNo(bool a){cout<<(a?"Yes\n":"No\n");}
template<class T> using pqueue = priority_queue<T, vector<T>>;//大きい順
template<class T> using pqueue_g = priority_queue<T, vector<T>, greater<T>>;//小さい順
template<class T> bool chmin(T& x, T y){if(x>y){x=y;return true;}else return false;}
template<class T> bool chmax(T& x, T y){if(x<y){x=y;return true;}else return false;}
template<class T> void sor(vector<T>& v){sort(v.begin(),v.end());}
template<class T> void sor_g(vector<T>& v){sort(v.begin(),v.end(),greater<>());}
template<class T> void vin(vector<T>& v){size_t N = v.size();for(size_t i=0;i<N;++i)cin>>v[i];}
template<class T> void vvin(vector<vector<T>>& v){size_t N=v.size(),M=v[0].size();for(size_t i=0;i<N;++i)for(size_t j=0;j<M;++j)cin>>v[i][j];}
template<class T> T max(const vector<T>& v){return *max_element(v.begin(),v.end());}
template<class T> T min(const vector<T>& v){return *min_element(v.begin(),v.end());}
pair<int,int> d1{1,0},d2{0,1},d3{-1,0},d4{0,-1},d5{1,1},d6{-1,1},d7{1,-1},d8{-1,-1};
ll inf = 1e18;
int infi = 1e9;

void solve(){
    ll N; cin>>N;
    vvl B(N,vl(N,0));

    vl C((N-1)*(N-1)); vin(C);sor_g(C);

    rep(i,N-1)rep(j,N-1)B[i][j]=C[i*(N-1)+j];

    rrep(i,N-1)rrep(j,N-1){
        B[i][j] -= B[i][j+1]+B[i+1][j]+B[i+1][j+1];
    }

    rep(10){
        rep(i,N){
            ll mx1 = 0, mx2=0;
            rep(j,N){
                ll b = B[i][j]; 
                if(j%2==0)chmax(mx1,-b);
                else chmax(mx2,-b);
            }
            ll add = mx1>0 ? mx1 : -mx2;
            rep(j,N){
                B[i][j] += (j%2==0 ? add : -add);
            }
        }

        rep(i,N){
            ll mx1 = 0, mx2=0;
            rep(j,N){
                ll b = B[j][i]; 
                if(j%2==0)chmax(mx1,-b);
                else chmax(mx2,-b);
            }
            ll add = mx1>0 ? mx1 : -mx2;
            rep(j,N){
                B[j][i] += (j%2==0 ? add : -add);
            }
        }
    }

    rep(i,N)rep(j,N)cout<<B[i][j]<<(j+1==N?"\n":" ");
}

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

    ll T; cin>>T;
    rep(T)solve();
}