結果

問題 No.424 立体迷路
ユーザー fumiphysfumiphys
提出日時 2019-07-15 20:39:54
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,867 bytes
コンパイル時間 1,680 ms
コンパイル使用メモリ 173,864 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-05 07:18:28
合計ジャッジ時間 2,104 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

// includes
#include <bits/stdc++.h>
// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size
    ())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr =
    itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr;
    auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto
    titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os <<
    *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os <<
    itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end();
    ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
// types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// solve
typedef struct UnionFind_ {
vector<int> par;
vector<int> rank_;
UnionFind_(){}
explicit UnionFind_(int n): rank_(n, 0) {
par.resize(n);
for(int i = 0; i < n; i++)par[i] = i;
}
int find(int x) {
if(par[x] == x)return x;
else return par[x] = find(par[x]);
}
bool same(int x, int y) {
if(find(x) == find(y))return true;
else return false;
}
bool unite(int x, int y){
int xp = find(x);
int yp = find(y);
if(xp == yp)return false;
if(rank_[xp] > rank_[yp])par[yp] = xp;
else if(rank_[xp] < rank_[yp])par[xp] = yp;
else {
par[yp] = xp;
rank_[xp]++;
}
return true;
}
} UnionFind;
int h, w, sx, sy, gx, gy;
string b[51];
int c[51][51];
int main(int argc, char const* argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
cin >> h >> w >> sx >> sy >> gx >> gy; sx--; sy--; gx--; gy--;
rep(i, h)cin >> b[i];
rep(i, h){
rep(j, w)c[i][j] = int(b[i][j] - '0');
}
UnionFind uf(h * w);
rep(i, h){
rep(j, w){
rep(k, 4){
int nx = i + dx[k];
int ny = j + dy[k];
if(nx >= 0 && nx < h && ny >= 0 && ny < w){
if(abs(c[i][j] - c[nx][ny]) <= 1)uf.unite(i * w + j, nx * w + ny);
int nnx = nx + dx[k];
int nny = ny + dy[k];
if(nnx >= 0 && nnx < h && nny >= 0 && nny < w){
if(c[i][j] == c[nnx][nny] && c[nx][ny] < c[i][j])uf.unite(i * w + j, nnx * w + nny);
}
}
}
}
}
if(uf.same(sx * w + sy, gx * w + gy))cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0