結果

問題 No.1434 Make Maze
ユーザー keikei
提出日時 2021-03-19 22:35:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,043 bytes
コンパイル時間 2,610 ms
コンパイル使用メモリ 217,120 KB
実行使用メモリ 8,192 KB
最終ジャッジ日時 2024-11-18 23:33:37
合計ジャッジ時間 7,251 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 WA -
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 4 ms
5,248 KB
testcase_21 AC 2 ms
5,248 KB
testcase_22 AC 8 ms
5,248 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(size_t i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(size_t i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

vector<vector<char>> simulate(int H,int W,int X){
    vector<vector<char>> ret(H,vector<char>(W,'.'));

    bool turn = false;
    for(int i = 1; i < H; i+=2){
        if(!turn){
            for(int j = 0; j < W-1; j++) ret[i][j] = '#';
        }else{
            for(int j = 1; j < W; j++) ret[i][j] = '#';
        }
        turn = !turn;
    }

    int MaxX = -1;
    {
        vector<vector<int>> dist(H,vector<int>(W,INF));
        dist[0][0] = 0;
        queue<pii> q; q.emplace(0,0);

        int dir[4] = {1,0,-1,0};
        while(q.size()){
            int h,w;
            tie(h,w) = q.front(); q.pop();

            for(int k = 0; k < 4;k++){
                int nh = h + dir[k];
                int nw = w + dir[k^1];

                if(nh < 0 || nh >= H || nw < 0 || nw >= W){
                    continue;
                }
                if(ret[nh][nw] == '#') continue;

                if(dist[nh][nw] > dist[h][w] + 1){
                    dist[nh][nw] = dist[h][w] + 1;
                    q.emplace(nh,nw);
                }
            }
        }
        MaxX = dist[H-1][W-1];
    }
    if(X > MaxX || (MaxX - X)%4 != 0){
        return vector<vector<char>>{};
    }

    if((H-3)%4 == 0){
        bool turn = false;
        for(int i = 1; i < H-2; i += 2){
            if(MaxX == X) break;
            if(!turn){
                for(int j = W-3; j >= 0; j-= 2){
                    if(MaxX == X) break;

                    MaxX -= 4;
                    swap(ret[i][j],ret[i][j+2]);
                }
            }else{
                for(int j = 2; j < W; j+= 2){
                    if(MaxX == X) break;

                    MaxX -= 4;
                    swap(ret[i][j],ret[i][j-2]);
                }
            }
        }
    }else{
        bool turn = false;
        for(int i = 1; i < H; i += 2){
            if(MaxX == X) break;
            if(!turn){
                for(int j = W-3; j >= 0; j-= 2){
                    if(MaxX == X) break;

                    MaxX -= 4;
                    swap(ret[i][j],ret[i][j+2]);
                }
            }else{
                for(int j = 2; j < W; j+= 2){
                    if(MaxX == X) break;

                    MaxX -= 4;
                    swap(ret[i][j],ret[i][j-2]);
                }
            }
        }
    }
    return ret;
}
template<class Type>
Type solve(Type res = Type()){
    int H,W,X; cin >> H >> W >> X;

    if(X < (H-1) + (W-1) || X%2 == 1) {
        cout << -1 << endl;
        return res;
    }
    {
        auto ret1 = simulate(H,W,X);
        if(!ret1.empty()){
            for(int i = 0; i < H;i++){
                for(int j = 0; j < W;j++){
                    cout << ret1[i][j];
                }cout << endl;
            }
            return res;
        }
    }
    {
        auto ret2 = simulate(W,H,X);
        if(!ret2.empty()){
            for(int i = 0; i < H; i++){
                for(int j = 0; j < W; j++){
                    cout << ret2[j][i];
                }cout << endl;
            }
            return res;
        }
    }

    cout << -1 << endl;
    return res;
}
int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    solve<ll>(0);
    // cout << fixed << setprecision(12) << solve<ll>() << endl;
    return 0;
}
0