結果
問題 | No.307 最近色塗る問題多くない? |
ユーザー | te-sh |
提出日時 | 2020-02-21 16:34:41 |
言語 | D (dmd 2.106.1) |
結果 |
MLE
|
実行時間 | - |
コード長 | 6,963 bytes |
コンパイル時間 | 704 ms |
コンパイル使用メモリ | 116,868 KB |
実行使用メモリ | 405,772 KB |
最終ジャッジ日時 | 2024-06-22 05:18:35 |
合計ジャッジ時間 | 6,771 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | MLE | - |
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 | TLE | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
コンパイルメッセージ
Main.d(291): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", Take!(Repeat!int)).put.putMain!(c, Take!(Repeat!int)).putMain` function requires a dual-context, which is deprecated Main.d-mixin-261(261): instantiated from here: `putMain!(c, Take!(Repeat!int))` Main.d(41): instantiated from here: `put!("{}", Take!(Repeat!int))` Main.d(291): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", int[]).put.putMain!(c, int[]).putMain` function requires a dual-context, which is deprecated Main.d-mixin-261(261): instantiated from here: `putMain!(c, int[])` Main.d(44): instantiated from here: `put!("{}", int[])`
ソースコード
// URL: https://yukicoder.me/problems/no/307 import std.algorithm, std.array, std.bitmanip, std.container, std.conv, std.format, std.functional, std.math, std.range, std.traits, std.typecons, std.stdio, std.string; version(unittest) {} else void main() { int H, W; io.getV(H, W); int[][] A; io.getM(H, W, A); alias rg = Region!(H, W), Pos = rg.Pos; auto g = rg.grid(A); int Q; io.getV(Q); auto isWhole = false, wholeColor = 0; foreach (_; 0..Q) { int R, C, X; io.getV(R, C, X); --R; --C; if (isWhole) { wholeColor = X; } else { if (g[R, C] == X) continue; auto c = 0, q = DList!Pos(Pos(R, C)); while (!q.empty) { auto p = q.front; q.removeFront(); g[p] = X; ++c; foreach (np; p.around4) if (g[np] != X) q.insertBack(np); } if (c == H*W) { isWhole = true; wholeColor = X; } } } if (isWhole) { foreach (_; 0..H) io.put(wholeColor.repeat.take(W)); } else { foreach (i; 0..H) io.put(g.data[i]); } } template Region(alias h, alias w) { struct Pos { pure nothrow @nogc @safe { int r, c; this(int r, int c) { this.r = r; this.c = c; } bool inRegion() const { return 0 <= r && r < h && 0 <= c && c < w; } int p2i() const { return cast(int)w*r+c; } Pos opBinary(string op)(Pos q) const if (op == "+" || op == "-") { return mixin("Pos(r"~op~"q.r, c"~op~"q.c)"); } ref Pos opOpAssign(string op)(Pos q) if (op == "+" || op == "-") { mixin("r"~op~"=q.r; c"~op~"=q.c;"); return this; } Pos opBinary(string op, U)(U a) const if ((op == "*" || op == "/") && isIntegral!U) { return mixin("Pos(r"~op~"a, c"~op~"a)"); } ref Pos opOpAssign(string op, U)(U a) if ((op == "*" || op == "/") && isIntegral!U) { mixin("r"~op~"=a; c"~op~"=a;"); return this; } int opBinary(string op: "*")(Pos q) const { return r*q.r+c*q.c; } } pure nothrow @safe { auto around4() const { return [Pos(r-1, c), Pos(r, c+1), Pos(r+1, c), Pos(r, c-1)] .filter!(p => p.inRegion); } auto around8() const { return [Pos(r-1, c), Pos(r-1, c+1), Pos(r, c+1), Pos(r+1, c+1), Pos(r+1, c), Pos(r+1, c-1), Pos(r, c-1), Pos(r-1, c-1)] .filter!(p => p.inRegion); } } } pure nothrow @safe { auto allPos() { return AllPosRange(); } } private { struct AllPosRange { int r, c; @property pure Pos front() { return Pos(r, c); } void popFront() { if (++c >= w) { c = 0; ++r; } } pure bool empty() const { return r >= h; } } } struct Grid(T) { T[][] data; pure nothrow @safe { Grid!T dup() const { return Grid!T(data.map!"a.dup".array); } } pure nothrow @nogc @safe { this(T[][] data) { this.data = data; } T opIndex(size_t r, size_t c) const in { assert(0 <= r && r < h && 0 <= c && c < w); } do { return data[r][c]; } T opIndex(Pos p) const in { assert(p.inRegion); } do { return data[p.r][p.c]; } Grid!T opIndexAssign(T v, size_t r, size_t c) in { assert(0 <= r && r < h && 0 <= c && c < w); } do { data[r][c] = v; return this; } Grid!T opIndexAssign(T v, Pos p) in { assert(p.inRegion); } do { data[p.r][p.c] = v; return this; } Grid!T opIndexOpAssign(string op)(T v, size_t r, size_t c) in { assert(0 <= r && r < h && 0 <= c && c < w); } do { mixin("data[r][c]"~op~"=v;"); return this; } Grid!T opIndexOpAssign(string op)(T v, Pos p) in { assert(p.inRegion); } do { mixin("data[p.r][p.c]"~op~"=v;"); return this; } Grid!T opIndexUnary(string op)(size_t r, size_t c) if (op == "++" || op == "--") in { assert(0 <= r && r < h && 0 <= c && c < w); } do { mixin(op~"data[r][c];"); return this; } Grid!T opIndexUnary(string op)(Pos p) if (op == "++" || op == "--") in { assert(p.inRegion); } do { mixin(op~"data[p.r][p.c];"); return this; } } } pure nothrow @safe { auto grid(T)(T[][] data = new T[][](h, w)) { return Grid!T(data); } } } auto io = IO!()(); import std.stdio; struct IO(alias IN = stdin, alias OUT = stdout) { import std.meta : allSatisfy; import core.stdc.stdlib : exit; void getV(T...)(ref T v) { foreach (ref w; v) get(w); } void getA(T)(size_t n, ref T v) if (hasAssignableElements!T) { v = new T(n); foreach (ref w; v) get(w); } void getC(T...)(size_t n, ref T v) if (allSatisfy!(hasAssignableElements, T)) { foreach (ref w; v) w = new typeof(w)(n); foreach (i; 0..n) foreach (ref w; v) get(w[i]); } void getM(T)(size_t r, size_t c, ref T v) if (hasAssignableElements!T && hasAssignableElements!(ElementType!T)) { v = new T(r); foreach (ref w; v) getA(c, w); } template getS(E...) { void getS(T)(size_t n, ref T v) { v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");"); } } const struct PutConf { bool newline = true, flush, exit; string floatFormat = "%.10f", delimiter = " "; } void put(alias conf = "{}", T...)(T v) { mixin("const PutConf c = "~conf~"; putMain!c(v);"); } void putB(alias conf = "{}", S, T)(bool c, S t, T f) { if (c) put!conf(t); else put!conf(f); } void putRaw(T...)(T v) { OUT.write(v); OUT.writeln; } private { dchar[] buf; auto sp = (new dchar[](0)).splitter; void nextLine() { IN.readln(buf); sp = buf.splitter; } void get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); } void putMain(PutConf c, T...)(T v) { foreach (i, w; v) { putOne!c(w); if (i+1 < v.length) OUT.write(c.delimiter); } static if (c.newline) OUT.writeln; static if (c.flush) OUT.flush(); static if (c.exit) exit(0); } void putOne(PutConf c, T)(T v) { static if (isInputRange!T && !isSomeString!T) putRange!c(v); else static if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v)); else static if (hasMember!(T, "fprint")) v.fprint(OUT); else OUT.write(v); } void putRange(PutConf c, T)(T v) { auto w = v; while (!w.empty) { putOne!c(w.front); w.popFront(); if (!w.empty) OUT.write(c.delimiter); } } } }