結果

問題 No.402 最も海から遠い場所
ユーザー Konton7Konton7
提出日時 2020-06-13 15:39:57
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 860 ms / 3,000 ms
コード長 5,978 bytes
コンパイル時間 2,291 ms
コンパイル使用メモリ 216,540 KB
実行使用メモリ 170,804 KB
最終ジャッジ日時 2024-06-25 12:33:30
合計ジャッジ時間 6,731 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 6 ms
6,940 KB
testcase_14 AC 3 ms
6,940 KB
testcase_15 AC 21 ms
6,944 KB
testcase_16 AC 28 ms
7,856 KB
testcase_17 AC 352 ms
88,680 KB
testcase_18 AC 860 ms
50,224 KB
testcase_19 AC 629 ms
170,804 KB
testcase_20 AC 670 ms
38,912 KB
testcase_21 AC 640 ms
140,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w)
{
    return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T>
vector<T> cumsum(const vector<T> &v)
{
    T s = 0;
    vector<T> ret;

    rep(i, v.size())
    {
        s += v[i];
        s %= mod;
        ret.emplace_back(s);
    }
    return ret;
}

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c)
{
    VS ret;
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            ret.emplace_back(part);
            part = "";
        }
        else if (s[i] != c)
        {
            part += s[i];
        }
    }
    return ret;
}

string removezero(string &s)
{
    string ret;
    for (auto z : s)
        if (z != '0')
            ret += z;
    return ret;
}

ll sumdigit(ll x)
{
    ll ans{0};
    while (x > 0)
    {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r;
        r = (r * r), q /= 2;
    }
    return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
    rep(i, frac_list.size() - 1)
    {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
    if (a < b)
        return 0;
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

void update(vector<PII> &new_search, VVI &dist, int y, int x, int c, int h, int w)
{
    if (check(y, x, h + 2, w + 2) && dist[y][x] == 10000)
    {
        dist[y][x] = c;
        new_search.emplace_back(make_pair(y, x));
    }
}

// #define DEBUG

int main()
{

    // cin.tie(0);
    // ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int h, w, c{1}, ans{0};
    cin >> h >> w;
    string s;
    VVI dist(h + 2, VI(w + 2, 0));
    vector<PII> search, new_search;

    rep(i, h)
    {
        cin >> s;
        rep(j, w)
        {
            if (s[j] == '#')
                dist[i + 1][j + 1] = 10000;
            else
            {
                search.emplace_back(make_pair(i + 1, j + 1));
            }
        }
    }

    rep(j, w + 2)
    {
        search.emplace_back(make_pair(0, j));
        search.emplace_back(make_pair(h + 1, j));
    }
    rep2(i, 1, h + 1)
    {
        search.emplace_back(make_pair(i, 0));
        search.emplace_back(make_pair(i, w + 1));
    }

    while (!search.empty())
    {
        for (auto p : search)
        {
            auto [y, x] = p;
            update(new_search, dist, y + 1, x + 1, c, h, w);
            update(new_search, dist, y + 1, x, c, h, w);
            update(new_search, dist, y + 1, x - 1, c, h, w);
            update(new_search, dist, y, x + 1, c, h, w);
            update(new_search, dist, y, x, c, h, w);
            update(new_search, dist, y, x - 1, c, h, w);
            update(new_search, dist, y - 1, x + 1, c, h, w);
            update(new_search, dist, y - 1, x, c, h, w);
            update(new_search, dist, y - 1, x - 1, c, h, w);
        }
        c++;
        search.clear();
        search = new_search;
        new_search.clear();
    }

    rep(i, h + 2) rep(j, w + 2) ans = max(ans, dist[i][j]);
    cout << ans << rt;
    return 0;
}
0