結果

問題 No.1323 うしらずSwap
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-12-20 00:55:51
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 1,416 ms / 3,000 ms
コード長 6,339 bytes
コンパイル時間 1,256 ms
コンパイル使用メモリ 126,528 KB
実行使用メモリ 84,720 KB
最終ジャッジ日時 2024-06-22 10:30:20
合計ジャッジ時間 35,962 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 1 ms
6,944 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 1 ms
6,944 KB
testcase_14 AC 2 ms
6,940 KB
testcase_15 AC 1 ms
6,944 KB
testcase_16 AC 729 ms
84,492 KB
testcase_17 AC 920 ms
84,492 KB
testcase_18 AC 725 ms
83,620 KB
testcase_19 AC 927 ms
83,848 KB
testcase_20 AC 723 ms
83,436 KB
testcase_21 AC 975 ms
83,908 KB
testcase_22 AC 929 ms
83,764 KB
testcase_23 AC 723 ms
83,352 KB
testcase_24 AC 916 ms
83,540 KB
testcase_25 AC 722 ms
83,384 KB
testcase_26 AC 707 ms
84,340 KB
testcase_27 AC 718 ms
83,516 KB
testcase_28 AC 754 ms
83,444 KB
testcase_29 AC 706 ms
83,504 KB
testcase_30 AC 905 ms
83,648 KB
testcase_31 AC 705 ms
83,484 KB
testcase_32 AC 905 ms
83,552 KB
testcase_33 AC 1,184 ms
83,108 KB
testcase_34 AC 1,253 ms
83,188 KB
testcase_35 AC 1,286 ms
83,388 KB
testcase_36 AC 1,313 ms
83,560 KB
testcase_37 AC 1,326 ms
83,484 KB
testcase_38 AC 1,371 ms
83,348 KB
testcase_39 AC 1,390 ms
83,436 KB
testcase_40 AC 1,392 ms
83,372 KB
testcase_41 AC 1,416 ms
83,512 KB
testcase_42 AC 1,389 ms
83,632 KB
testcase_43 AC 338 ms
83,476 KB
testcase_44 AC 435 ms
83,380 KB
testcase_45 AC 526 ms
84,720 KB
testcase_46 AC 445 ms
83,832 KB
testcase_47 AC 409 ms
83,404 KB
testcase_48 AC 330 ms
83,584 KB
testcase_49 AC 426 ms
83,704 KB
testcase_50 AC 286 ms
83,532 KB
testcase_51 AC 75 ms
83,080 KB
testcase_52 AC 184 ms
83,776 KB
testcase_53 AC 411 ms
83,504 KB
testcase_54 AC 183 ms
83,564 KB
testcase_55 AC 430 ms
83,440 KB
testcase_56 AC 129 ms
83,944 KB
testcase_57 AC 541 ms
83,472 KB
testcase_58 AC 3 ms
6,940 KB
testcase_59 AC 6 ms
6,940 KB
testcase_60 AC 4 ms
6,944 KB
testcase_61 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum DX = [+1, 0, -1, 0];
enum DY = [0, +1, 0, -1];

enum INF = 10^^9;

