結果

問題 No.157 2つの空洞
ユーザー zaichuzaichu
提出日時 2016-06-14 21:48:48
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,865 bytes
コンパイル時間 961 ms
コンパイル使用メモリ 110,876 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-04-19 12:54:18
合計ジャッジ時間 1,643 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 1 ms
6,944 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 AC 1 ms
6,940 KB
testcase_15 AC 2 ms
6,940 KB
testcase_16 AC 1 ms
6,944 KB
testcase_17 AC 1 ms
6,944 KB
testcase_18 AC 1 ms
6,940 KB
testcase_19 AC 1 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_algobase.h:64,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/vector:62,
                 from main.cpp:1:
In constructor 'constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = int&; _U2 = int&; typename std::enable_if<(std::_PCC<true, _T1, _T2>::_MoveConstructiblePair<_U1, _U2>() && std::_PCC<true, _T1, _T2>::_ImplicitlyMoveConvertiblePair<_U1, _U2>()), bool>::type <anonymous> = true; _T1 = int; _T2 = int]',
    inlined from 'void solve()' at main.cpp:70:12:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_pair.h:688:42: warning: 'sy' may be used uninitialized [-Wmaybe-uninitialized]
  688 |         : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y))
      |                                          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void solve()':
main.cpp:57:9: note: 'sy' was declared here
   57 |     int sy,sx;
      |         ^~
In constructor 'constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = int&; _U2 = int&; typename std::enable_if<(std::_PCC<true, _T1, _T2>::_MoveConstructiblePair<_U1, _U2>() && std::_PCC<true, _T1, _T2>::_ImplicitlyMoveConvertiblePair<_U1, _U2>()), bool>::type <anonymous> = true; _T1 = int; _T2 = int]',
    inlined from 'void solve()' at main.cpp:70:12:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_pair.h:688:11: warning: 'sx' may be used uninitialized [-Wmaybe-uninitialized]
  688 |         : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y))
      |           ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void solve()':
main.cpp:57:12: note: 'sx' was declared here
   57 |     int sy,sx;
      |            ^~

ソースコード

diff # 

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define GRESORT(v) sort(v.begin(),v.end(),greater<int>())
#define REVERSE(v) reverse(v.begin(),v.end())
#define overlap(v) v.erase(unique(v.begin(),v.end()),v.end())
#define debug(x) cout << #x << ": " << x << endl
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i = (b-1); i >= a; i--)
#define rrep(i,n) RFOR(i,0,n)
#define INF 999999999

//4近傍
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};

//8近傍
//int dy[]={0,0,1,-1,1,1,-1,-1};
//int dx[]={1,-1,0,0,1,-1,1,-1};

lli mod = (lli)1e9+7;

void solve(){
    int w,h; cin >> w >> h;
    vector<string> s(h);
    rep(i,h) cin >> s[i];

    int sy,sx;
    rep(i,h){
        rep(j,w){
            if(s[i][j] == '.'){
                sy = i; sx = j; i = h; j = w;
            }
        }
    }

    vector<vector<int>> d(h,vector<int>(w));
    rep(i,h) rep(j,w) d[i][j] = INF;

    queue<pa> q;
    q.push(pa(sx,sy));

    d[sy][sx] = 0;

    queue<pa> hoge;
    hoge.push(pa(sx,sy));

    while(!q.empty()){
        pa p = q.front(); q.pop();
        int x = p.first, y = p.second;
        rep(i,4){
            int xx = x + dx[i];
            int yy = y + dy[i];
            if(xx < 0 || yy < 0 || xx >= w || yy >= h) continue;
            if(d[yy][xx] == INF && s[yy][xx] == '.'){
                q.push(pa(xx,yy));
                hoge.push(pa(xx,yy));
                d[yy][xx] = 0;
            }
        }
    }


    while(!hoge.empty()){
        pa p = hoge.front(); hoge.pop();
        int x = p.first, y = p.second;
        rep(i,4){
            int xx = x + dx[i];
            int yy = y + dy[i];
            if(xx < 0 || yy < 0 || xx >= w || yy >= h) continue;
            if(d[yy][xx] == 0) continue;
            if(s[yy][xx] == '#' && d[yy][xx] > d[y][x] + 1){
                d[yy][xx] = d[y][x]+1;
                hoge.push(pa(xx,yy));
            }
        }
    }

    int ans = INF;
    rep(i,h){
        rep(j,w){
            if(d[i][j] == INF){
                rep(k,4){
                    ans = min(ans,d[i+dx[k]][j+dy[k]]);
                }
            }
        }
    }

    cout << ans << endl;
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    solve();

    return 0;
}
0