結果

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

ソースコード

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

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define P(p) cout<<(p)<<endl;
#define VEC_2D(a,b) vector<vector<int> >(a, vector<int>(b, 0))
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define INF (1100000000)
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MOD 1000000007LL
#define FSP(a) cout << fixed << setprecision(a)
int gcd(int x, int y) {
if (y == 0) return x;
else return gcd(y, x%y);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
bool is_prime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return n != 1;
}
map<int, int> prime_factor(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1) res[n] = 1;
return res;
}
int extgcd(int a, int b, int& x, int& y) {//
int d = a;
if (b != 0) {
d = extgcd(b, a%b, y, x);
y -= (a / b)*x;
}
else {
x = 1; y = 0;
}
return d;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0) return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1) res = res * x % mod;
return res;
}
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
bool is_kadomatsu(int a, int b, int c) {
if (a == b || a == c || b == c)return false;
if (a > b && c > b) return true;
if (a < b && c < b)return true;
return false;
}
struct UF {
int n;
vi d;
UF(){}
UF(int n):n(n),d(n,-1){}
int root(int v) {
if (d[v] < 0) return v;
return d[v] = root(d[v]);
}
bool unite(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (size(x) < size(y)) swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
int size(int v) { return -d[root(v)]; }
};
vector<int> divisor(int n) {
if (n == 1) return{};
vi res;
for (int i = 1; i*i <= n; i++) {
if (n%i == 0) {
res.emplace_back(i);
if (i != 1 && i != n / i)res.emplace_back(n / i);
}
}
return res;
}
//-------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int dy[] = { 1,0,-1,0 };
int dx[] = { 0,1,0,-1 };
int h, w, sx, sy, gx, gy;
string b[55];
bool used[55][55];
cin >> h >> w >> sy >> sx >> gy >> gx;
sx--; sy--; gx--; gy--;
rep(i, h)cin >> b[i];
rep(i, 55)rep(j, 55)used[i][j] = false;
queue<pii> q;
q.push(make_pair(sy, sx));
used[sy][sx] = true;
while (!q.empty()) {
auto n = q.front(); q.pop();
if (n.first == gy && n.second == gx) break;
int hh = b[n.first][n.second] - '0';
rep(i, 4) {
int ny = n.first + dy[i], nx = n.second + dx[i];
if (!(0 <= ny&&ny < h && 0 <= nx&&nx < w))continue;
if (used[ny][nx]) continue;
int nh = b[ny][nx] - '0';
if (abs(nh - hh) <= 1) {
used[ny][nx] = true;
q.push(make_pair(ny, nx));
}
}
rep(i, 4) {
int ny = n.first + 2 * dy[i], nx = n.second + 2 * dx[i];
if (!(0 <= ny && ny < h && 0 <= nx&&nx < w)) continue;
if (used[ny][nx]) continue;
int nh = b[ny][nx] - '0';
int ah = b[(ny + n.first) / 2][(nx + n.second) / 2] - '0';
if (hh - ah > 0 && nh == hh) {
used[ny][nx] = true;
q.push(make_pair(ny, nx));
}
}
}
if (used[gy][gx]) { P("YES"); }
else P("NO");
return 0;
//ifstream ifs("soc-LiveJournal1.txt"); //
//ofstream output("soc-LiveJournal2.txt");
//int u, v;
//string s;
//bool is_0_start = false;
//int count = 0;
//rep(i, 4) getline(ifs, s);
//for (; ifs >> u >> v;) {
// if (u == 0) is_0_start = true;
// if (!is_0_start) {
// u--;
// v--;
// }
// count++;
// if(count%10000==0)cout << count << endl;
// output << u << " " << v << endl;
//}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0