#1173461 (C++23) No.3599 Queen Moving Query

• 問題: No.3599 Queen Moving Query
• ユーザー: TKTYI
• 提出日時: 2026-07-24 23:56:30
• 言語: C++23 (gcc 15.2.0 + boost 1.90.0)
• 結果: WA
• 実行時間: -
• コード長: 4,468 bytes
• コンパイル時間: 4,512 ms
• コンパイル使用メモリ: 394,816 KB
• 実行使用メモリ: 73,444 KB
• 最終ジャッジ日時: 2026-07-24 23:56:56
• 合計ジャッジ時間: 25,413 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_0

ファイルパターン	結果
sample	AC * 2
other	AC * 22 WA * 4

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll H,W,x,y;cin>>H>>W>>x>>y;x--;y--;
  vector<string>S(H);cin>>S;
  vector<vector<pl>>E(1e6);
  
  ll V=H*W;
  rep(i,0,H)rep(j,0,W)if(S[i][j]=='.'){
  	ll k=j;
  	while(j<W&&S[i][j]=='.')j++;
  	rep(l,k,j){
  	  E[i*W+l].emplace_back(V,1);
  	  E[V].emplace_back(i*W+l,0);
  	}
  	V++;
  }
  rep(j,0,W)rep(i,0,H)if(S[i][j]=='.'){
  	ll k=i;
  	while(i<H&&S[i][j]=='.')i++;
  	rep(l,k,i){
  	  E[l*W+j].emplace_back(V,1);
  	  E[V].emplace_back(l*W+j,0);
  	}
  	V++;
  }
  rep(i,0,H)rep(j,0,W)if(S[i][j]=='.')if(i==0||j==0||S[i-1][j-1]=='#'){
  	ll t=0;
  	while(i+t<H&&j+t<W&&S[i+t][j+t]=='.')t++;
  	rep(k,0,t){
  	  E[(i+k)*W+j+k].emplace_back(V,1);
  	  E[V].emplace_back((i+k)*W+j+k,0);
  	}
  	V++;
  }
  rep(i,0,H)rep(j,0,W)if(S[i][j]=='.')if(i==H-1||j==0||S[i+1][j-1]=='#'){
  	ll t=0;
  	while(i-t>=0&&j+t<W&&S[i-t][j+t]=='.')t++;
  	rep(k,0,t){
  	  E[(i-k)*W+j+k].emplace_back(V,1);
  	  E[V].emplace_back((i-k)*W+j+k,0);
  	}
  	V++;
  }
  
  vl D(1e6,1e18);
  D[x*W+y]=0;
  min_priority_queue<pl>Q;
  Q.emplace(0,x*W+y);
  while(sz(Q)){
  	auto[d,v]=Q.top();Q.pop();
  	if(d!=D[v])continue;
  	for(auto[u,w]:E[v])if(chmin(D[u],d+w))Q.emplace(D[u],u);
  }
  vector<pl>DD(1e6,pl(1e18,1e18));
  rep(i,H*W,V)if(D[i]<1e17){
  	vector<pl>U;
  	for(auto[j,w]:E[i])U.emplace_back(D[j],j);
  	sort(all(U));
  	if(sz(U)==1)continue;
  	assert(U.back().F<U[0].F+2);
  	rep(j,0,sz(U)){
  	  ll k=j;
  	  while(j<sz(U)&&U[k].F==U[j].F)j++;
  	  if(j-k>=2)rep(l,k,j)chmin(DD[U[l].S],pl(U[l].F+1,-1));
  	  j--;
  	}
  }
  rep(i,0,1e6)if(DD[i].F<1e17)Q.emplace(DD[i].F,i);
  while(sz(Q)){
  	auto[d,v]=Q.top();Q.pop();
  	if(d!=DD[v].F)continue;
  	if(v<H*W){
		  for(auto[u,w]:E[v]){
  		  if(DD[u].F>d+1){
  		  	if((D[u]+d+1)%2)DD[u]=pl(d+1,v),Q.emplace(DD[u].F,u);
  		  	else if(sz(E[u])>2){
  		  		if(chmin(DD[u].F,d+4))DD[u]=pl(d+4,v),Q.emplace(DD[u].F,u);
  		  		else if(DD[u].F==d+4)DD[u].S=-1,Q.emplace(DD[u].F,u);
  		  	}
  		  }
  		  else if(DD[u].F==d+1&&DD[u].S!=-1)DD[u].S=-1,Q.emplace(DD[u].F,u);
		  }
  	}
  	else{
  	  for(auto[u,w]:E[v])if(DD[v].S!=u){
  	  	if((D[u]+d)%2){if(chmin(DD[u].F,d))Q.emplace(DD[u].F,u);}
  	  	else if(sz(E[v])>2){if(chmin(DD[u].F,d+1))Q.emplace(DD[u].F,u);}
  	  }
  	}
  }
  ll _;cin>>_;
  while(_--){
  	ll a,b,T;cin>>a>>b>>T;a--;b--;
  	if(D[a*W+b]>T){cout<<"No"<<endl;continue;}
  	if((T+D[a*W+b])%2==0){cout<<"Yes"<<endl;continue;}
  	if(DD[a*W+b].F>T){cout<<"No"<<endl;continue;}
  	cout<<"Yes"<<endl;
  }
  return 0;
}