結果
問題 | No.20 砂漠のオアシス |
ユーザー | t9unkubj |
提出日時 | 2024-10-01 03:50:37 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 17 ms / 5,000 ms |
コード長 | 5,323 bytes |
コンパイル時間 | 3,916 ms |
コンパイル使用メモリ | 279,760 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-01 03:50:43 |
合計ジャッジ時間 | 4,735 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
#ifdef t9unkubj#include"template.h"//#include"template_no_debug.h"#else#undef _GLIBCXX_DEBUG#pragma GCC optimize("O3")#define dbg(...) 199958using namespace std;#include<bits/stdc++.h>using uint=unsigned;using ll=long long;using ull=unsigned long long;using ld=long double;using pii=pair<int,int>;using pll=pair<ll,ll>;template<class T>using vc=vector<T>;template<class T>using vvc=vc<vc<T>>;template<class T>using vvvc=vvc<vc<T>>;using vi=vc<int>;using vvi=vc<vi>;using vvvi=vc<vvi>;using vl=vc<ll>;using vvl=vc<vl>;using vvvl=vc<vvl>;template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;template<class T>using bipq=priority_queue<T>;#define rep(i,n) for(ll i=0;i<(ll)(n);i++)#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)#define drep(i,n) for(ll i=((n)-1);i>=0;i--)#define all(x) x.begin(),x.end()#define rall(x) x.rbegin(),x.rend()#define mp make_pair#define pb push_back#define eb emplace_back#define fi first#define se second#define is insert#define bg begin()#define ed end()void scan(int&a) { cin >> a; }void scan(ll&a) { cin >> a; }void scan(string&a) { cin >> a; }void scan(char&a) { cin >> a; }void scan(uint&a) { cin >> a; }void scan(ull&a) { cin >> a; }void scan(bool&a) { cin >> a; }void scan(ld&a){ cin>> a;}template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }void read() {}template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);void print(int a) { cout << a; }void print(ll a) { cout << a; }void print(string a) { cout << a; }void print(char a) { cout << a; }void print(uint a) { cout << a; }void print(bool a) { cout << a; }void print(ull a) { cout << a; }void print(double a) { cout << a; }void print(ld a){ cout<< a; }template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}void PRT() { cout <<endl; return ; }template<class T> void PRT(T a) { print(a); cout <<endl; return; }template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }template<class T,class F>bool chmin(T &x, F y){if(x>y){x=y;return true;}return false;}template<class T, class F>bool chmax(T &x, F y){if(x<y){x=y;return true;}return false;}void YesNo(bool b){cout<<(b?"Yes":"No")<<endl;}void Yes(){cout<<"Yes"<<endl;}void No(){cout<<"No"<<endl;}template<class T>int popcount(T n){return __builtin_popcountll(n);}template<class T>T sum(vc<T>&a){return accumulate(all(a),T(0));}template<class T>T max(vc<T>&a){return *max_element(all(a));}template<class T>T min(vc<T>&a){return *min_element(all(a));}template<class T>void unique(vc<T>&a){a.erase(unique(all(a)),a.end());}vvi readgraph(int n,int m,int off = -1){vvi g(n);rep(i, m){int u,v;cin>>u>>v;u+=off,v+=off;g[u].push_back(v);g[v].push_back(u);}return g;}vvi readtree(int n,int off=-1){return readgraph(n,n-1,off);}template<class T>vc<T> presum(vc<T> &a){vc<T> ret(a.size()+1);rep(i,a.size())ret[i+1]=ret[i]+a[i];return ret;}template<class T, class F>vc<T> &operator+=(vc<T> &a,F b){for (auto&v:a)v += b;return a;}template<class T, class F>vc<T> &operator-=(vc<T>&a,F b){for (auto&v:a)v-=b;return a;}template<class T, class F>vc<T> &operator*=(vc<T>&a,F b){for (auto&v:a)v*=b;return a;}#endifdouble pass_time=0;void solve(){INT(n,v,oy,ox);--ox,--oy;VVC(int,l,n,n);vvvl dp(n,vvl(n,vl(2)));dp[0][0][0]=v;bipq<array<ll,4>>que;que.push({v,0,0,0});vi dx={1,0,-1,0},dy{0,1,0,-1};while(que.size()){auto [p,q,r,use]=que.top();que.pop();if(dp[q][r][use]!=p)continue;rep(k,4){int x=q+dx[k],y=r+dy[k];if(x>=0&&x<n&&y>=0&&y<n){if(p>l[x][y]){int nxt_use=use;int np=p-l[x][y];if(x==ox&&y==oy&&use==0)np*=2,nxt_use=1;if(chmax(dp[x][y][nxt_use],np)){que.push({np,x,y,nxt_use});}}}}}rep(i,n)rep(j,n)rep(k,2)if(dp[i][j][k])dbg(i,j,k,dp[i][j][k]);cout<<(max(dp[n-1][n-1])>0?"YES\n":"NO\n");}signed main(){#ifdef t9unkubjfreopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);#endifcin.tie(0)->sync_with_stdio(0);pass_time=clock();int t=1;//cin>>t;while(t--)solve();pass_time=clock()-pass_time;dbg(pass_time/CLOCKS_PER_SEC);}