結果
問題 | No.2731 Two Colors |
ユーザー |
👑 |
提出日時 | 2024-04-19 21:56:25 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 1,681 ms / 3,000 ms |
コード長 | 2,528 bytes |
コンパイル時間 | 3,618 ms |
コンパイル使用メモリ | 136,040 KB |
実行使用メモリ | 22,140 KB |
最終ジャッジ日時 | 2024-10-11 14:59:43 |
合計ジャッジ時間 | 15,881 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
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; }string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }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];void main() {try {for (; ; ) {const M = readInt;const N = readInt;auto A = new int[][](M, N);foreach (x; 0 .. M) foreach (y; 0 .. N) {A[x][y] = readInt;}alias Entry = Tuple!(int, "a", int, "x", int, "y");BinaryHeap!(Array!Entry, "a.a > b.a")[2] ques;ques[1].insert(Entry(A[0][0], 0, 0));ques[0].insert(Entry(A[M - 1][N - 1], M - 1, N - 1));auto col = new int[][](M, N);foreach (x; 0 .. M) col[x][] = -1;int ans;for (ans = -1; ; ++ans) {const c = ans & 1;for (; ; ) {const e = ques[c].front;ques[c].removeFront;const x = e.x, y = e.y;if (!~col[x][y]) {col[x][y] = c;foreach (dir; 0 .. 4) {const xx = x + DX[dir];const yy = y + DY[dir];if (0 <= xx && xx < M && 0 <= yy && yy < N) {if (col[xx][yy] == (c ^ 1)) {goto done;} else if (!~col[xx][yy]) {ques[c].insert(Entry(A[xx][yy], xx, yy));}}}break;}}}done:writeln(ans);}} catch (EOFException e) {}}