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

• 問題: No.1398 調和の魔法陣 (構築)
• ユーザー: auaua
• 提出日時: 2021-02-19 23:24:09
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,888 bytes
• コンパイル時間: 1,763 ms
• コンパイル使用メモリ: 174,272 KB
• 実行使用メモリ: 9,216 KB
• 最終ジャッジ日時: 2024-09-16 23:03:10
• 合計ジャッジ時間: 28,018 ms
• ジャッジサーバーID （参考情報）: judge6 / judge1

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

ソースコード

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
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll inf=INF*INF;
const ll mod=1e9+7;
const ll MAX=140010;
signed main(){
    ll w,h,x;cin>>w>>h>>x;
    vector<vector<ll> >ans(h+1,vector<ll>(w+1));
    if(h==1){
        if(x>18){
            cout<<-1<<endl;
        }else if(x>9){
            vector<ll>ans(w);
            ans[0]=9;
            ans[1]=x-9;
            REP(i,3,w){
                ans[i]=ans[i-3];
            }
            rep(i,w)cout<<ans[i];
            cout<<endl;
        }else{
            vector<ll>ans(w);
            ans[0]=x;
            REP(i,3,w){
                ans[i]=ans[i-3];
            }
            rep(i,w)cout<<ans[i];
            cout<<endl;
        }
    }else if(w==1){
        swap(h,w);
        if(x>18){
            cout<<-1<<endl;
        }else if(x>9){
            vector<ll>ans(w);
            ans[0]=9;
            ans[1]=x-9;
            REP(i,3,w){
                ans[i]=ans[i-3];
            }
            rep(i,w)cout<<ans[i]<<endl;
            cout<<endl;
        }else{
            vector<ll>ans(w);
            ans[0]=x;
            REP(i,3,w){
                ans[i]=ans[i-3];
            }
            rep(i,w)cout<<ans[i]<<endl;
            cout<<endl;
        }
    }else{
        if(x>36){
            cout<<-1<<endl;
        }else{
            vector<vector<ll> >ans(h,vector<ll>(w));
            if(x>9){
                ans[0][0]=9;
                x-=9;
            }else{
                ans[0][0]=x;
                x=0;
            }
            if(x>9){
                ans[1][0]=9;
                x-=9;
            }else{
                ans[1][0]=x;
                x=0;
            }
            if(x>9){
                ans[0][1]=9;
                x-=9;
            }else{
                ans[0][1]=x;
                x=0;
            }
            if(x>9){
                ans[1][1]=9;
                x-=9;
            }else{
                ans[1][1]=x;
                x=0;
            }
            rep(i,2){
                REP(j,3,w){
                    ans[i][j]=ans[i][j-3];
                }
            }
            REP(i,3,h){
                rep(j,w){
                    ans[i][j]=ans[i-3][j];
                }
            }
            rep(i,h){
                rep(j,w){
                    cout<<ans[i][j];
                }
                cout<<endl;
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX