結果

問題 No.8063 幅優先探索
ユーザー hamamuhamamu
提出日時 2020-04-01 22:58:41
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 15 ms / 2,000 ms
コード長 9,483 bytes
コンパイル時間 1,547 ms
コンパイル使用メモリ 173,060 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2024-06-27 12:25:03
合計ジャッジ時間 2,078 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 15 ms
11,008 KB
testcase_07 AC 15 ms
11,008 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 1 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

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

#include "bits/stdc++.h"
using namespace std;
using ll =long long; using dd =double; using pll =pair<ll, ll>; using tll =tuple<ll,ll,ll>;
using vll =vector<ll>; using vdd =vector<dd>; using vpll =vector<pll>; using vtll =vector<tll>;
using vvll =vector<vll>; using vvdd =vector<vdd>; using vvpll =vector<vpll>; using vvtll =vector<vtll>;
using vvvll =vector<vvll>; using vvvdd=vector<vvdd>; using vvvpll =vector<vvpll>; using vvvtll =vector<vvtll>;
using vvvvll=vector<vvvll>;using vvvvdd=vector<vvvdd>;using vvvvpll=vector<vvvpll>;using vvvvtll=vector<vvvtll>;
constexpr ll INF = 1LL << 60;
constexpr dd EPS = 1e-11;
//cin,cout
struct Fast{
Fast(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
}
} fast;
#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, S, E) REPS(i, S, E)
#define REP(i, N) REPS(i, 0, (N)-1)
#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)
#define dep(i, S, E) DEPS(i, S, E)
#define DEP(i, N) DEPS(i, 0, (N)-1)
#define EACH(e, v) for (auto&& e : v)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){T m=v[S]; REPS(i,S,E)chmax(m,v[i]); return m;}//v[S]v[E]
template<class T> inline T MinE(vector<T>&v,ll S,ll E){T m=v[S]; REPS(i,S,E)chmin(m,v[i]); return m;}//v[S]v[E]
template<class T> inline T MaxE(vector<T> &v, ll N) { return MaxE(v, 0, N - 1); } //N
template<class T> inline T MinE(vector<T> &v, ll N) { return MinE(v, 0, N - 1); }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v, (ll)v.size()); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v, (ll)v.size()); }
template<class T> inline ll MaxI(vector<T>&v,ll S,ll E){ll m=S; REPS(i,S,E){if(v[i]>v[m])m=i;} return m;}
template<class T> inline ll MinI(vector<T>&v,ll S,ll E){ll m=S; REPS(i,S,E){if(v[i]<v[m])m=i;} return m;}
template<class T> inline ll MaxI(vector<T> &v, ll N) { return MaxI(v, 0, N - 1); }
template<class T> inline ll MinI(vector<T> &v, ll N) { return MinI(v, 0, N - 1); }
template<class T> inline ll MaxI(vector<T> &v) { return MaxI(v, (ll)v.size()); }
template<class T> inline ll MinI(vector<T> &v) { return MinI(v, (ll)v.size()); }
template<class T> inline T Sum(vector<T> &v, ll S,ll E){ T s=v[S]; REPS(i,S+1,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v, ll N) { return Sum(v, 0, N - 1); }
template<class T> inline T Sum(vector<T> &v) { return Sum(v, v.size()); }
template<class T> inline ll Size(vector<T> &v){ return (ll)v.size(); }
template<class T> inline T POW(T a, ll n){ T r=1; for (; n>0; n>>=1, a*=a){ if (n&1)r*=a; } return r; }
inline ll POW(int a, ll n){ return POW((ll)a, n); }
inline ll MSB(ll a){for(ll o=63,x=-1;;){ll m=(o+x)/2; if(a<(1LL<<m))o=m; else x=m; if(o-x==1)return x;}}
inline ll CEIL(ll a, ll b){ return (a+b-1)/b; }
ll Gcd(ll a, ll b){ return (b==0) ? a : Gcd(b, a%b); }
ll Lcm(ll a, ll b){ return a * b / Gcd(a, b); }
inline vll Bit2Idx(ll m){vll v; for(ll i=0;m;m>>=1,i++) if(m&1)v.push_back(i); return move(v);}
inline ll BitNum(ll m){ for (ll c=0;; m>>=1){ c+=m&1; if (!m)return c; } }
inline ll Bit(ll s, ll i){ return (s>>i)&1; } //sibit i=0-63
inline ll BitOn(ll s, ll i){ return s|(1LL<<i); } //sibitON i=0-63
inline ll BitOff(ll s, ll i){ return s&~(1LL<<i); } //sibitOFF i=0-63
template<class T> inline ll UnderNumOf(vector<T> &v, T x){ //sortvx
return upper_bound(v.begin(), v.end(), x) - v.begin(); }
template<class T, class Pr> inline ll UnderNumOf(vector<T> &v, T x, Pr pred){ //x
return upper_bound(v.begin(), v.end(), x, pred) - v.begin(); }
template<class T> inline ll OverNumOf(vector<T> &v, T x){ //sortvx
return (ll)v.size() - (lower_bound(v.begin(), v.end(), x) - v.begin()); }
template<class T, class Pr> inline ll OverNumOf(vector<T> &v, T x, Pr pred){ //x
return (ll)v.size() - (lower_bound(v.begin(), v.end(), x, pred) - v.begin()); }
template<class T=ll> inline vector<T> cinv(ll N){ vector<T> v(N); REP(i, N)cin>>v[i]; return move(v);}
template<class T=ll, class S=ll> inline vector<pair<T, S>> cinv2(ll N){
vector<pair<T, S>> v(N); REP(i,N){cin>>v[i].first>>v[i].second;} return move(v); }
template<class T=ll,class S=ll,class R=ll> inline vector<tuple<T, S, R>> cinv3(ll N){
vector<tuple<T,S,R>> v(N); REP(i,N){cin>>get<0>(v[i])>>get<1>(v[i])>>get<2>(v[i]);} return move(v);}
template<class T=ll,class S=ll,class R=ll,class Q=ll> inline vector<tuple<T,S,R,Q>> cinv4(ll N){
vector<tuple<T,S,R,Q>> v(N); REP(i,N){cin>>get<0>(v[i])>>get<1>(v[i])>>get<2>(v[i])>>get<3>(v[i]);} return move(v);}
template<class T=ll> inline vector<vector<T>> cinvv(ll N, ll M){
vector<vector<T>> vv(N); REP(i, N) vv[i] = cinv(M); return move(vv);}
template<class T> inline void coutv(vector<T> &v, char deli=' '){
ll N=(ll)v.size(); REP(i,N){cout << v[i] << ((i==N-1)?'\n':deli);} }
template<class T> void bye(T a){cout << a << '\n'; exit(0);}
#if defined(_DEBUG)
ll dumpW = 5;
template<class T> void Dump(vector<T> &v){
REP(i, (ll)v.size()) { cerr << ((i==0)?"[":" ") << setw(dumpW) << v[i]; } cerr << "]";
}
void Dump(vll &v){
REP(i, (ll)v.size()) {
cerr << ((i==0)?"[":" ") << setw(dumpW);
if (v[i] == INF) cerr << "INF";
else if (v[i] == -INF) cerr << "-INF";
else cerr << v[i];
} cerr << "]";
}
template<class T> void Dump(vector<vector<T>> &v){
ll N=(ll)v.size(); string d[2][2]={{" ", "["}, {"\n", "]\n"}};
REP(i, N) { cerr << d[0][i==0]; Dump(v[i]); cerr << d[1][i==N-1]; }
}
template<class T> void Dump(vector<vector<vector<T>>> &v){
ll N=(ll)v.size(); string d[2]={" <", "[ <"};
REP(i, N) { cerr << d[i==0] << i << ">\n"; Dump(v[i]); } cerr << "]\n";
}
template<class T> void Dump(vector<vector<vector<vector<T>>>> &v){
ll N=(ll)v.size(); string d[2]={" ---<", "[ ---<"};
REP(i, N) { cerr << d[i==0] << i << ">---\n"; Dump(v[i]); } cerr << "]\n";
}
template<class T> void Dump(vector<vector<vector<vector<vector<T>>>>> &v){
ll N=(ll)v.size(); string d[2]={" ======<", "[ ======<"};
REP(i, N) { cerr << d[i==0] << i << ">======\n"; Dump(v[i]); } cerr << "]\n";
}
#else
template<class T> void Dump(vector<T> &v){}
template<class T> void Dump(vector<vector<T>> &v){}
template<class T> void Dump(vector<vector<vector<T>>> &v){}
template<class T> void Dump(vector<vector<vector<vector<T>>>> &v){}
template<class T> void Dump(vector<vector<vector<vector<vector<T>>>>> &v){}
#endif
struct mll{
static ll MOD;
ll val;
mll(ll v = 0): val(v % MOD){ if (val < 0) val += MOD; }
mll operator - () const { return -val; }
mll operator + (const mll &b) const { return val + b.val; }
mll operator - (const mll &b) const { return val - b.val; }
mll operator * (const mll &b) const { return val * b.val; }
mll operator / (const mll &b) const { return mll(*this) /= b; }
mll operator + (ll b) const { return *this + mll(b); }
mll operator - (ll b) const { return *this - mll(b); }
mll operator * (ll b) const { return *this * mll(b); }
friend mll operator + (ll a, const mll &b) { return b + a; }
friend mll operator - (ll a, const mll &b) { return -b + a; }
friend mll operator * (ll a, const mll &b) { return b * a; }
friend mll operator / (ll a, const mll &b) { return mll(a)/b; }
mll &operator += (const mll &b) { val=(val+b.val)%MOD; return *this; }
mll &operator -= (const mll &b) { val=(val+MOD-b.val)%MOD; return *this; }
mll &operator *= (const mll &b) { val=(val*b.val)%MOD; return *this; }
mll &operator /= (const mll &b) {
ll c=b.val, d=MOD, u=1, v=0;
while (d){
ll t = c / d;
c -= t * d; swap(c, d);
u -= t * v; swap(u, v);
}
val = val * u % MOD;
if (val < 0) val += MOD;
return *this;
}
mll &operator += (ll b) { return *this += mll(b); }
mll &operator -= (ll b) { return *this -= mll(b); }
mll &operator *= (ll b) { return *this *= mll(b); }
mll &operator /= (ll b) { return *this /= mll(b); }
bool operator == (const mll &b) { return val == b.val; }
bool operator != (const mll &b) { return val != b.val; }
bool operator == (ll b) { return *this == mll(b); }
bool operator != (ll b) { return *this != mll(b); }
friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
static mll Combination(ll a, ll b){
chmin(b, a-b);
if (b<0) return mll(0);
mll c = 1;
REP(i, b) c *= a-i;
REP(i, b) c /= i+1;
return c;
}
};
ll mll::MOD = 1000000007LL;// 998244353LL;//1000000007LL;
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;
using vvvvvmll = std::vector<vvvvmll>;
void solve()
{
ll R, C; cin >> R >> C;
ll sy, sx; cin >> sy >> sx;
ll gy, gx; cin >> gy >> gx;
vector<vector<ll>> c = cinvv<ll>(R, C);
ll ans = abs(sx-gx) + abs(sy-gy);
cout << ans << '\n';
}
int main(){
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0