就是题解写的这样了
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#define X first
#define Y second
using namespace std;
typedef pair<int,int> abcd;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
inline void read(char *s){
char c=nc(); int len=0;
for (;!(c=='.' || c=='#');c=nc());
for (;c=='.' || c=='#';s[++len]=c,c=nc());
}
const int dx[]={0,0,1,-1,1,1,-1,-1};
const int dy[]={1,-1,0,0,1,-1,1,-1};
const int N=1005;
int fat[N*N];
inline void init(int n){
for (int i=1;i<=n;i++) fat[i]=i;
}
inline int Fat(int u){
return u==fat[u]?u:fat[u]=Fat(fat[u]);
}
int n;
char Map[N][N];
int val[N][N];
abcd Q[N*N]; int l,r;
#define P(x,y) (((x)-1)*n+(y))
inline void bfs(){
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) if (Map[i][j]=='#') Q[++r]=abcd(i,j),val[i][j]=0; else val[i][j]=1<<30;
while (l<r){
abcd u=Q[++l]; int x,y;
for (int k=0;k<8;k++){
x=u.X+dx[k]; y=u.Y+dy[k];
if (x<1 || y<1 || x>n || y>n || val[x][y]!=1<<30) continue;
val[x][y]=val[u.X][u.Y]+1;
Q[++r]=abcd(x,y);
}
}
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) if (val[i][j]) val[i][j]=val[i][j]*2-1;
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) val[i][j]=min(val[i][j],2*min(min(i,j),min(n-i+1,n-j+1))-1);
}
const int M=300005;
struct edge{
int u,v,next; int idx;
}G[N*N*2+M*2];
int head[N*N],inum;
inline void add(int u,int v,int p,int *head){
G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}
int vst[N][N];
int root[N*N];
vector<abcd> Vec[1005];
inline void Build(){
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) Vec[val[i][j]].push_back(abcd(i,j));
init(n*n);
for (int d=n;d;d--)
for (int j=0;j<(signed)Vec[d].size();j++){
abcd u=Vec[d][j]; int x,y; vst[u.X][u.Y]=1;
if (!val[u.X][u.Y]) break;
for (int k=0;k<4;k++){
x=u.X+dx[k]; y=u.Y+dy[k];
if (x<1 || y<1 || x>n || y>n || !vst[x][y]) continue;
if (Fat(P(x,y))!=P(u.X,u.Y)){
root[Fat(P(x,y))]=1;
add(P(u.X,u.Y),Fat(P(x,y)),++inum,head);
fat[Fat(P(x,y))]=P(u.X,u.Y);
}
}
}
}
int m;
int qhead[N*N];
int ans[M];
int tag[N*N];
#define V G[p].v
int cur;
inline void dfs(int u){
tag[u]=cur;
for (int p=head[u];p;p=G[p].next)
if (!tag[V])
dfs(V),fat[V]=u;
for (int p=qhead[u];p;p=G[p].next)
if (tag[V]==cur)
ans[G[p].idx]=Fat(V);
}
int main(){
int x1,x2,y1,y2;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(n);
for (int i=1;i<=n;i++) read(Map[i]);
bfs(); Build();
read(m);
for (int i=1;i<=m;i++){
read(x1); read(y1); read(x2); read(y2);
add(P(x1,y1),P(x2,y2),++inum,qhead); G[inum].idx=i;
add(P(x2,y2),P(x1,y1),++inum,qhead); G[inum].idx=i;
}
init(n*n);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (Map[i][j]=='.' && !root[P(i,j)])
cur=P(i,j),dfs(P(i,j));
for (int i=1;i<=m;i++)
printf("%d\n",val[(ans[i]-1)/n+1][(ans[i]-1)%n+1]);
return 0;
}