#664199 (C++17) No.1434 Make Maze

• 問題: No.1434 Make Maze
• ユーザー: tkmst201
• 提出日時: 2021-06-06 10:46:59
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 22 ms / 2,000 ms
• コード長: 2,442 bytes
• コンパイル時間: 2,113 ms
• コンパイル使用メモリ: 204,028 KB
• 最終ジャッジ日時: 2025-01-22 03:53:54
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
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
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//
int main() {
    int H, W, X;
    cin >> H >> W >> X;
    int h = (H + 1) / 2, w = (W + 1) / 2;
    if (X % 2 == 1 || (h + w) % 2 != X / 2 % 2) { puts("-1"); return 0; }
    X /= 2;
    
    bool trans = false;
    if (h % 2 == 0) {
        trans = true;
        swap(H, W);
        swap(h, w);
    }
    
    constexpr int dx[] {-1,0,1,0}, dy[] {0,-1,0,1}; // lurd ^1 で転置
    vector<int> dirs;
    
    // (h, w) = (odd, even) or (even, even)
    if (h + w - 2 > X || h * w - 1 < X || ((~(h | w) & 1) && h * w - 1 == X)) { puts("-1"); return 0; } 
    
    X -= h + w - 2;
    REP(i, (h - 1) / 2) {
        // rrr d lll d
        const int cur = min(X / 2, w - 1);
        REP(j, cur) dirs.emplace_back(2); // r
        dirs.emplace_back(3); // d
        REP(j, cur) dirs.emplace_back(0); // l
        dirs.emplace_back(3); // d
        X -= cur * 2;
    }
    if (h & 1) REP(i, w - 1) dirs.emplace_back(2); // r
    else {
        REP(i, X / 2) {
            dirs.emplace_back(3); // d
            dirs.emplace_back(2); // r
            dirs.emplace_back(1); // u
            dirs.emplace_back(2); // r
        }
        REP(i, w - 1 - X) dirs.emplace_back(2); // r
        dirs.emplace_back(3); // d
    }
    
    if (trans) {
        for (int & a : dirs) a ^= 1;
        swap(H, W);
        swap(h, w);
    }
    vector<string> ans(H, string(W, '#'));
    REP(i, h) REP(j, w) ans[i << 1][j << 1] = '.';
    vector done(H, vector<int>(W));
    done[0][0] = true;
    int y = 0, x = 0;
    for (int dir : dirs) {
        const int ny = y + dy[dir], nx = x + dx[dir];
        ans[ny][nx] = '.';
        done[ny][nx] = true;
        y += 2 * dy[dir];
        x += 2 * dx[dir];
        done[y][x] = true;
    }
    
    REP(i, H) REP(j, W) {
        REP(dir, 4) {
            int ny = i + 2 * dy[dir], nx = j + 2 * dx[dir];
            if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
            if (ans[i][j] == '#' || ans[ny][nx] == '#') continue;
            if (done[ny][nx]) continue;
            done[ny][nx] = true;
            done[i + dy[dir]][j + dx[dir]] = true;
            ans[i + dy[dir]][j + dx[dir]] = '.';
        }
    }
    
    REP(i, H) cout << ans[i] << '\n';
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX