結果

問題 No.1638 Robot Maze
ユーザー au7777
提出日時 2022-03-24 16:47:21
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 875 ms / 2,000 ms
コード長 3,418 bytes
コンパイル時間 3,897 ms
コンパイル使用メモリ 234,144 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-13 00:56:19
合計ジャッジ時間 7,655 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 49
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
typedef long long int ull;
#define MP make_pair
using namespace std;
using namespace atcoder;
typedef pair<ll, ll> P;
// const ll MOD = 998244353;
const ll MOD = 1000000007;
// using mint = modint998244353;
using mint = modint1000000007;
const double pi = 3.1415926536;
const int MAX = 2000003;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm (ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll n) {
    ll ret = 0;
    while (n) {
        n /= 10;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll cost[4];
char board[105][105];
ll ct[105][105];
typedef struct po {
    int x;
    int y;
    ll cst;
    bool operator>(const po & a) const {
        return cst > a.cst;
    }
    bool operator<(const po & a) const {
        return cst < a.cst;
    }
    bool operator==(const po & a) const {
        return cst == a.cst;
    }
} point;
int main() {
    int h, w;
    cin >> h >> w;
    for (int i = 0; i < 4; i++) cin >> cost[i];
    ll k, p;
    cin >> k >> p;
    int xs, ys, xt, yt;
    cin >> xs >> ys >> xt >> yt;
    for (int i = 0; i <= 104; i++) {
        for (int j = 0; j <= 104; j++) {
            board[i][j] = '#';
            ct[i][j] = k + 1;
        }
    }
    for (int i = 1; i <= h; i++) {
        string s;
        cin >> s;
        for (int j = 1; j <= w; j++) {
            board[i][j] = s[j - 1];
        }
    }
    priority_queue<point> que;
    point start;
    start.x = xs;
    start.y = ys;
    start.cst = 0;
    que.push(start);
    ct[xs][ys] = 0;
    while (que.size()) {
        point pos = que.top();
        que.pop();
        for (int i = 0; i < 4; i++) {
            int nx = pos.x + dx[i];
            int ny = pos.y + dy[i];
            ll ncst = pos.cst + cost[i];
            if (board[nx][ny] == '#') continue;
            if (board[nx][ny] == '@') ncst += p;
            if (ncst > k) continue;
            if (ncst >= ct[nx][ny]) continue;
            ct[nx][ny] = ncst;
            point npos;
            npos.x = nx;
            npos.y = ny;
            npos.cst = ncst;
            que.push(npos);
        }
    }
    if (ct[xt][yt] == k + 1) {
        cout << "No" << endl;
    }
    else {
        cout << "Yes" << endl;
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0