#1189035 (C++23(gcc16)) No.3734 No Flat Notes

• 問題: No.3734 No Flat Notes
• ユーザー: tatyam
• 提出日時: 2026-09-19 16:24:18
• 言語: C++23(gcc16) (gcc 16.1.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 15 ms / 2,000 ms
• コード長: 9,041 bytes
• コンパイル時間: 3,240 ms
• コンパイル使用メモリ: 366,856 KB
• 実行使用メモリ: 9,772 KB
• 最終ジャッジ日時: 2026-09-19 16:24:30
• 合計ジャッジ時間: 7,456 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_1

サブタスク	配点	結果
部分点	20 %	AC * 28
満点	80 %	AC * 60
合計	3.5 * 100% = 350 点

ソースコード

#include <cassert>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tuplis = array<ll, 3>;
namespace rg = ranges;
namespace vw = views;
template<class T> using V = vector<T>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll INF = LLONG_MAX / 4;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload5(a,b,c,d,e,name,...) name
#define overload4(a,b,c,d,name,...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) rep2(_,n)
#define rep2(i,n) rep3(i,0,n)
#define rep3(i,a,b) for(ll i=a;i<(b);i++)
#define rep4(i,a,b,c) for(ll i=a;i<(b);i+=(c))
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) rrep2(_,n)
#define rrep2(i,n) for(ll i=n;i--;)
#define rrep3(i,a,b) for(ll i=b;i-->(a);)
#define rrep(...) overload3(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define each1(i,a) for(auto&&i:a)
#define each2(x,y,a) for(auto&&[x,y]:a)
#define each3(x,y,z,a) for(auto&&[x,y,z]:a)
#define each4(w,x,y,z,a) for(auto&&[w,x,y,z]:a)
#define each(...) overload5(__VA_ARGS__,each4,each3,each2,each1)(__VA_ARGS__)
#define elif else if
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector name(h,vector(w,vector<type>(__VA_ARGS__)))
#define lmd(...) [&]{ return __VA_ARGS__; }
#define lmd1(...) [&](const auto& _1){ return __VA_ARGS__; }
#define lmd2(...) [&](const auto& _1, const auto& _2){ return __VA_ARGS__; }
#define MAP(...) views::transform(lmd1(__VA_ARGS__))
#define filter(...) views::filter(lmd1(__VA_ARGS__))
template<size_t i> struct nth_of_s { decltype(auto) operator()(auto&& v) const { return get<i>(v); } };
template<size_t i> nth_of_s<i> nth_of;
template<rg::input_range R> constexpr auto sum(R&& r, auto init) { return rg::fold_left(r, init, plus<>{}); }
template<rg::input_range R> constexpr auto sum(R&& r) { return sum(r, rg::range_value_t<R>{}); }
ll sz(const auto& a) { return ssize(a); }
constexpr auto sor = rg::sort;
constexpr auto rev = rg::reverse;
constexpr auto to_vec = rg::to<vector>();
constexpr auto flatten = vw::join;
void uniq(auto& a){ sor(a); auto r = rg::unique(a); a.erase(begin(a), end(a)); }
ll popcnt(ll a) { return popcount<ull>(a); }
ll log2(ll x) { return bit_width<ull>(x) - 1; }
ll bit_floor(ll x) { return bit_floor<ull>(x); }
ll bit_ceil(ll x) { return bit_ceil<ull>(x); }
ll intpow(ll a, ll b) { ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p) { ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template<class T> bool chmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool chmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
bool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }
bool inside(const auto& lo, const auto& v, const auto& hi) { return lo <= v && v < hi; }
vector<ll> iota(ll n, ll begin = 0) { vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }
vector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }
vector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(i, ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }
template<rg::input_range R> constexpr auto press(R&& r) {
    unordered_map<rg::range_value_t<R>, ll> p;
    for (auto&& x : r) p.try_emplace(x, p.size());
    return p;
}
 auto rle_view = vw::chunk_by(rg::equal_to{}) | vw::transform([](auto g) { return pair{*rg::begin(g), (ll)rg::distance(g)}; });
