#1168412 (C++23) No.3567 Modulo Grid

• 問題: No.3567 Modulo Grid
• ユーザー: noya2
• 提出日時: 2026-06-06 00:08:59
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 57 ms / 2,000 ms
• コード長: 9,883 bytes
• コンパイル時間: 3,216 ms
• コンパイル使用メモリ: 360,360 KB
• 実行使用メモリ: 32,872 KB
• 最終ジャッジ日時: 2026-06-06 00:09:06
• 合計ジャッジ時間: 6,005 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_0

ファイルパターン	結果
sample	AC * 2
other	AC * 25

ソースコード

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

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){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

void jikken1(){
    int n; in(n);
    set<pii> st;
    rep(b,n) rep(a,b){
        if (b % gcd(a,n) == 0 || a % gcd(b,n) == 0){
            continue;
        }
        out(a,b);
        st.emplace(gcd(n,a),gcd(n,b));
        assert(gcd(n,b) != 1);
        assert(gcd(n,a) != 1);
    }
    out("gcd");
    for (auto [a, b] : st){
        if (a > b) continue;
        out(a,b);
    }
}

void jikken2(){
    int n; in(n);
    rep(b,n) rep(a,b){
        if (gcd(n,b) == 1) continue;
        if (gcd(n,a) == 1) continue;
        if (gcd(a,b) == 1){
            out(a,b);
        }
    }
}

void jikken3(){
    int n; in(n);
    set<pii> st1, st2;
    rep(b,n) rep(a,b){
        if (b % gcd(a,n) == 0 || a % gcd(b,n) == 0){
            continue;
        }
        int ga = gcd(n,a);
        int gb = gcd(n,b);
        if (ga < gb){
            st1.emplace(ga,gb);
        }
    }
    repp(a,1,n+1) repp(b,1,n+1){
        if (n % a != 0) continue;
        if (n % b != 0) continue;
        if (a % b == 0) continue;
        if (b % a == 0) continue;
        if (a < b){
            st2.emplace(a, b);
        }
    }
    yn(st1 == st2);
}

void jikken4(){
    int n; in(n);
    map<int,int> mp;
    repp(x,1,n+1){
        mp[gcd(n,x)]++;
    }
    for (auto [x, c] : mp){
        out(x,c);
    }
}

#line 2 "/Users/noya2/Desktop/Noya2_library/math/sieve.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/math/sieve.hpp"

namespace noya2{

struct prime_sieve {
    static std::vector<int> primes, factor, mu;
    prime_sieve (int n = 1024){
        build(n);
    }
    static void reserve(int n){
        int sz = size();
        if (sz == 0){
            build(n);
            return ;
        }
        if (n <= sz) return ;
        while (sz < n) sz <<= 1;
        build(sz);
    }
    // n in [1, size()] is available
    static int size(){
        return (int)factor.size() - 1;
    }
  private:
    static void build(int n){
        primes.clear();
        factor.assign(n + 1, 0);
        mu.assign(n + 1, 1);
        for (int x = 2; x <= n; x++){
            if (factor[x] == 0){
                primes.emplace_back(x);
                factor[x] = x;
                mu[x] = -1;
            }
            for (int p : primes){
                if (x * p > n || p > factor[x]) break;
                factor[x * p] = p;
                mu[x * p] = (p == factor[x] ? 0 : -mu[x]);
            }
        }
    }
} sieve;
std::vector<int> prime_sieve::primes;
std::vector<int> prime_sieve::factor;
std::vector<int> prime_sieve::mu;

void reserve_sieve(int n){
    sieve.reserve(n);
}

int mobius_sieve(int n){
    assert(1 <= n && n <= sieve.size());
    return sieve.mu[n];
}

bool is_prime_sieve(int n){
    if (n <= 2) return n == 2;
    assert(n <= sieve.size());
    return sieve.factor[n] == n;
}

// pair(prime, exponent)
std::vector<std::pair<int, int>> factorize_sieve(int n){
    assert(1 <= n && n <= sieve.size());
    std::vector<std::pair<int, int>> ret;
    int pre = 0;
    while (n > 1){
        int p = sieve.factor[n];
        if (pre != p){
            ret.emplace_back(p, 1);
        }
        else {
            ret.back().second += 1;
        }
        pre = p;
        n /= p;
    }
    return ret;
}

std::vector<int> divisors_sieve(int n){
    assert(1 <= n && n <= sieve.size());
    std::vector<int> ret = {1};
    int pre = 0, w = 1;
    while (n > 1){
        int p = sieve.factor[n];
        int sz = ret.size();
        if (pre != p){
            w = ret.size();
        }
        ret.reserve(sz + w);
        for (int i = 0; i < w; i++){
            ret.emplace_back(ret[sz - w + i] * p);
        }
        pre = p;
        n /= p;
    }
    return ret;
}

} // namespace noya2
#line 70 "c.cpp"


int ord(int n, int p){
    int ret = 0;
    while (n % p == 0){
        n /= p;
        ret++;
    }
    return ret;
}

int ipow(int n, int e){
    int ret = 1;
    while (e--){
        ret *= n;
    }
    return ret;
}

void solve(){
    // jikken1();
    // jikken2();
    // jikken3();
    // jikken4();
    int h, w; in(h,w);
    auto pes = factorize_sieve(h*w);
    vector a(h,vector<int>(w));
    auto dfs = [&](auto sfs, int step) -> pii {
        if (step == ssize(pes)){
            a[0][0] = 1;
            return {1, 1};
        }
        auto [ih, iw] = sfs(sfs,step+1);
        auto [p, e] = pes[step];
        int eh = ord(h,p);
        int ew = ord(w,p);
        int mh = ipow(p,eh);
        int mw = ipow(p,ew);
        rep(i,mh) rep(j,mw){
            if (i == 0 && j == 0) continue;
            int gx = i*ih, gy = j*iw;
            rep(x,ih) rep(y,iw){
                a[gx+x][gy+y] = a[(i % 2 == 0 ? x : ih-1-x)][(j % 2 == 0 ? y : iw-1-y)];
            }
        }
        int count = ipow(p,e);
        rep(tt,e){
            count /= p;
            int many = count;
            rep(i,mh) rep(j,mw){
                if (many == 0) break;
                int gx = i*ih, gy = j*iw;
                rep(x,ih) rep(y,iw){
                    a[gx+x][gy+y] *= p;
                }
                many--;
            }
        }
        return {ih*mh,iw*mw};
    };
    auto [ih, iw] = dfs(dfs,0);
    assert(h == ih && w == iw);
    // out(a);
    vector<vector<int>> vals(h*w+1);
    repp(i,1,h*w+1){
        vals[gcd(h*w,i)].emplace_back(i);
    }
    vector ans(h,vector<int>(w));
    rep(i,h) rep(j,w){
        assert(!vals[a[i][j]].empty());
        ans[i][j] = vals[a[i][j]].back(); vals[a[i][j]].pop_back();
    }
    out(ans);
}

int main(){
    reserve_sieve(200200);
    int t = 1; //in(t);
    while (t--) { solve(); }
}