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

• 問題: No.1398 調和の魔法陣 (構築)
• ユーザー: Shibuyap
• 提出日時: 2021-02-19 23:09:48
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: TLE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 4,280 bytes
• コンパイル時間: 10,113 ms
• コンパイル使用メモリ: 257,268 KB
• 最終ジャッジ日時: 2025-01-19 01:35:36
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 27 TLE * 1

ソースコード

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
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005
int main() {
    int w, h, x;
    cin >> w >> h >> x;
    if(x > 36){
        cout << -1 << endl;
        return 0;
    }
    if(x == 0){
        rep(i,h){
            rep(j,w){
                cout << '0';
            }
            cout << endl;
        }
        return 0;
    }
    int f[h+100][w+100];
    rep(i,h+100){
        rep(j,w+100){
            f[i][j] = 0;
        }
    }
    rep(a,10){
        rep(b,10){
            rep(c,10){
                rep(d,10){
                    int hh = min(h,10);
                    int ww = min(w,10);
                    while(h%3!=hh%3) hh--;
                    while(w%3!=ww%3) ww--;
                    rep(i,hh){
                        rep(j,ww){
                            if(i%3==0&&j%3==0){
                                f[i][j] = a;
                            }
                            if(i%3==0&&j%3==1){
                                f[i][j] = b;
                            }
                            if(i%3==1&&j%3==0){
                                f[i][j] = c;
                            }
                            if(i%3==1&&j%3==1){
                                f[i][j] = d;
                            }
                        }
                    }
                    int ok = 1;
                    rep(i,hh){
                        rep(j,ww){
                            if(hh>=10&&i==hh-1) continue;
                            if(ww>=10&&j==ww-1) continue;
                            int sum = 0;
                            srep(k,-1,2){
                                srep(l,-1,2){
                                    if(i+k>=0&&j+l>=0){
                                        sum += f[i+k][j+l];
                                    }
                                }
                            }
                            if(sum != x){
                                ok = 0;
                                break;
                            }
                        }
                        if(ok == 0) break;
                    }
                    if(ok){
                        rep(i,h){
                            rep(j,w){
                                if(i%3==0&&j%3==0){
                                    f[i][j] = a;
                                }
                                if(i%3==0&&j%3==1){
                                    f[i][j] = b;
                                }
                                if(i%3==1&&j%3==0){
                                    f[i][j] = c;
                                }
                                if(i%3==1&&j%3==1){
                                    f[i][j] = d;
                                }
                            }
                        }
                        
                        rep(i,h){
                            rep(j,w){
                                int sum = 0;
                                srep(k,-1,2){
                                    srep(l,-1,2){
                                        if(i+k>=0&&j+l>=0){
                                            sum += f[i+k][j+l];
                                        }
                                    }
                                }
                                if(sum != x){
                                    ok = 0;
                                    break;
                                }
                            }
                            if(ok == 0) break;
                        }
                        if(ok){
                            rep(i,h){
                                rep(j,w){
                                    cout << f[i][j];
                                }
                                cout << endl;
                            }
                            return 0;
                        }
                        
                    }
                }
            }
        }
    }
    
    cout << -1 << endl;
    return 0;
}
 
 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX