#106770 (C++11) No.402 最も海から遠い場所

• 問題: No.402 最も海から遠い場所
• ユーザー: sntea
• 提出日時: 2016-07-23 20:52:48
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 831 ms / 3,000 ms
• コード長: 2,287 bytes
• コンパイル時間: 1,772 ms
• コンパイル使用メモリ: 175,764 KB
• 実行使用メモリ: 493,312 KB
• 最終ジャッジ日時: 2024-11-06 15:29:17
• 合計ジャッジ時間: 6,554 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 19

ソースコード

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
#ifdef LOCAL111
#else
    #define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e8;
using namespace std;
#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
    #define DEBUG(x) cout<<#x<<": "<<(x)<<endl
#else
    #define DEBUG(x) true
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
typedef pair<int,int> P;
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<LL,LL> LP;
void ios_init(){
    //cout.setf(ios::fixed);
    //cout.precision(12);
#ifdef LOCAL111
    return;
#endif
    ios::sync_with_stdio(false); cin.tie(0);    
}
int h,w;
/*int dist_s(vecotr<vecor<int>>& dp, int px, int py)
{
    FOR(dx,-1,2) FOR(dy,-1,2){
        if(dx == 0 and dy == 0) continue;
    }
}*/
bool check(int x, int y){
    return 0 <= x and x < h and 0 <= y and y < w;
}
int main()
{
    ios_init();
    cin >> h >> w;
    vector<string> s(h+2);
    s[0] = string(w+2, '.');
    FOR(i,1,h+1) cin >> s[i], s[i] = "."+s[i]+".";
    s[h+1] = string(w+2, '.');
    DEBUG(0);
    h += 2; w += 2;
    vector<vector<int>> dp(h, vector<int>(w, INF));
    using T = tuple<int, int, int>;
    queue<T> qu;
    DEBUG(1);
    REP(i,h) REP(j,w) if(s[i][j] == '.') qu.emplace(i,j,0);
    DEBUG(2);
    while(!qu.empty()){
        P curr;
        int dist;
        tie(curr.F, curr.S, dist) = qu.front();
        qu.pop();
        if(dp[curr.F][curr.S] != INF) continue;
        dp[curr.F][curr.S] = dist;
        FOR(dx,-1,2) FOR(dy,-1,2){
            int nx = curr.F+dx, ny = curr.S+dy;
            if((dx == 0 and dy == 0) or !(check(nx, ny))) continue;
            if(dp[nx][ny] == INF) qu.emplace(nx, ny, dist+1);
        }
    }
    int ans = 0;
    REP(i,h) REP(j,w) ans = max(ans, dp[i][j]);
    cout << ans << endl; 
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX