結果

問題 No.424 立体迷路
ユーザー IL_mstaIL_msta
提出日時 2017-01-18 20:54:24
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,635 bytes
コンパイル時間 890 ms
コンパイル使用メモリ 111,852 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-05 07:13:09
合計ジャッジ時間 1,579 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>
#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
#include<cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define PII pair<int,int>
/////////
#ifdef getchar_unlocked
#define mygc(c) (c)=getchar_unlocked()
#else
#define mygc(c) (c)=getchar()
#endif
#ifdef putchar_unlocked
#define mypc(c) putchar_unlocked(c)
#else
#define mypc(c) putchar(c)
#endif
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
/////////
using namespace::std;
/////////
#ifdef _DEBUG
#define DEBUG_BOOL(b) assert(b)
#else
#define DEBUG_BOOL(b)
#endif
/////
#define ENABLE_READER_ON(T) \
inline void reader(T &x){int k;x = 0;bool flag = true;\
while(true){mygc(k);\
if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\
}\
if( flag ){while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 + (k - '0');}}\
else{while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 - (k-'0');}}\
}
//
ENABLE_READER_ON(int)
ENABLE_READER_ON(long)
ENABLE_READER_ON(long long)
ENABLE_READER_ON(unsigned int)
ENABLE_READER_ON(unsigned long)
ENABLE_READER_ON(unsigned long long)
//////
//
inline int reader(char c[]){int i,s=0;
for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}
c[s++]=i;
for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}
c[s]='\0';return s;
}
inline int reader(string& c,int size=100){int i;c.reserve(size);
for(;;){mygc(i);if(i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF)break;}
c.push_back(i);
for(;;){mygc(i);if(i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)break;c.push_back(i);}
return c.size();}
/////////
//
#define ENABLE_WRITER_ON(T) \
inline void writer(T x){char f[20];int s = 0;\
if (x<0){mypc('-');while(x){f[s++] = ~(x%10)+1,x /= 10;}}\
else{while(x){f[s++] = (x % 10), x /= 10;}}\
if (!s)f[s++] = 0;while (s--)mypc(f[s] + '0');}
ENABLE_WRITER_ON(int)
ENABLE_WRITER_ON(long)
ENABLE_WRITER_ON(long long)
ENABLE_WRITER_ON(unsigned int)
ENABLE_WRITER_ON(unsigned long)
ENABLE_WRITER_ON(unsigned long long)
/////////
inline void writer(const char c[]){for (int i = 0; c[i] != '\0'; i++)mypc(c[i]); }
inline void writer(const string str){writer( str.c_str() );}
///////////////////////////////////////////////////////////
//
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
//
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////
struct POS{
int X;
int Y;
};
inline void solve(){
int H,W;
reader(H);
reader(W);
vector< vector<int> > Bor(H,vector<int>(W,0));
int sx,sy,gx,gy;
reader(sx);reader(sy);reader(gx);reader(gy);
--sx;--sy;--gx;--gy;
string str;
for(int i=0;i<H;++i){
reader(str);
for(int j=0;j<W;++j){
Bor[i][j] = str[j]-'0';
}
str = "";
}
////////
vector< vector<bool> > ikeru(H,vector<bool>(W,false));
queue<POS> qu;
POS pos,next;
pos.X = sx;
pos.Y = sy;
ikeru[sx][sy] = true;
qu.push(pos);
int dx[8]={1,2,0,0,-1,-2,0,0};
int dy[8]={0,0,1,2,0,0,-1,-2};
while( !qu.empty() ){
pos = qu.front();
qu.pop();
for(int i=0;i<8;++i){
//4*2
next.X = pos.X+dx[i];
next.Y = pos.Y+dy[i];
//
if( 0 <= next.X && next.X < H && 0 <= next.Y && next.Y < W){
//
if( ikeru[next.X][next.Y] == false ){
if( i%2==0 && abs(Bor[pos.X][pos.Y] - Bor[next.X][next.Y]) <= 1 ){
//
ikeru[next.X][next.Y] = true;
qu.push(next);
}else if(i%2==1 && Bor[pos.X][pos.Y] == Bor[next.X][next.Y]
&& Bor[pos.X][pos.Y] > Bor[(pos.X+next.X)/2][(pos.Y+next.Y)/2]
){
//
//
ikeru[next.X][next.Y] = true;
qu.push(next);
}
}
}
}
}
if( ikeru[gx][gy] ){
writer("YES");
}else{
writer("NO");
}
/*cout << endl;
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
if(ikeru[i][j]){
writer("1");
}else{
writer("0");
}
}cout << endl;
}cout << endl;*/
}
int main(void){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::fixed;//10
cout << setprecision(16);//16?
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0