結果

問題 No.1638 Robot Maze
ユーザー apricity
提出日時 2023-02-27 23:47:41
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 4 ms / 2,000 ms
コード長 3,713 bytes
コンパイル時間 1,678 ms
コンパイル使用メモリ 138,164 KB
最終ジャッジ日時 2025-02-11 00:02:35
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 49
権限があれば一括ダウンロードができます

ソースコード

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

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>
#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}
template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int h,w,sx,sy,tx,ty; ll u,d,r,l,k,p; in(h,w,u,d,r,l,k,p,sx,sy,tx,ty);
    sx--; sy--; tx--; ty--;
    vector<string> c(h); in(c);
    int dx[4] = {-1,1,0,0};
    int dy[4] = {0,0,-1,1};
    ll cs0[4] = {2*u,2*d,2*l,2*r};
    ll cs1[4] = {2*u+p, 2*d+p, 2*l+p, 2*r+p};
    ll cs2[4] = {2*u+2*p, 2*d+2*p, 2*l+2*p, 2*r+2*p};
    const ll inf = 1e18;
    minPQ<tuple<ll,int,int>> pq;
    vector<vector<ll>> dist(h, vector<ll> (w,inf));
    dist[sx][sy] = 0;
    pq.push({0,sx,sy});
    while(pq.size()){
        auto [d,cx,cy] = pq.top(); pq.pop();
        if(d > dist[cx][cy]) continue;
        rep(i,4){
            int nx = cx+dx[i];
            int ny = cy+dy[i];
            if(nx < 0 || nx >= h || ny < 0 || ny >= w || c[nx][ny] == '#') continue;
            ll cost = 0;
            if(c[cx][cy] == '.' && c[nx][ny] == '.') cost = cs0[i];
            else if(c[cx][cy] == '@' && c[nx][ny] == '@') cost = cs2[i];
            else cost = cs1[i];
            if(dist[nx][ny] > d+cost){
                dist[nx][ny] = d+cost;
                pq.push({dist[nx][ny],nx,ny});
            }
        }
    }
    ll res = dist[tx][ty];
    yesno(res <= k*2);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0