結果

問題 No.20 砂漠のオアシス
コンテスト
ユーザー daleksprinter
提出日時 2019-03-17 17:15:39
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,108 bytes
コンパイル時間 1,876 ms
コンパイル使用メモリ 180,908 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-07 04:44:35
合計ジャッジ時間 2,863 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 14 WA * 7
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;

/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define isin(a, b, c) (b <= a && a <= c)
#define println cout << "\n";
#define sz(v) (int)v.size()
#define bin(x) static_cast<bitset<16> >(x)



/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef tuple<int, int, int> ti;
typedef map<int, int> mi;
typedef set<int> si;


/* constant */
const int inf = 1LL << 62;
const int mod = 1e9 + 7;
const int dx[8]={1,0,-1,0,-1,1,-1,1};
const int dy[8]={0,1,0,-1,-1,-1,1,1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";

/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T, class U, class V> void printx(tuple<T, U, V> t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}
template<class T> void printans(vec<T> v){rep(i,0,sz(v)){cout << v[i] << (i == sz(v) - 1 ? "" : " ");}cout << endl;}


/* general_method */
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; }
template<class T>T cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);}

/* main */

int n, v, ox, oy;
int arr[200][200];
void in(){
    cin >> n >> v >> ox >> oy;
    rep(i,0,n){
        rep(j,0,n){
            cin >> arr[i][j];
        }
    }
}

int getid(int x, int y){
    return y * n + x;
}

void solve(){
    
    vec<vi> dist(n, vi(n, inf));
    dist[0][0] = 0;
    priority_queue<pi, vec<pi>, greater<pi>> que;
    que.push(pi(0, 0));

    while(not que.empty()){

        int x = que.top().second % n;
        int y = que.top().second / n;
        int d = que.top().first;
        que.pop();

        if(dist[y][x] < d) continue;

        rep(i,0,4){
            int tx = x + dx[i];
            int ty = y + dy[i];
            if(!(isin(tx, 0, n - 1) && isin(ty, 0, n - 1))) continue;

            if(chmin(dist[ty][tx], dist[y][x] + arr[ty][tx])){
                que.push(pi(dist[ty][tx], ty * n + tx));
            }
        }

    }
    vec<vi> dist2(n, vi(n, inf));
    dist2[n - 1][n - 1] = 0;
    priority_queue<pi, vec<pi>, greater<pi>> que2;
    que2.push(pi(0, getid(n - 1, n - 1)));

    while(not que2.empty()){

        int x = que2.top().second % n;
        int y = que2.top().second / n;
        int d = que2.top().first;
        que2.pop();

        if(dist2[y][x] < d) continue;

        rep(i,0,4){
            int tx = x + dx[i];
            int ty = y + dy[i];
            if(!(isin(tx, 0, n - 1) && isin(ty, 0, n - 1))) continue;

            if(chmin(dist2[ty][tx], dist2[y][x] + arr[ty][tx])){
                que2.push(pi(dist2[ty][tx], ty * n + tx));

            }
        }

    }

    if(dist[n - 1][n - 1] <= v){
        print("YES");
    }else if(ox != 0 && dist[oy - 1][ox - 1] >= v){
        int rest = v - dist[oy - 1][ox - 1];
        rest *= 2;
        cout << (dist2[oy - 1][ox - 1] <= rest ? "YES" : "NO");
    }else{
        cout << "NO" << endl;
    }




}

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    in();
    solve();
    
}
0