結果
問題 | No.402 最も海から遠い場所 |
ユーザー |
|
提出日時 | 2021-08-29 19:01:02 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 586 ms / 3,000 ms |
コード長 | 4,348 bytes |
コンパイル時間 | 1,622 ms |
コンパイル使用メモリ | 127,120 KB |
実行使用メモリ | 121,808 KB |
最終ジャッジ日時 | 2024-11-22 07:20:36 |
合計ジャッジ時間 | 5,812 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:133:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 133 | auto [x, y] = Q.front(); | ^
ソースコード
#define LOCAL#define _USE_MATH_DEFINES#include <array>#include <cassert>#include <cstdio>#include <cstring>#include <iostream>#include <iomanip>#include <string>#include <sstream>#include <vector>#include <queue>#include <stack>#include <list>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <algorithm>#include <complex>#include <cmath>#include <numeric>#include <bitset>#include <functional>#include <random>#include <ctime>using namespace std;template <typename A, typename B>ostream& operator <<(ostream& out, const pair<A, B>& a) {out << "(" << a.first << "," << a.second << ")";return out;}template <typename T, size_t N>ostream& operator <<(ostream& out, const array<T, N>& a) {out << "["; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";return out;}template <typename T>ostream& operator <<(ostream& out, const vector<T>& a) {out << "["; bool first = true;for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";return out;}template <typename T, class Cmp>ostream& operator <<(ostream& out, const set<T, Cmp>& a) {out << "{"; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";return out;}template <typename U, typename T, class Cmp>ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {out << "{"; bool first = true;for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";return out;}#ifdef LOCAL#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)#else#define trace(...) 42#endiftemplate <typename Arg1>void __f(const char* name, Arg1&& arg1){cerr << name << ": " << arg1 << endl;}template <typename Arg1, typename... Args>void __f(const char* names, Arg1&& arg1, Args&&... args){const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << ": " << arg1 << " |";__f(comma + 1, args...);}template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }template <class T, class... D> auto vect(const T& v, int n, D... m) {return vector<decltype(vect(v, m...))>(n, vect(v, m...));}typedef long long int64;typedef pair<int, int> ii;#define SZ(x) (int)((x).size())template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;const int MOD = 1e9 + 7;// const int MOD = 998244353;mt19937 mrand(random_device{}());int rnd(int x) { return mrand() % x; }// mt19937_64 mrand(random_device{}());// int64 rnd(int64 x) { return mrand() % x; }template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }void add(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }struct fast_ios {fast_ios() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);};} fast_ios_;const int d8[8][2] = {{1, 0}, {0, -1}, {-1, 0}, {0, 1},{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};int main() {int n, m;cin >> n >> m;vector<string> a(n);for (auto& s : a) cin >> s;auto d = vect<int>(-1, n, m);queue<ii> Q;for (int i = 0; i < n; ++i) {for (int j = 0; j < m; ++j) {if (a[i][j] == '.') {d[i][j] = 0;Q.push({i, j});}}}for (int i = 0; i < n; ++i) {for (int j = 0; j < m; ++j) {if (a[i][j] == '.') continue;if (i == 0 || i == n - 1 || j == 0 || j == m - 1) {d[i][j] = 1;Q.push({i, j});}}}while (!Q.empty()) {auto [x, y] = Q.front();Q.pop();for (int k = 0; k < 8; ++k) {int nx = x + d8[k][0];int ny = y + d8[k][1];if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue;if (d[nx][ny] != -1) continue;d[nx][ny] = d[x][y] + 1;Q.push({nx, ny});}}int ret = 0;for (int i = 0; i < n; ++i) {for (int j = 0; j < m; ++j) {ckmax(ret, d[i][j]);}}cout << ret << '\n';return 0;}