結果

問題 No.323 yuki国
ユーザー Konton7Konton7
提出日時 2020-07-07 00:32:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 167 ms / 5,000 ms
コード長 5,988 bytes
コンパイル時間 2,573 ms
コンパイル使用メモリ 223,452 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-25 00:19:46
合計ジャッジ時間 5,941 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 5 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 3 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 123 ms
6,940 KB
testcase_09 AC 118 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 123 ms
6,940 KB
testcase_14 AC 116 ms
6,944 KB
testcase_15 AC 49 ms
6,944 KB
testcase_16 AC 118 ms
6,944 KB
testcase_17 AC 131 ms
6,940 KB
testcase_18 AC 39 ms
6,940 KB
testcase_19 AC 81 ms
6,940 KB
testcase_20 AC 158 ms
6,940 KB
testcase_21 AC 167 ms
6,944 KB
testcase_22 AC 167 ms
6,944 KB
testcase_23 AC 160 ms
6,944 KB
testcase_24 AC 58 ms
6,940 KB
testcase_25 AC 55 ms
6,944 KB
testcase_26 AC 135 ms
6,944 KB
testcase_27 AC 141 ms
6,940 KB
testcase_28 AC 139 ms
6,940 KB
testcase_29 AC 127 ms
6,944 KB
testcase_30 AC 2 ms
6,940 KB
testcase_31 AC 2 ms
6,940 KB
testcase_32 AC 2 ms
6,940 KB
testcase_33 AC 2 ms
6,940 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,940 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 2 ms
6,940 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 VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<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()
#define allpt_cr(v) (v).crbegin(), (v).crend()

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;
    if (b < 0)
        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 bfs(int y, int x, int d, int h, int w, int dmax, vector<TI3> &new_search, const VVB &snowfall, vector<VVB> &snowtable)
{
    int new_d;
    if (!check(y, x, h, w))
        return;
    new_d = (snowfall[y][x] ? d + 1 : d - 1);
    if (new_d <= 0 || new_d >= dmax)
        return;
    if (snowtable[y][x][new_d])
        return;
    snowtable[y][x][new_d] = true;
    new_search.emplace_back(y, x, new_d);
    return;
}


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, a, b;
    PII start, goal;
    cin >> h >> w >> a >> start.first >> start.second >> b >> goal.first >> goal.second;
    string s;
    const int dmax = 2500;
    VVB snowfall(h, VB(w));
    vector<VVB> snowtable(h, VVB(w, VB(dmax, false)));
    vector<TI3> search, new_search;

    rep(i, h)
    {
        cin >> s;
        rep(j, w)
        {
            snowfall[i][j] = ((s[j] == '*') ? true : false);
        }
    }

    search.emplace_back(make_tuple(start.first, start.second, a));
    snowtable[start.first][start.second][a] = true;

    while (!search.empty())
    {
        for (auto [y, x, d] : search)
        {
            bfs(y + 1, x, d, h, w, dmax, new_search, snowfall, snowtable);
            bfs(y - 1, x, d, h, w, dmax, new_search, snowfall, snowtable);
            bfs(y, x + 1, d, h, w, dmax, new_search, snowfall, snowtable);
            bfs(y, x - 1, d, h, w, dmax, new_search, snowfall, snowtable);
        }
        search.clear();
        search = new_search;
        new_search.clear();
    }

    cout << (snowtable[goal.first][goal.second][b] ? "Yes" : "No") << rt;

    return 0;
}
0