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

• 問題: No.1398 調和の魔法陣 (構築)
• ユーザー: PCTprobability
• 提出日時: 2021-02-19 21:31:59
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 3,341 bytes
• コンパイル時間: 4,474 ms
• コンパイル使用メモリ: 253,372 KB
• 最終ジャッジ日時: 2025-01-18 23:14:45
• ジャッジサーバーID （参考情報）: judge5 / judge2

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

ソースコード

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
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
#define all(s) (s).begin(),(s).end()
#define vcin(n) for(ll i=0;i<ll(n.size());i++) cin>>n[i]
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define P pair<ll,ll>
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
static const long double pi = 3.141592653589793;
void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}
void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}
template<class T,class U> void chmax(T& t,const U& u){if(t<u) t=u;}
template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
int main() {
  /* mod は 1e9+7 */
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
  ll h,w,x;
  cin>>h>>w>>x;
  swap(h,w);
  if(h!=1&&w!=1){
  for(int i=1;i<=9;i++){
    for(int j=1;j<=9;j++){
      for(int k=1;k<=9;k++){
        for(int s=1;s<=9;s++){
          if(i+j+k+s==x){
            vector<vector<ll>> ans(h,vector<ll>(w));
            for(int a=0;a<h;a++){
              for(int b=0;b<w;b++){
                if(b%3==2||a%3==2){
                  continue;
                }
                if(a%3==0&&b%3==0){
                  ans[a][b]=i;
                }
                else if(a%3==1&&b%3==0){
                  ans[a][b]=j;
                }
                else if(a%3==1&&b%3==1){
                  ans[a][b]=k;
                }
                else{
                  ans[a][b]=s;
                }
              }
            }
            for(int a=0;a<h;a++){
              for(int b=0;b<w;b++){
                cout<<ans[a][b];
              }
              cout<<endl;
            }
            return 0;
          }
        }
      }
    }
  }
  cout<<-1<<endl;
  }
  else{
    swap(h,w);
    if(h==1&&w==1){
      if(x<=9){
        cout<<x<<endl;
      }
      else{
        cout<<-1<<endl;
      }
    }
    else{
      if(h==1){
        for(int i=1;i<=9;i++){
         for(int j=1;j<=9;j++){
           if(i+j==x){
           for(int k=0;k<w;k++){
             if(k%3==2){
               cout<<0<<endl;
             }
             else if(k%3==1){
               cout<<i<<endl;
             }
             else{
               cout<<j<<endl;
             }
           }
             return 0;
           }
         }
        }
      }
      if(w==1){
        for(int i=1;i<=9;i++){
         for(int j=1;j<=9;j++){
           if(i+j==x){
           for(int k=0;k<h;k++){
             if(k%3==2){
               cout<<0;
             }
             else if(k%3==1){
               cout<<i;
             }
             else{
               cout<<j;
             }
           }
             cout<<endl;
             return 0;
           }
         }
        }
      }
    }
    cout<<-1<<endl;
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX