#595549 (D) No.1323 うしらずSwap

提出ソース

結果

問題	No.1323 うしらずSwap
ユーザー	👑 hos.lyric
提出日時	2020-12-20 00:24:50
言語	D (dmd 2.106.1)
結果	WA
実行時間	-
コード長	5,788 bytes
コンパイル時間	911 ms
コンパイル使用メモリ	124,800 KB
実行使用メモリ	69,864 KB
最終ジャッジ日時	2024-06-22 10:28:02
合計ジャッジ時間	9,626 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,944 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	1 ms 6,940 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	AC	1 ms 6,944 KB
testcase_11	WA	-
testcase_12	AC	1 ms 6,940 KB
testcase_13	AC	1 ms 6,944 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	120 ms 68,952 KB
testcase_17	AC	234 ms 69,712 KB
testcase_18	AC	119 ms 69,432 KB
testcase_19	AC	233 ms 69,152 KB
testcase_20	AC	117 ms 69,176 KB
testcase_21	AC	118 ms 69,420 KB
testcase_22	AC	246 ms 69,192 KB
testcase_23	AC	117 ms 69,168 KB
testcase_24	AC	245 ms 68,340 KB
testcase_25	AC	118 ms 69,364 KB
testcase_26	AC	102 ms 69,292 KB
testcase_27	AC	109 ms 69,076 KB
testcase_28	AC	142 ms 68,688 KB
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	AC	273 ms 68,088 KB
testcase_34	AC	256 ms 69,012 KB
testcase_35	AC	259 ms 68,164 KB
testcase_36	AC	250 ms 68,576 KB
testcase_37	AC	253 ms 69,676 KB
testcase_38	AC	242 ms 69,580 KB
testcase_39	AC	243 ms 69,376 KB
testcase_40	AC	247 ms 68,820 KB
testcase_41	AC	248 ms 68,728 KB
testcase_42	AC	233 ms 68,752 KB
testcase_43	AC	89 ms 69,864 KB
testcase_44	AC	120 ms 69,648 KB
testcase_45	AC	112 ms 68,976 KB
testcase_46	AC	123 ms 68,176 KB
testcase_47	AC	94 ms 68,524 KB
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	AC	3 ms 6,944 KB
testcase_60	AC	1 ms 6,944 KB
testcase_61	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

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;
        /*
        foreach (dir; 0 .. 4) {
          const xx = x + DX[dir];
          const yy = y + DY[dir];
          if (A[xx][yy] == '.') {
            if (dist[xx][yy] == -1) {
              dist[xx][yy] = dist[x][y] + 1;
              prev[xx][yy] = Pt(x, y);
              que ~= Pt(xx, yy);
            }
          }
        }
        */
        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); }
      }
      
      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;
        /*
        foreach (dir; 0 .. 4) {
          const xx = x + DX[dir];
          const yy = y + DY[dir];
          if (A[xx][yy] == '.') {
            if (distT[xx][yy] == -1) {
              distT[xx][yy] = distT[x][y] + 1;
              que ~= Pt(xx, yy);
            }
          }
        }
        */
        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("distS = ", distS);
        writeln("distT = ", distT);
      }
      
      int ans;
      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;
        }
        ans = INF;
        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]);
            }
          }
        }
        if (ans >= INF) {
          ans = -1;
        }
      } else {
        ans = -1;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード