package contest200401; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.Arrays; import java.util.InputMismatchException; import java.util.Queue; public class G { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int sr = ni()-1, sc = ni()-1; int gr = ni()-1, gc = ni()-1; char[][] map = nm(n, m); char[][] xmap = new char[n+2][m+2]; for(int i = 0;i < n+2;i++) { Arrays.fill(xmap[i], '#'); } sr++; sc++; gr++; gc++; for(int i = 0;i < n;i++) { for(int j = 0;j < m;j++) { xmap[i+1][j+1] = map[i][j]; } } int[][] d = distMap(xmap, sr, sc); out.println(d[gr][gc]); } public static int[][] distMap(char[][] map, int sr, int sc) { int[] dr = { 1, 0, -1, 0 }; int[] dc = { 0, 1, 0, -1 }; int n = map.length; if(n == 0)return new int[0][0]; int m = map[0].length; int l = dr.length; int[][] d = new int[n][m]; int I = 999999999; for(int i = 0;i < n;i++) { Arrays.fill(d[i], 999999999); } int B = Integer.numberOfTrailingZeros(Integer.highestOneBit(m))+1; Queue q = new ArrayDeque(); q.add(sr<>>B, c = cur&(1<= 0 && nr < n && nc >= 0 && nc < m && map[nr][nc] == '.' && d[nr][nc] == I) { // fix d[nr][nc] = d[r][c] + 1; q.add(nr<= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }