#1189184 (C++17) No.3734 No Flat Notes

• 問題: No.3734 No Flat Notes
• ユーザー: jupiter_68
• 提出日時: 2026-09-19 16:54:46
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 4,137 bytes
• コンパイル時間: 1,154 ms
• コンパイル使用メモリ: 219,856 KB
• 実行使用メモリ: 7,852 KB
• 最終ジャッジ日時: 2026-09-19 16:54:52
• 合計ジャッジ時間: 5,456 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge1_0

サブタスク	配点	結果
部分点	20 %	AC * 28
満点	80 %	AC * 58 WA * 2
合計	3.5 * 20% = 70 点

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = array<ll, 2>;
using vl = vector<ll>;
template <class T> using vec = vector<T>;
template <class T> using vv = vec<vec<T>>;
template <class T> using vvv = vv<vec<T>>;
template <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, l, r) for(ll i = (l); i < (r); ++i)
#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)
#define sz(x) (ll) (x).size()
template <typename T>
bool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }
template <typename T>
bool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }

const ll mod = 998244353; // 1000000007;

struct mint {
    ll x;
    mint(ll y = 0) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    mint &operator+=(const mint &p) {
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }
    mint &operator-=(const mint &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    mint &operator*=(const mint &p) {
        x = (ll)(1ll * x * p.x % mod);
        return *this;
    }
    mint &operator/=(const mint &p) {
        *this *= p.inv();
        return *this;
    }
    mint operator-() const { return mint(-x); }
    mint operator+(const mint &p) const { return mint(*this) += p; }
    mint operator-(const mint &p) const { return mint(*this) -= p; }
    mint operator*(const mint &p) const { return mint(*this) *= p; }
    mint operator/(const mint &p) const { return mint(*this) /= p; }
    bool operator==(const mint &p) const { return x == p.x; }
    bool operator!=(const mint &p) const { return x != p.x; }
    friend ostream &operator<<(ostream &os, const mint &p) { return os << p.x; }
    friend istream &operator>>(istream &is, mint &a) {
        ll t; is >> t; a = mint(t); return (is);
    }
    mint inv() const { return pow(mod - 2); }
    mint pow(ll n) const {
        mint ret(1), mul(x);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
};

void solve(){
    ll H, W, K; cin >> H >> W >> K;
    if(K == 0){
        cout << -1 << endl;
        return;
    }
    vv<ll> ans(H, vl(W));
    if(H % 2 == 0){
        ll x = 1;
        rep(i, H){
            if(i % 2 == 0){
                rep(k, W) ans[i][k] = x, x++;
            }else{
                rrep(k, 0, W) ans[i][k] = x, x++;
            }
        }
        rep(t, K-1){
            if((K - t) % 2 == 0){
                ll i = t / W, j = t % W;
                if(i % 2) j = W - 1 - j;
                swap(ans[i][j], ans[H-1-i][j]);
            }
        }
    }else{
        if((W % 2 == 0) || (K * 2 <= (H-1) * W)){
            ll x = 1;
            rep(i, H){
                if(i % 2 == 0){
                    rep(k, W) ans[i][k] = x, x++;
                }else{
                    rrep(k, 0, W) ans[i][k] = x, x++;
                }
            }
            rep(t, K-1){
                if((K - t) % 2 == 0){
                    ll i = t / W, j = t % W;
                    if(i % 2) j = W - 1 - j;
                    swap(ans[i][j], ans[H-1-i][W-1-j]);
                }
            }
        }else{
            ll lo = 1, hi = H*W;
            rep(i, H){
                rep(k, W){
                    if((i + k) % 2) ans[i][k] = lo, lo++;
                    else ans[i][k] = hi, hi--;
                }
            }
            K = (H * W) / 2 - K;
            if(K == 0){
                cout << -1 << endl;
                return;
            }
            rep(t, K){
                ans[0][t*2+1] = H*W+t+1;
            }
            rep(i, H){
                rep(k, W) ans[i][k] -= K;
            }
        }
    }
    rep(i, H){
        rep(k, W){
            cout << ans[i][k] << " \n"[k == W-1];
        }
    }
    return;
}

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}