結果

問題 No.1398 調和の魔法陣 (構築)
コンテスト
ユーザー theory_and_me
提出日時 2021-02-19 22:12:02
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 21 ms / 3,153 ms
コード長 4,114 bytes
コンパイル時間 2,268 ms
コンパイル使用メモリ 198,972 KB
最終ジャッジ日時 2025-01-19 00:14:41
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

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

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

int main(){

    ll W, H, X;
    cin >> W >> H >> X;

    if(H == 1 and W == 1){
        if(X <= 9){
            cout << X << "\n";
        }else{
            cout << -1 << "\n";
        }
        return 0;
    }
    

    if(H == 1){
        V<ll> base(3, 0);
        base[2] = -1;
        base[W%3] = -1;
        REP(i, 3){
            if(base[i] == -1) continue;
            ll toru = min(9ll, X);
            base[i] = toru;
            X -= toru;
        }
        if(X>0){
            cout << -1 << "\n";
        }else{
            REP(i, W){
                cout << (base[i%3] == -1 ? 0 : base[i%3]);
            }
            cout << "\n";
        }
        return 0;
    }

    if(W == 1){
        V<ll> base(3, 0);
        base[2] = -1;
        base[H%3] = -1;
        REP(i, 3){
            if(base[i] == -1) continue;
            ll toru = min(9ll, X);
            base[i] = toru;
            X -= toru;
        }
        if(X>0){
            cout << -1 << "\n";
        }else{
            REP(i, H){
                cout << (base[i%3] == -1 ? 0 : base[i%3]) << "\n";
            }
        }
        return 0;
    }

    if(0 <= X and X <= 36){
        auto base = make_vec(3, 3, 0ll);
        REP(i, 3){
            REP(j, 3){
                if(j == 2 or i == 2) base[i][j] = -1;
                if(j == W%3) base[i][j] = -1;
                if(i == H%3) base[i][j] = -1;
            }
        }
        REP(i, 3){
            REP(j, 3){
                if(base[i][j] == -1) continue;
                ll toru = min(9ll, X);
                base[i][j] = toru;
                X -= toru;
            }
        }
        // dump(base)
        if(X>0){
            cout << -1 << "\n";
        }else{
            REP(i, H){
                REP(j, W){
                    cout << (base[i%3][j%3] == -1 ? 0 : base[i%3][j%3]); 
                }
                cout << "\n";
            }
        }
    }else{
        cout << -1 << endl;
    }

    return 0;
}
0