#686282 (C++14) No.1638 Robot Maze

• 問題: No.1638 Robot Maze
• ユーザー: kiyoshi0205
• 提出日時: 2021-08-06 21:37:09
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 7 ms / 2,000 ms
• コード長: 5,025 bytes
• コンパイル時間: 2,933 ms
• コンパイル使用メモリ: 198,580 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-17 01:28:45
• 合計ジャッジ時間: 4,372 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	7 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	3 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	4 ms; 5,376 KB
testcase_15	AC	4 ms; 5,376 KB
testcase_16	AC	4 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	3 ms; 5,376 KB
testcase_20	AC	4 ms; 5,376 KB
testcase_21	AC	3 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	3 ms; 5,376 KB
testcase_24	AC	3 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	3 ms; 5,376 KB
testcase_28	AC	3 ms; 5,376 KB
testcase_29	AC	3 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	2 ms; 5,376 KB
testcase_32	AC	4 ms; 5,376 KB
testcase_33	AC	5 ms; 5,376 KB
testcase_34	AC	6 ms; 5,376 KB
testcase_35	AC	5 ms; 5,376 KB
testcase_36	AC	6 ms; 5,376 KB
testcase_37	AC	5 ms; 5,376 KB
testcase_38	AC	4 ms; 5,376 KB
testcase_39	AC	6 ms; 5,376 KB
testcase_40	AC	5 ms; 5,376 KB
testcase_41	AC	5 ms; 5,376 KB
testcase_42	AC	6 ms; 5,376 KB
testcase_43	AC	6 ms; 5,376 KB
testcase_44	AC	6 ms; 5,376 KB
testcase_45	AC	5 ms; 5,376 KB
testcase_46	AC	6 ms; 5,376 KB
testcase_47	AC	5 ms; 5,376 KB
testcase_48	AC	6 ms; 5,376 KB
testcase_49	AC	5 ms; 5,376 KB
testcase_50	AC	5 ms; 5,376 KB
testcase_51	AC	5 ms; 5,376 KB

コンパイルメッセージ

main.cpp: In function 'int main()':
main.cpp:149:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  149 |     auto [x,i,j]=que.top();que.pop();
      |          ^

ソースコード

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

ll modinv(ll a,const ll m=mod) noexcept{
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(const ll n,const ll r) noexcept{
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod;
    modncrlistm[n]=modinv(modncrlistp[n]);
    for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod;
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,const ll m=mod){
  if(n<0)return 0;
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);}
constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;}

ll H,W,u,d,r,l,K,p,dist[100][100];
string g[100];
using P=tuple<ll,int,int>;
int main(){
  startupcpp();
  ll i,j,Q;
  cin>>H>>W>>u>>d>>r>>l>>K>>p;
  priority_queue<P,vector<P>,greater<P>> que;
  rep(i,H)rep(j,W)dist[i][j]=inf;
  cin>>i>>j;
  que.emplace(0,--i,--j);
  ll A,B;
  cin>>A>>B;
  rep(i,H)cin>>g[i];
  while(!que.empty()){
    auto [x,i,j]=que.top();que.pop();
    if(!chmin(dist[i][j],x))continue;
    if(i){
      if(g[i-1][j]=='@')que.emplace(u+x+p,i-1,j);
      if(g[i-1][j]=='.')que.emplace(u+x,i-1,j);
    }
    if(i+1<H){
      if(g[i+1][j]=='@')que.emplace(d+x+p,i+1,j);
      if(g[i+1][j]=='.')que.emplace(d+x,i+1,j);
    }
    if(j+1<W){
      if(g[i][j+1]=='@')que.emplace(r+x+p,i,j+1);
      if(g[i][j+1]=='.')que.emplace(r+x,i,j+1);
    }
    if(j){
      if(g[i][j-1]=='@')que.emplace(l+x+p,i,j-1);
      if(g[i][j-1]=='.')que.emplace(l+x,i,j-1);
    }
  }
  if(dist[--A][--B]<=K)printyes;
  else printno;
}