#643910 (C++17) No.1398 調和の魔法陣 (構築)

• 問題: No.1398 調和の魔法陣 (構築)
• ユーザー: tanimani364
• 提出日時: 2021-04-03 11:41:37
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,672 bytes
• コンパイル時間: 3,177 ms
• コンパイル使用メモリ: 198,968 KB
• 最終ジャッジ日時: 2025-01-20 10:26:25
• ジャッジサーバーID （参考情報）: judge2 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 21 WA * 7

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り
    if (p != -1)
    {
        x %= p;
    }
    T ret = 1;
    while (n > 0)
    {
        if (n & 1)
        {
            if (p != -1)
                ret = (ret * x) % p;
            else
                ret *= x;
        }
        if (p != -1)
            x = (x * x) % p;
        else
            x *= x;
        n >>= 1;
    }
    return ret;
}
using namespace std;
//using namespace atcoder;
void solve()
{   
    int w,h,x;
    cin>>w>>h>>x;
    auto write=[](const vector<vector<int>> &a)->void{
        int h=a.size(),w=a[0].size();
        rep(i,h){
            rep(j,w)cout<<a[i][j];
            cout<<"\n";
        }
    };
    vector<vector<int>>ans(h,vector<int>(w));
    if(h%3==0||w%3==0){
        if(x)cout<<-1<<"\n";
        else{
            write(ans);
        }
    }else if(x>36){
        cout<<-1<<"\n";
    }else if(x>18){
        if(h%3==2&&w%3==2){
            for(int i=0;i<h;i+=3){
                for(int j=0;j<w;j+=3){
                    ans[i][j]=x/4;ans[i+1][j]=x/4;
                    ans[i][j+1]=x/4;ans[i+1][j+1]=x-3*(x/4);
                }
            }
            write(ans);
        }else{
            cout<<-1<<"\n";
        }
    }else if(x>9){
        if(h%3==2){
            for(int i=0;i<h;i+=3){
                for(int j=0;j<w;j+=3){
                    ans[i][j]=x/2,ans[i+1][j]=x-x/2;
                }
            }
            write(ans);
        }else if(w%3==2){
            for(int i=0;i<h;i+=3){
                for(int j=0;j<w;j+=3){
                    ans[i][j]=x/2,ans[i][j+1]=x-x/2;
                }
            }
            write(ans);
        }else{
            cout<<-1<<"\n";
        }
    }else{
        for(int i=0;i<h;i+=3)for(int j=0;j<w;j+=3)ans[i][j]=x;
        write(ans);
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX