結果

問題 No.424 立体迷路
ユーザー koyumeishikoyumeishi
提出日時 2016-09-22 22:33:33
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,457 bytes
コンパイル時間 1,789 ms
コンパイル使用メモリ 116,544 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-05 07:00:17
合計ジャッジ時間 2,566 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;
namespace {
using Integer = long long; //__int128;
template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
template<class T> istream& operator , (istream& is, T& val){ return is >> val;}
template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "
      ); return os;}
template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}
template<class H> void print(const H& head){ cout << head; }
template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }
template<class H> void eprint(const H& head){ cerr << head; }
template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }
class range{
long long start_, end_, step_;
public:
struct range_iterator{
long long val, step_;
range_iterator(long long v, long long step) : val(v), step_(step) {}
long long operator * (){return val;}
void operator ++ (){val += step_;}
bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}
};
range(long long len) : start_(0), end_(len), step_(1) {}
range(long long start, long long end) : start_(start), end_(end), step_(1) {}
range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}
range_iterator begin(){ return range_iterator(start_, step_); }
range_iterator end(){ return range_iterator( end_, step_); }
};
string operator "" _s (const char* str, size_t size){ return move(string(str)); }
constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M
      ) : my_pow_mod(x*x%M,k>>1,M,z);}
constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }
inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed
mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());
template<class T> string join(const vector<T>& v, const string& sep){
stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();
}
string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;
int dx[] = {0, 0, 1,-1, 1, 1,-1,-1};
int dy[] = {1,-1, 0, 0, 1,-1, 1,-1};
int main(){
int h,w;
cin >> h,w;
vector<int> s(2),g(2);
cin >> s,g;
s[0]--; s[1]--;
g[0]--; g[1]--;
vector<string> b(h);
cin >> b;
vector<vector<bool>> v(h, vector<bool>(w, false));
queue<int> q;
q.push(s[0]*w + s[1]);
v[s[0]][s[1]] = true;
while(q.size()){
int p = q.front();
q.pop();
int r = p/w;
int c = p%w;
for(int k__=0; k__<4; k__++){
int new_x = c + dx[k__];
int new_y = r + dy[k__];
if(new_x < 0 || new_x >= w || new_y < 0 || new_y >= h) continue;
if( abs(b[r][c] - b[new_y][new_x]) > 1 ) continue;
int unko = new_y*w + new_x;
if(v[new_y][new_x]) continue;
v[new_y][new_x] = true;
q.push(unko);
}
for(int k__=0; k__<4; k__++){
int new_x = c + 2*dx[k__];
int new_y = r + 2*dy[k__];
if(new_x < 0 || new_x >= w || new_y < 0 || new_y >= h) continue;
if( abs(b[r][c] - b[new_y][new_x]) != 0 ) continue;
int new_x_ = c + dx[k__];
int new_y_ = r + dy[k__];
if( b[r][c] < b[new_y_][new_x_] ) continue;
int unko = new_y*w + new_x;
if(v[new_y][new_x]) continue;
v[new_y][new_x] = true;
q.push(unko);
}
}
println(v[g[0]][g[1]] ? "YES" : "NO");
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0