#632471 (C++14) No.1434 Make Maze

• 問題: No.1434 Make Maze
• ユーザー: kwm_t
• 提出日時: 2021-03-20 14:26:37
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 10 ms / 2,000 ms
• コード長: 2,296 bytes
• コンパイル時間: 1,705 ms
• コンパイル使用メモリ: 172,596 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-11-24 21:47:41
• 合計ジャッジ時間: 5,182 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 30

ソースコード

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
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H, W, X;
    cin >> H >> W >> X;
    if (X % 4 != ((H - 1) + (W - 1)) % 4) {
        cout << -1 << endl;
        return 0;
    }
    int min = H - 1 + W - 1;
    int max = ((H + 1) / 2 * (W + 1) / 2) * 2;
    if ((3 == H % 4) && (3 == W % 4)) {
        max -= 2;
    }
    if ((X < min) || (max < X)) {
        cout << -1 << endl;
        return 0;
    }
    if ((3 == H % 4) && (3 == W % 4)) {
        //別処理を書く
        vector<string>S(H);
        rep(i, H) {
            rep(j, W) {
                if ((0 == j % 2) || (0 == i)) { S[i] += '.'; }
                else { S[i] += '#'; }
            }
        }
        int zan = (X - (H - 1) - (W - 1)) / 4;
        int max1line = (H - 1) / 2;
        rep(i, (W - 1) / 4) {
            if (zan > max1line) {
                S[0][4 * i + 1] = '#';
                S[max1line * 2][4 * i + 1] = '.';
                zan -= max1line;
            }
            else {
                S[0][4 * i + 1] = '#';
                S[zan * 2][4 * i + 1] = '.';
                zan = 0;
            }
        }
        rep(i, zan) {
            S[H - 2 - 4 * i][W - 1] = '#';
            S[H - 1 - 4 * i][W - 2] = '.';
            S[H - 3 - 4 * i][W - 2] = '.';
            S[H - 4 - 4 * i][W - 3] = '#';
        }
        rep(i, H) { cout << S[i] << endl; }
        return 0;
    }
    //通常ケース
    bool cross = false;
    if (3 == W % 4) {
        swap(H, W);
        cross = true;
    }
    vector<string>S(H);
    rep(i, H) {
        rep(j, W) {
            if ((0 == j % 2) || (0 == i)) { S[i] += '.'; }
            else { S[i] += '#'; }
        }
    }
    int zan = (X - (H - 1) - (W - 1)) / 4;
    int max1line = (H - 1) / 2;
    rep(i, (W - 1) / 4) {
        if (zan > max1line) {
            S[0][4 * i + 1] = '#';
            S[max1line * 2][4 * i + 1] = '.';
            zan -= max1line;
        }
        else {
            S[0][4 * i + 1] = '#';
            S[zan * 2][4 * i + 1] = '.';
            zan = 0;
        }
    }
    if (cross) {
        rep(i, W) {
            rep(j, H) { cout << S[j][i]; }
            cout << endl;
        }
    }
    else {
        rep(i, H) { cout << S[i] << endl; }
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX