結果

問題 No.157 2つの空洞
ユーザー heno239heno239
提出日時 2020-08-08 13:53:43
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 4 ms / 2,000 ms
コード長 3,619 bytes
コンパイル時間 1,190 ms
コンパイル使用メモリ 119,576 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-10-01 15:11:38
合計ジャッジ時間 2,068 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
6,812 KB
testcase_01 AC 4 ms
6,820 KB
testcase_02 AC 4 ms
6,820 KB
testcase_03 AC 3 ms
6,820 KB
testcase_04 AC 3 ms
6,820 KB
testcase_05 AC 3 ms
6,820 KB
testcase_06 AC 3 ms
6,820 KB
testcase_07 AC 3 ms
6,820 KB
testcase_08 AC 3 ms
6,816 KB
testcase_09 AC 3 ms
6,824 KB
testcase_10 AC 3 ms
6,820 KB
testcase_11 AC 3 ms
6,820 KB
testcase_12 AC 4 ms
6,820 KB
testcase_13 AC 3 ms
6,820 KB
testcase_14 AC 3 ms
6,820 KB
testcase_15 AC 3 ms
6,816 KB
testcase_16 AC 3 ms
6,820 KB
testcase_17 AC 3 ms
6,820 KB
testcase_18 AC 4 ms
6,820 KB
testcase_19 AC 3 ms
6,816 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:131:24: warning: 'ans' may be used uninitialized [-Wmaybe-uninitialized]
  131 |         cout << ans << "\n";
      |                        ^~~~
main.cpp:129:13: note: 'ans' was declared here
  129 |         int ans;
      |             ^~~
main.cpp:112:45: warning: 'sx' may be used uninitialized [-Wmaybe-uninitialized]
  112 |         q.push({ 0,{sx,sy} }); dist[sx][sy] = 0;
      |                                ~~~~~~~~~~~~~^~~
main.cpp:106:13: note: 'sx' was declared here
  106 |         int sx, sy;
      |             ^~
main.cpp:112:45: warning: 'sy' may be used uninitialized [-Wmaybe-uninitialized]
  112 |         q.push({ 0,{sx,sy} }); dist[sx][sy] = 0;
      |                                ~~~~~~~~~~~~~^~~
main.cpp:106:17: note: 'sy' was declared here
  106 |         int sx, sy;
      |                 ^~

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 17;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

char mp[20][20];
int dist[20][20];
using speP = pair<int, P>;
void solve() {
	int h, w; cin >> w >> h;
	rep(i, h)rep(j, w)cin >> mp[i][j];
	int sx, sy;
	rep(i, h)rep(j, w)if (mp[i][j] == '.') {
		sx = i, sy = j;
	}
	rep(i, h)rep(j, w)dist[i][j] = mod;
	priority_queue<speP,vector<speP>,greater<speP>> q;
	q.push({ 0,{sx,sy} }); dist[sx][sy] = 0;
	while (!q.empty()) {
		speP pp = q.top(); q.pop();
		P p = pp.second;
		if (pp.first > dist[p.first][p.second])continue;
		rep(d, 4) {
			int nx = p.first + dx[d];
			int ny = p.second + dy[d];
			if (nx < 0 || nx == h || ny < 0 || ny == w)continue;
			int c = dist[p.first][p.second];
			if (mp[nx][ny] == '#')c++;
			if (c < dist[nx][ny]) {
				dist[nx][ny] = c;
				q.push({ c,{nx,ny} });
			}
		}
	}
	int ans;
	rep(i, h)rep(j, w)if (mp[i][j] == '.')if (dist[i][j] > 0)ans = dist[i][j];
	cout << ans << "\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0