結果

問題 No.157 2つの空洞
ユーザー is_eri23is_eri23
提出日時 2015-02-27 10:33:24
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 3,916 bytes
コンパイル時間 1,648 ms
コンパイル使用メモリ 166,824 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-23 22:31:54
合計ジャッジ時間 2,649 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,948 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 3 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 4 ms
6,940 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 27 ms
6,940 KB
testcase_15 AC 95 ms
6,940 KB
testcase_16 AC 13 ms
6,940 KB
testcase_17 AC 26 ms
6,940 KB
testcase_18 AC 16 ms
6,944 KB
testcase_19 AC 1 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
int W,H;
int memo[30][30];
string board[30];
int group[30][30];
int dx[] = {-1,0,0,1};
int dy[] = {0,-1,1,0};
using PII = pair <pair <int,int>,int>;
inline bool in(int x,int y){
  return 0 <= x && x < H && 0 <= y && y < W;
}
void dfs(int x,int y, int g){
  if (board[x][y] == '#' || group[x][y] != 0) {
    return;
  }
  group[x][y] = g;
  rep(i,4){
    if (in(x+dx[i],y+dy[i])) {
      dfs(x+dx[i],y+dy[i],g);
    }
  }
}

int search(int x_,int y_,int x2, int y2){
  mem(memo,-1);
  priority_queue <PII,vector <PII>,greater<PII> > que;
  que.push(mp(mp(x_,y_),0));
  int now_cost = INF;
  while(!que.empty()){
    auto t = que.top();
    que.pop();
    auto x = t.fir.fir;
    auto y = t.fir.sec;
    auto c = t.sec;
    if (memo[x][y] >= 0 && memo[x][y] <= c) {
      continue;
    }
    if (now_cost <= c) {
      continue;
    }
    memo[x][y] = c;
    if (x == x2 && y == y2) {
      now_cost = min(now_cost,c);
      continue;
    }
    rep(i,4){
      if (in(x+dx[i],y+dy[i])) {
        auto c2 = c + (board[x+dx[i]][y+dy[i]] == '#');
        if (now_cost <= c2) {
          continue;
        }
        if (memo[x+dx[i]][y+dy[i]] == -1 || memo[x+dx[i]][y+dy[i]] > c2) {
          que.push(mp(mp(x+dx[i],y+dy[i]),c2));
        }
      }
    }
  }
  return now_cost;
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> W >> H;
  rep(i,H){
    cin >> board[i];
  }
  {
    int g = -1;
    rep(i,H){
      rep(j,W){
        if (group[i][j] == 0){
          dfs(i,j,g);
          g += 1;
        }
      }
    }
  }
  int ans = INF;
  rep(i1,H){
    rep(j1,W){
      if (group[i1][j1] == 0) {
        continue;
      }
      rep2(i2,i1,H){
        rep2(j2,j1,W){
          if (group[i2][j2] == 0) {
            continue;
          }
          if (group[i1][j1] != group[i2][j2]) {
            ans = min(ans, search(i1,j1,i2,j2));
          }
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}
0