#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
#define INF 11000000
const int maxn = 1110;
char maze[maxn][maxn];
int n,m,Time[maxn][maxn],vis[maxn][maxn],sx,sy,fx[maxn],fy[maxn],degf,dist[maxn][maxn];
struct node{
int x,y;
node(int x=0,int y=0):x(x),y(y){}
};
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
bool judge(int x,int y){
retur......
阅读全文