結果

問題 No.424 立体迷路
ユーザー TKTYITKTYI
提出日時 2022-08-15 03:38:22
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 3,326 bytes
コンパイル時間 3,983 ms
コンパイル使用メモリ 247,348 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-01 18:14:42
合計ジャッジ時間 4,747 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
using mint=modint1000000007;
//using mint=modint998244353;
const ll mod=1000000007;
//const ll mod=998244353;
//using mint=modint;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
vector<ll>fast_mod_convolution(vector<ll>&a,vector<ll>&b,ll mod){
const ll m1=167772161,m2=469762049,m3=1224736769;
const ll m1_inv_m2=inv_mod(m1,m2);
const ll m12_inv_m3=inv_mod(m1*m2,m3);
const ll m12_mod=m1*m2%mod;
auto x=convolution<m1>(a,b);
auto y=convolution<m2>(a,b);
auto z=convolution<m3>(a,b);
vector<ll>ret(sz(a)+1);
REP(i,sz(a)+1){
ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;
ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;
ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;
}
return ret;
}
int main(){
ll H,W;cin>>H>>W;
PA s,G;cin>>s>>G;
s.F--;s.S--;G.F--;G.S--;
vector<string>S(H);cin>>S;
vector<vector<bool>>DP(H,vector<bool>(W));
DP[s.F][s.S]=1;
queue<ll>X,Y;
X.emplace(s.F);
Y.emplace(s.S);
while(sz(X)){
ll x=X.front(),y=Y.front();
X.pop();Y.pop();
if(x&&abs(S[x-1][y]-S[x][y])<2&&!DP[x-1][y]){DP[x-1][y]=1;X.emplace(x-1);Y.emplace(y);}
if(x<H-1&&abs(S[x+1][y]-S[x][y])<2&&!DP[x+1][y]){DP[x+1][y]=1;X.emplace(x+1);Y.emplace(y);}
if(y&&abs(S[x][y-1]-S[x][y])<2&&!DP[x][y-1]){DP[x][y-1]=1;X.emplace(x);Y.emplace(y-1);}
if(y<W-1&&abs(S[x][y+1]-S[x][y])<2&&!DP[x][y+1]){DP[x][y+1]=1;X.emplace(x);Y.emplace(y+1);}
if(x>1&&S[x-2][y]==S[x][y]&&S[x-1][y]<S[x][y]&&!DP[x-2][y]){DP[x-2][y]=1;X.emplace(x-2);Y.emplace(y);}
if(x<H-2&&S[x+2][y]==S[x][y]&&S[x+1][y]<S[x][y]&&!DP[x+2][y]){DP[x+2][y]=1;X.emplace(x+2);Y.emplace(y);}
if(y>1&&S[x][y-2]==S[x][y]&&S[x][y-1]<S[x][y]&&!DP[x][y-2]){DP[x][y-2]=1;X.emplace(x);Y.emplace(y-2);}
if(y<W-2&&S[x][y+2]==S[x][y]&&S[x][y+1]<S[x][y]&&!DP[x][y+2]){DP[x][y+2]=1;X.emplace(x);Y.emplace(y+2);}
}
if(DP[G.F][G.S])cout<<"YES"<<endl;else cout<<"NO"<<endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0