void main() {
  try {
    for (; ; ) {
      const H = readInt();
      const W = readInt();
      const SX = readInt() - 1;
      const SY = readInt() - 1;
      const TX = readInt() - 1;
      const TY = readInt() - 1;
      auto A = new char[][H];
      foreach (x; 0 .. H) {
        A[x] = readToken().dup;
      }
      
      alias Pt = Tuple!(int, "x", int, "y");
      auto que = new Pt[H * W];
      int qb, qe;
      auto dist = new int[][](H, W);
      auto prev = new Pt[][](H, W);
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        dist[x][y] = -1;
      }
      dist[SX][SY] = 0;
      que[qe++] = Pt(SX, SY);
      for (; qb != qe; ) {
        const x = que[qb].x;
        const y = que[qb].y;
        ++qb;
        if (A[x + 1][y] == '.' && dist[x + 1][y] == -1) { dist[x + 1][y] = dist[x][y] + 1; prev[x + 1][y] = Pt(x, y); que[qe++] = Pt(x + 1, y); }
        if (A[x][y + 1] == '.' && dist[x][y + 1] == -1) { dist[x][y + 1] = dist[x][y] + 1; prev[x][y + 1] = Pt(x, y); que[qe++] = Pt(x, y + 1); }
        if (A[x - 1][y] == '.' && dist[x - 1][y] == -1) { dist[x - 1][y] = dist[x][y] + 1; prev[x - 1][y] = Pt(x, y); que[qe++] = Pt(x - 1, y); }
        if (A[x][y - 1] == '.' && dist[x][y - 1] == -1) { dist[x][y - 1] = dist[x][y] + 1; prev[x][y - 1] = Pt(x, y); que[qe++] = Pt(x, y - 1); }
      }
      
      qb = qe = 0;
      auto dist1 = new int[][](H, W);
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        dist1[x][y] = -1;
      }
      dist1[TX][TY] = 0;
      que[qe++] = Pt(TX, TY);
      for (; qb != qe; ) {
        const x = que[qb].x;
        const y = que[qb].y;
        ++qb;
        if (A[x + 1][y] == '.' && dist1[x + 1][y] == -1) { dist1[x + 1][y] = dist1[x][y] + 1; que[qe++] = Pt(x + 1, y); }
        if (A[x][y + 1] == '.' && dist1[x][y + 1] == -1) { dist1[x][y + 1] = dist1[x][y] + 1; que[qe++] = Pt(x, y + 1); }
        if (A[x - 1][y] == '.' && dist1[x - 1][y] == -1) { dist1[x - 1][y] = dist1[x][y] + 1; que[qe++] = Pt(x - 1, y); }
        if (A[x][y - 1] == '.' && dist1[x][y - 1] == -1) { dist1[x][y - 1] = dist1[x][y] + 1; que[qe++] = Pt(x, y - 1); }
      }
      
      A[SX][SY] = '!';
      qb = qe = 0;
      auto distT = new int[][](H, W);
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        distT[x][y] = -1;
      }
      distT[TX][TY] = 0;
      que[qe++] = Pt(TX, TY);
      for (; qb != qe; ) {
        const x = que[qb].x;
        const y = que[qb].y;
        ++qb;
        if (A[x + 1][y] == '.' && distT[x + 1][y] == -1) { distT[x + 1][y] = distT[x][y] + 1; que[qe++] = Pt(x + 1, y); }
        if (A[x][y + 1] == '.' && distT[x][y + 1] == -1) { distT[x][y + 1] = distT[x][y] + 1; que[qe++] = Pt(x, y + 1); }
        if (A[x - 1][y] == '.' && distT[x - 1][y] == -1) { distT[x - 1][y] = distT[x][y] + 1; que[qe++] = Pt(x - 1, y); }
        if (A[x][y - 1] == '.' && distT[x][y - 1] == -1) { distT[x][y - 1] = distT[x][y] + 1; que[qe++] = Pt(x, y - 1); }
      }
      A[SX][SY] = '.';
      
      A[TX][TY] = '!';
      qb = qe = 0;
      auto distS = new int[][](H, W);
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        distS[x][y] = -1;
      }
      distS[SX][SY] = 0;
      que[qe++] = Pt(SX, SY);
      for (; qb != qe; ) {
        const x = que[qb].x;
        const y = que[qb].y;
        ++qb;
        if (A[x + 1][y] == '.' && distS[x + 1][y] == -1) { distS[x + 1][y] = distS[x][y] + 1; que[qe++] = Pt(x + 1, y); }
        if (A[x][y + 1] == '.' && distS[x][y + 1] == -1) { distS[x][y + 1] = distS[x][y] + 1; que[qe++] = Pt(x, y + 1); }
        if (A[x - 1][y] == '.' && distS[x - 1][y] == -1) { distS[x - 1][y] = distS[x][y] + 1; que[qe++] = Pt(x - 1, y); }
        if (A[x][y - 1] == '.' && distS[x][y - 1] == -1) { distS[x][y - 1] = distS[x][y] + 1; que[qe++] = Pt(x, y - 1); }
      }
      A[TX][TY] = '.';
      
      debug {
        writeln("dist = ", dist);
        writeln("dist1 = ", dist1);
        writeln("distS = ", distS);
        writeln("distT = ", distT);
      }
      
      int ans = INF;
      if (dist[TX][TY] != -1) {
        auto on = new bool[][](H, W);
        for (int x = TX, y = TY; ; ) {
          on[x][y] = true;
          if (x == SX && y == SY) {
            break;
          }
          const p = prev[x][y];
          x = p.x;
          y = p.y;
        }
        foreach (x; 1 .. H - 1) foreach (y; 1 .. W - 1) {
          if (A[x][y] == '.' && !on[x][y]) {
            if (distS[x][y] != -1 && distT[x][y] != -1) {
              chmin(ans, dist[TX][TY] + distS[x][y] + distT[x][y]);
            }
          }
        }
        foreach (x; 1 .. H - 1) foreach (y; 1 .. W - 1) {
          if (A[x][y] == '.') {
            int cnt;
            foreach (dir; 0 .. 4) {
              if (A[x + DX[dir]][y + DY[dir]] == '.') {
                ++cnt;
              }
            }
            if (cnt >= 3) {
              if (dist[x][y] != -1 && dist1[x][y] != -1) {
                chmin(ans, 2 * (dist[x][y] + dist1[x][y] + 2));
              }
            }
          }
        }
      }
      writeln((ans >= INF) ? -1 : ans);
    }
  } catch (EOFException e) {
  }
}
0