結果

問題 No.2096 Rage With Our Friends
ユーザー 👑 tute7627tute7627
提出日時 2022-10-08 03:22:12
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 817 ms / 5,000 ms
コード長 9,879 bytes
コンパイル時間 3,288 ms
コンパイル使用メモリ 224,592 KB
実行使用メモリ 63,500 KB
最終ジャッジ日時 2024-06-13 02:41:54
合計ジャッジ時間 9,824 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 384 ms
54,824 KB
testcase_12 AC 817 ms
63,500 KB
testcase_13 AC 413 ms
54,952 KB
testcase_14 AC 515 ms
54,908 KB
testcase_15 AC 390 ms
55,032 KB
testcase_16 AC 2 ms
6,944 KB
testcase_17 AC 463 ms
54,824 KB
testcase_18 AC 2 ms
6,940 KB
testcase_19 AC 2 ms
6,940 KB
testcase_20 AC 2 ms
6,944 KB
testcase_21 AC 570 ms
54,928 KB
testcase_22 AC 571 ms
54,800 KB
testcase_23 AC 27 ms
6,944 KB
testcase_24 AC 359 ms
36,204 KB
testcase_25 AC 201 ms
20,556 KB
testcase_26 AC 110 ms
14,304 KB
testcase_27 AC 109 ms
14,504 KB
testcase_28 AC 3 ms
6,940 KB
testcase_29 AC 55 ms
8,704 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 UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#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 make_pair(v[i],i)<make_pair(v[j],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 make_pair(v[i],-i)>make_pair(v[j],-j);});
  return ord;
}
template<typename T> vector<T> inv_perm(const vector<T>&ord){
  vector<T>inv(ord.size());
  for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
  return inv;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);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;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
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;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}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,typename F,int dim>
struct MultiGraph{
  using A=array<int,dim>;
  A init;
  int sz;
  const F &f;
  //f:(array)->vector<pair(array,cost)>
  MultiGraph(A init, const F &f):init(init),f(f){
    sz = 1;
    for(auto s:init)sz *= s;
  }
  int to_id(A state){
    int ret = 0;
    for(int i = 0; i < init.size(); i++){
      ret *= init[i];
      ret += state[i];
    }
    return ret;
  }
  A from_id(int id){
    A ret;
    for(int i = init.size() - 1; i >= 0; i--){
      ret[i] = id % init[i];
      id /= init[i];
    }
    return ret;
  }
  vector<edge<T>> operator[](int id){
    vector<edge<T>>ret;
    auto edges = f(from_id(id));
    ret.reserve(edges.size());
    for(int i = 0; i < edges.size(); i++){
      ret.emplace_back(to_id(edges[i].first), edges[i].second);
    }
    return ret;
  }
  int size(){
    return sz;
  }
};

/*
  using A=array<int,2>;
  auto f=[&](A state)->vector<pair<A,int>>{
    auto [i,j]=state;
    vector<pair<A,int>>ret;
    ret.reserve(4);
    rep(o,0,4){
      int ni=i+dx[o],nj=j+dy[o];
      if(ni<0||nj<0||ni>=h||nj>=w)continue;
      ret.EB(A{ni,nj},1);
    }
    return ret;
  };
  MultiGraph<int,decltype(f),2>g(A{h,w},f);
*/
template<typename G>
vector<ll> bfs01(G &g,const vector<int>&s){
  vector<ll>dist(g.size(),INF);
  vector<bool>used(g.size());
  deque<int>deq;
  int n=g.size();
  for(auto v:s){
    deq.push_back(v);
    dist[v]=0;
  }
  while(!deq.empty()){
    int x=deq.front();
    deq.pop_front();
    if(used[x])continue;
    used[x]=true;
    for(auto e:g[x]){
      if(dist[e.to]>dist[x]+e.cost){
        dist[e.to]=dist[x]+e.cost;
        if(e.cost==0)deq.push_front(e.to);
        else deq.push_back(e.to);
      }
    }
  }
  return dist;
}
template<typename G>
vector<ll>bfs01(G &g,int s=0){
  return bfs01(g,vector<int>(1,s));
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  int h,w;cin>>h>>w;
  int sx,sy,gx,gy;cin>>sx>>sy>>gx>>gy;
  sx--;sy--;gx--;gy--;
  vector<string>s(h);
  rep(i,0,h)cin>>s[i];
  auto mx=vec(h,w,0);
  rep(j,0,w){
    int cnt=0;
    rep(i,0,h){
      if(s[i][j]=='.')cnt=0;
      mx[i][j]=cnt;
      cnt++;
    }
  }
  using A=array<int,2>;
  auto f=[&](A state)->vector<pair<A,int>>{
    auto [i,j]=state;
    vector<pair<A,int>>ret;
    ret.reserve(6);
    if(i>0){
      ret.EB(A{i-1,j},0);
    }
    if(s[i][j]=='.'){
      if(j>0)ret.EB(A{min(h-1,i+1),j-1},0);
      if(j<w-1)ret.EB(A{min(h-1,i+1),j+1},0);
    }
    if(s[i][j]=='.'){
      ret.EB(A{min(h-1,i+1),j},1);
      for(auto z:{j-2,j+2}){
        if(z<0||z>=w)continue;
        int d=mx[i][(j+z)/2];
        ret.EB(A{min(h-1,i+1),z},1);
        ret.EB(A{min(h-1,i-d+d/2+1),z},0);
      }
    }
    return ret;
  };
  MultiGraph<int,decltype(f),2>g(A{h,w},f);
  auto d=bfs01(g,g.to_id(A{sx,sy}));
  //debug(mx);
  anss(d[g.to_id(A{gx,gy})],INF,-1);
  return 0;
}
0