template<class... Ts> void in(Ts&... t);
[[maybe_unused]] void print(){}
template<class T, class... Ts> void print(const T& t, const Ts&... ts);
template<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\n'; }
namespace IO{
#define VOID(a) decltype(void(a))
struct S{ S(){ cin.tie(nullptr)->sync_with_stdio(0); fixed(cout).precision(12); } }S;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...); }
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{}); }
template<class T> void o(const T& t){ o(t, P<4>{}); }
template<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }
template<class T, size_t N> void o(const T (&t)[N], P<3>){ o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); } }
template<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }
template<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }
template<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){ print(get<idx>(t)...); }
template<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){ otuple(t, make_index_sequence<tuple_size<T>::value>{}); }
#undef VOID
}
template<class... Ts> void in(Ts&... t){ (IO::i(t), ...); }
template<class T, class... Ts> void print(const T& t, const Ts&... ts){ IO::o(t); (IO::o((cout << ' ', ts)), ...); }
#undef unpack
constexpr ll debug_const(ll judge, ll debug) {
#ifdef DEBUG
    return debug;
#else
    return judge;
#endif
}
#ifdef DEBUG
#define debug(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...) void(0)
#endif
#define YESNO(yes,no) void yes(bool i = 1){ out(i?#yes:#no); } void no(){ out(#no); }
YESNO(first, second)
YESNO(First, Second)
YESNO(Yes, No)
YESNO(YES, NO)
YESNO(possible, impossible)
YESNO(Possible, Impossible)
YESNO(POSSIBLE, IMPOSSIBLE)




ll H,W,M;
vector<vector<ll>>solve1(){
    auto ans=iota(W,1);
    rep(i,1,M)swap(ans[i*2-1],ans[i*2]);
    return {ans};
}
vector<vector<ll>>solve2(){
    vv(ll,ans,H,W);
    vector<pll>snake;
    rrep(i,H)snake.emplace_back(i,0);
    rep(i,H){
        if(i%2==0){
            rep(j,1,W)snake.emplace_back(i,j);
        }else{
            rrep(j,1,W)snake.emplace_back(i,j);
        }
    }
    ll lo=1,hi=H*W;
    rep(t,0,sz(snake),2){
        auto[i,j]=snake[t];
        ans[i][j]=M?(M--,lo++):hi--;
        tie(i,j)=snake[t+1];
        ans[i][j]=hi--;
    }
    return ans;
}
vector<vector<ll>>solve3(){
    if(H*W==M*2+1)return{};
    vv(ll,ans,H,W);
    vector<pll>snake;
    rep(i,H)snake.emplace_back(i,0);
    rrep(i,2,H){
        if(i%2==0){
            rep(j,1,W)snake.emplace_back(i,j);
        }else{
            rrep(j,1,W)snake.emplace_back(i,j);
        }
    }
    rrep(j,2,W){
        if(j%2==0){
            snake.emplace_back(1,j);
            snake.emplace_back(0,j);
        }else{
            snake.emplace_back(0,j);
            snake.emplace_back(1,j);
        }
    }
    snake.emplace_back(1,1);
    snake.emplace_back(0,1);
    ll lo=1,hi=H*W;
    rep(t,0,sz(snake)-1,2){
        auto[i,j]=snake[t];
        ans[i][j]=M?(M--,lo++):hi--;
        tie(i,j)=snake[t+1];
        ans[i][j]=hi--;
    }
    ans[0][1]=hi--;
    return ans;
}
void solve() {
    in(H,W,M);
    if(M==0)return out(-1);
    bool transpose=0;
    vector<vector<ll>>ans;
    if(W==1){
        swap(H,W);
        transpose=1;
    }
    if(H==1){
        ans=solve1();
    }else{
        if(W%2==0){
            swap(H,W);
            transpose=1;
        }
        if(H%2==0){
            ans=solve2();
        }else{
            ans=solve3();
        }
    }
    if(ans.empty())return out(-1);
    if(transpose){
        swap(H,W);
        vv(ll,ans2,H,W);
        rep(i,H)rep(j,W)ans2[i][j]=ans[j][i];
        swap(ans,ans2);
    }
    each(v,ans)out(v);
}

int main() {
    ll t = 1;
//    in(t);    // マルチテストケースか確認！
    rep(t) {
        solve();
    }
}