#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int H,W,SX,GX,SY,GY; string S[1010]; int U[1010][1010]; int D[1010][1010]; void solve() { int i,j,k,l,r,x,y; string s; cin>>H>>W>>SY>>SX>>GY>>GX; SY--,GY--; SX--,GX--; FOR(y,H) cin>>S[y]; S[H]=string(W,'#'); H++; FOR(x,W) { FOR(y,H) { D[y][x]=1<<30; if(y) U[y][x]=U[y-1][x]; else U[y][x]=-1; if(S[y][x]=='.') U[y][x]=y; } } deque Q; D[SY][SX]=0; Q.push_back(SY*1000+SX); while(Q.size()) { int cy=Q.front()/1000; int cx=Q.front()%1000; Q.pop_front(); int co=D[cy][cx]; if(cy==GY&&cx==GX) { cout<=0&&tx=0&&tx2=0&&chmin(D[ny][tx2],co+1)) Q.push_back(ny*1000+tx2); ny=U[sy][tx2]; if(ny>=0&&chmin(D[ny][tx2],co)) Q.push_front(ny*1000+tx2); } } } } cout<<-1<