結果
問題 | No.307 最近色塗る問題多くない? |
ユーザー | te-sh |
提出日時 | 2018-01-10 10:00:04 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 2,296 ms / 4,000 ms |
コード長 | 3,358 bytes |
コンパイル時間 | 895 ms |
コンパイル使用メモリ | 126,192 KB |
実行使用メモリ | 11,392 KB |
最終ジャッジ日時 | 2024-06-12 23:25:13 |
合計ジャッジ時間 | 11,912 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,948 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 17 ms
6,944 KB |
testcase_08 | AC | 119 ms
11,284 KB |
testcase_09 | AC | 43 ms
5,376 KB |
testcase_10 | AC | 5 ms
5,376 KB |
testcase_11 | AC | 11 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 15 ms
5,376 KB |
testcase_14 | AC | 6 ms
5,376 KB |
testcase_15 | AC | 9 ms
5,376 KB |
testcase_16 | AC | 8 ms
5,376 KB |
testcase_17 | AC | 105 ms
10,584 KB |
testcase_18 | AC | 361 ms
11,392 KB |
testcase_19 | AC | 296 ms
11,264 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 209 ms
11,392 KB |
testcase_22 | AC | 178 ms
11,264 KB |
testcase_23 | AC | 2,051 ms
11,392 KB |
testcase_24 | AC | 721 ms
11,264 KB |
testcase_25 | AC | 986 ms
11,264 KB |
testcase_26 | AC | 2,296 ms
11,264 KB |
testcase_27 | AC | 24 ms
5,376 KB |
testcase_28 | AC | 93 ms
11,264 KB |
testcase_29 | AC | 9 ms
5,376 KB |
testcase_30 | AC | 2,185 ms
11,392 KB |
testcase_31 | AC | 33 ms
5,376 KB |
testcase_32 | AC | 24 ms
5,376 KB |
testcase_33 | AC | 26 ms
5,376 KB |
testcase_34 | AC | 24 ms
5,376 KB |
testcase_35 | AC | 29 ms
5,376 KB |
ソースコード
import std.algorithm, std.conv, std.range, std.stdio, std.string; import std.container; // SList, DList, BinaryHeap alias Point!int point; alias Grid!(int, int) grid; void main() { auto rd1 = readln.split.to!(size_t[]), h = rd1[0], w = rd1[1]; auto a = h.iota.map!(_ => readln.split.to!(int[])).array; auto g = grid(a); auto q = readln.chomp.to!size_t, sameColor = false, lastColor = 0; foreach (_; 0..q) { auto rd2 = readln.splitter; auto r = rd2.front.to!int-1; rd2.popFront(); auto c = rd2.front.to!int-1; rd2.popFront(); auto x = rd2.front.to!int; auto p = point(c, r); if (sameColor) { lastColor = x; continue; } if (g[p] == x) continue; g[p] = x; auto qu = new DList!point([p]), cnt = 1; while (!qu.empty) { auto qp = qu.front; qu.removeFront(); foreach (np; g.sibPoints4(qp)) if (g[np] != x) { g[np] = x; qu.insertBack(np); ++cnt; } } if (cnt == h * w) { sameColor = true; lastColor = x; } } if (sameColor) { foreach (i; 0..h) writeln(lastColor.repeat.take(w).array.to!(string[]).join(" ")); } else { foreach (i; 0..h) writeln(g[i].to!(string[]).join(" ")); } } struct Point(T) { T x, y; pure auto opBinary(string op: "+")(Point!T rhs) const { return Point!T(x + rhs.x, y + rhs.y); } pure auto opBinary(string op: "-")(Point!T rhs) const { return Point!T(x - rhs.x, y - rhs.y); } pure auto opBinary(string op: "*")(Point!T rhs) const { return x * rhs.x + y * rhs.y; } pure auto opBinary(string op: "*")(T a) const { return Point!T(x * a, y * a); } pure auto opBinary(string op: "/")(T a) const { return Point!T(x / a, y / a); } pure auto hypot2() const { return x ^^ 2 + y ^^ 2; } } struct Grid(T, U) { import std.algorithm, std.conv, std.range, std.traits, std.typecons; const sibs4 = [Point!U(-1, 0), Point!U(0, -1), Point!U(1, 0), Point!U(0, 1)]; const sibs8 = [Point!U(-1, 0), Point!U(-1, -1), Point!U(0, -1), Point!U(1, -1), Point!U(1, 0), Point!U(1, 1), Point!U(0, 1), Point!U(-1, 1)]; T[][] m; const size_t rows, cols; mixin Proxy!m; this(size_t r, size_t c) { rows = r; cols = c; m = new T[][](rows, cols); } this(T[][] s) { rows = s.length; cols = s[0].length; m = s; } pure auto dup() const { return Grid(m.map!(r => r.dup).array); } ref pure auto opIndex(Point!U p) { return m[p.y][p.x]; } ref pure auto opIndex(size_t y) { return m[y]; } ref pure auto opIndex(size_t y, size_t x) const { return m[y][x]; } static if (isAssignable!T) { auto opIndexAssign(T v, Point!U p) { return m[p.y][p.x] = v; } auto opIndexAssign(T v, size_t y, size_t x) { return m[y][x] = v; } auto opIndexOpAssign(string op, V)(V v, Point!U p) { return mixin("m[p.y][p.x] " ~ op ~ "= v"); } auto opIndexOpAssign(string op, V)(V v, size_t y, size_t x) { return mixin("m[y][x] " ~ op ~ "= v"); } } pure auto validPoint(Point!U p) { return p.x >= 0 && p.x < cols && p.y >= 0 && p.y < rows; } pure auto points() const { return rows.to!U.iota.map!(y => cols.to!U.iota.map!(x => Point!U(x, y))).joiner; } pure auto sibPoints4(Point!U p) { return sibs4.map!(s => p + s).filter!(p => validPoint(p)); } pure auto sibPoints8(Point!U p) { return sibs8.map!(s => p + s).filter!(p => validPoint(p)); } }