結果

問題 No.1572 XI
ユーザー 👑 tute7627tute7627
提出日時 2021-06-29 08:06:12
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 383 ms / 2,000 ms
コード長 8,591 bytes
コンパイル時間 2,441 ms
コンパイル使用メモリ 218,692 KB
実行使用メモリ 59,520 KB
最終ジャッジ日時 2024-06-25 17:26:03
合計ジャッジ時間 11,318 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,940 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 71 ms
15,104 KB
testcase_05 AC 167 ms
30,464 KB
testcase_06 AC 209 ms
35,968 KB
testcase_07 AC 6 ms
6,944 KB
testcase_08 AC 177 ms
31,360 KB
testcase_09 AC 82 ms
16,640 KB
testcase_10 AC 134 ms
25,216 KB
testcase_11 AC 11 ms
6,940 KB
testcase_12 AC 65 ms
12,928 KB
testcase_13 AC 14 ms
6,940 KB
testcase_14 AC 62 ms
13,312 KB
testcase_15 AC 14 ms
6,940 KB
testcase_16 AC 49 ms
11,520 KB
testcase_17 AC 5 ms
6,940 KB
testcase_18 AC 75 ms
15,232 KB
testcase_19 AC 186 ms
32,640 KB
testcase_20 AC 123 ms
22,016 KB
testcase_21 AC 227 ms
37,376 KB
testcase_22 AC 172 ms
29,952 KB
testcase_23 AC 5 ms
6,940 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 2 ms
6,940 KB
testcase_26 AC 2 ms
6,940 KB
testcase_27 AC 1 ms
6,940 KB
testcase_28 AC 2 ms
6,940 KB
testcase_29 AC 2 ms
6,940 KB
testcase_30 AC 2 ms
6,940 KB
testcase_31 AC 1 ms
6,944 KB
testcase_32 AC 2 ms
6,944 KB
testcase_33 AC 1 ms
6,940 KB
testcase_34 AC 339 ms
54,272 KB
testcase_35 AC 327 ms
53,888 KB
testcase_36 AC 339 ms
55,040 KB
testcase_37 AC 380 ms
57,216 KB
testcase_38 AC 356 ms
56,064 KB
testcase_39 AC 357 ms
56,448 KB
testcase_40 AC 338 ms
52,480 KB
testcase_41 AC 354 ms
54,784 KB
testcase_42 AC 354 ms
55,680 KB
testcase_43 AC 350 ms
54,656 KB
testcase_44 AC 383 ms
59,392 KB
testcase_45 AC 376 ms
59,520 KB
testcase_46 AC 368 ms
59,392 KB
testcase_47 AC 88 ms
59,008 KB
testcase_48 AC 365 ms
59,392 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
  return ord;
}
ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
  Graph<T>ret(g.size());
  for(int i=0;i<g.size();i++){
    for(auto e:g[i]){
      int to = e.to;
      e.to = i;
      ret[to].push_back(e);
    }
  }
  return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v;
    T w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}

template<typename T>
struct Dice{
  array<T, 6>ar;
  Dice() = default;
  // 1
  //342
  // 0
  // 5
  Dice(array<T, 6>ar):ar(ar){}
  //xが上下、yが左右
  //0:x++
  //1:x--
  //2:y++
  //3:y--
  //4:clockwise
  //5:counter-clockwise
  void roll(int x){
    array<int, 6>trans;
    if(x == 0)ar = {ar[4],ar[5],ar[2],ar[3],ar[1],ar[0]};
    if(x == 1)ar = {ar[5],ar[4],ar[2],ar[3],ar[0],ar[1]};
    if(x == 2)ar = {ar[0],ar[1],ar[4],ar[5],ar[3],ar[2]};
    if(x == 3)ar = {ar[0],ar[1],ar[5],ar[4],ar[2],ar[3]};
    if(x == 4)ar = {ar[2],ar[3],ar[1],ar[0],ar[4],ar[5]};
    if(x == 5)ar = {ar[3],ar[2],ar[0],ar[1],ar[4],ar[5]};
  }
  bool operator==(const Dice &d) const{
    return ar == d.ar;
  }
  bool operator!=(const Dice &d) const{
    return ar != d.ar;
  }
  bool operator<(const Dice &d) const{
    return ar < d.ar;
  }
  T &operator[](int x) const{
    return ar[x];
  }
  T &operator[](int x){
    return ar[x];
  }
  vector<Dice<T>>makeAll(){
    vector<Dice<T>>ret;
    for(int i=0;i<6;i++){
      Dice tmp = *this;
      if(i==1)tmp.roll(0);
      if(i==2)tmp.roll(1);
      if(i==3)tmp.roll(1),tmp.roll(1);
      if(i==4)tmp.roll(4);
      if(i==5)tmp.roll(5);
      for(int k=0;k<4;k++){
        ret.push_back(tmp);
        tmp.roll(2);
      }
    }
    return ret;
  }
  Dice<T> minDice(){
    auto dice = this->makeAll();
    return *min_element(dice.begin(), dice.end());
  }

};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll h,w;cin>>h>>w;
  ll sx,sy;cin>>sx>>sy;
  ll gy,gx;cin>>gx>>gy;
  sy--;sx--;gx--;gy--;
  auto t=vec(6,4,0);
  rep(i,0,6){
    Dice<ll>dice({0,0,0,0,0,0});
    dice[i]=1;
    rep(j,0,4){
      auto tmp=dice;
      tmp.roll(j);
      rep(o,0,6){
        if(tmp[o]==1)t[i][j]=o;
      }
    }
  }
  vector<string>ss(h);
  rep(i,0,h)cin>>ss[i];
  struct z{
    ll x,y,s;
  };
  queue<z>que;
  auto d=make_v(h,w,6,-1);
  que.push({sx,sy,4});
  d[sx][sy][4]=0;
  while(!que.empty()){
    auto [x,y,s]=poll(que);
    rep(i,0,4){
      ll nx=x+dx[i],ny=y+dy[i],ns=t[s][i];
      if(nx<0||nx>=h||ny<0||ny>=w||d[nx][ny][ns]!=-1||ss[nx][ny]=='#')continue;
      d[nx][ny][ns]=d[x][y][s]+1;
      que.push({nx,ny,ns});
    }
  }
  cout<<d[gx][gy][4]<<endl;
  return 0;
}
0