結果
問題 | No.8063 幅優先探索 |
ユーザー | haruki_K |
提出日時 | 2020-04-01 22:03:35 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,793 bytes |
コンパイル時間 | 1,794 ms |
コンパイル使用メモリ | 180,308 KB |
実行使用メモリ | 12,288 KB |
最終ジャッジ日時 | 2024-06-27 10:55:22 |
合計ジャッジ時間 | 2,287 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | RE | - |
testcase_04 | WA | - |
testcase_05 | RE | - |
testcase_06 | WA | - |
testcase_07 | AC | 37 ms
12,288 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
ソースコード
// >>> TEMPLATES #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1; auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1; auto constexpr INF = numeric_limits<int>::max()/2-1; #ifdef LOCAL #include "debug.hpp" #define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__) #define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl #define debug if (1) #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template <class T> using pque_max = priority_queue<T>; template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >; template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type> ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; } template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type> istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; } template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template <class F> struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward<F>(f)) {} template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); } }; struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template <class T, size_t d> struct vec_impl { using type = vector<typename vec_impl<T,d-1>::type>; template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); } }; template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } }; template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type; template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); } template <class T> void quit(T const& x) { cout << x << endl; exit(0); } template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; } template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; } template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); } template <class T> int sz(T const& x) { return x.size(); } template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(v.begin(), v.end(), x)-v.begin(); } template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(v.begin(), v.end(), x)-v.begin(); } template <class C, class F> int ppt(C const& v, F f) { return partition_point(v.begin(), v.end(), f)-v.begin(); } // <<< constexpr int dx[] = { 1,0,-1,0 }; constexpr int dy[] = { 0,1,0,-1 }; int32_t main() { int r,c; cin >> r >> c; int sx,sy; cin >> sx >> sy; --sx,--sy; sy = c-1-sy; //sx = r-1-sx; int gx,gy; cin >> gx >> gy; --gx,--gy; gy = c-1-gy; //gx = r-1-gx; vector<string> s(r); cin >> s; assert(s[sx][sy] == '.'); assert(s[gx][gy] == '.'); auto valid = [&](int i, int j) { return (0 <= i && i < r && 0 <= j && j < c && s[i][j] == '.'); }; auto d = make_v<int,2>(r,c,INF); d[sx][sy] = 0; queue<pair<int,int>> q; q.emplace(sx,sy); while (q.size()) { int i,j; tie(i,j) = q.front(); q.pop(); rep (k,4) { int ni = i+dx[k]; int nj = j+dy[k]; if (valid(ni,nj) && chmin(d[ni][nj], d[i][j]+1)) { q.emplace(ni,nj); } } } cout << d[gx][gy] << endl; }