結果

問題 No.179 塗り分け
ユーザー te-shte-sh
提出日時 2020-02-18 16:30:32
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 117 ms / 3,000 ms
コード長 5,360 bytes
コンパイル時間 768 ms
コンパイル使用メモリ 116,956 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-22 05:16:43
合計ジャッジ時間 2,649 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 6 ms
6,940 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 30 ms
6,940 KB
testcase_09 AC 32 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 33 ms
6,940 KB
testcase_13 AC 1 ms
6,940 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 1 ms
6,944 KB
testcase_16 AC 1 ms
6,944 KB
testcase_17 AC 1 ms
6,940 KB
testcase_18 AC 3 ms
6,940 KB
testcase_19 AC 3 ms
6,940 KB
testcase_20 AC 30 ms
6,944 KB
testcase_21 AC 55 ms
6,940 KB
testcase_22 AC 117 ms
6,940 KB
testcase_23 AC 2 ms
6,940 KB
testcase_24 AC 35 ms
6,944 KB
testcase_25 AC 2 ms
6,940 KB
testcase_26 AC 7 ms
6,944 KB
testcase_27 AC 30 ms
6,940 KB
testcase_28 AC 3 ms
6,944 KB
testcase_29 AC 30 ms
6,944 KB
testcase_30 AC 14 ms
6,940 KB
testcase_31 AC 31 ms
6,944 KB
testcase_32 AC 10 ms
6,944 KB
testcase_33 AC 30 ms
6,944 KB
testcase_34 AC 7 ms
6,940 KB
testcase_35 AC 30 ms
6,940 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 1 ms
6,940 KB
testcase_38 AC 1 ms
6,940 KB
testcase_39 AC 1 ms
6,944 KB
testcase_40 AC 1 ms
6,940 KB
testcase_41 AC 1 ms
6,940 KB
testcase_42 AC 1 ms
6,940 KB
testcase_43 AC 3 ms
6,940 KB
testcase_44 AC 7 ms
6,944 KB
testcase_45 AC 1 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(143): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{exit: true}", string).put.putMain!(c, string).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-131(131):        instantiated from here: `putMain!(c, string)`
Main.d(13):        instantiated from here: `put!("{exit: true}", string)`
Main.d(143): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", string).put.putMain!(c, string).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-131(131):        instantiated from here: `putMain!(c, string)`
Main.d(29):        instantiated from here: `put!("{}", string)`

ソースコード

diff #

// URL: https://yukicoder.me/problems/no/179

import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string;

version(unittest) {} else
void main()
{
  int H, W; io.getV(H, W);
  string[] S; io.getC(H, S);

  alias rg = Region!(H, W);
  auto a = rg.grid(S.map!(l => l.map!(c => c == '.' ? 0 : 1).array).array);
  if (a.data.map!"a.sum".sum == 0) io.put!"{exit: true}"("NO");

  foreach (y; 0..H) {
  loop: foreach (x; -W+1..W) {
      auto b = a.dup, d = rg.Pos(y, x);
      foreach (p; b.walk)
        if (b[p] == 1) {
          b[p] = 2;
          auto q = p+d;
          if (!q.inRegion || b[q] != 1) continue loop;
          b[q] = 3;
        }
      io.put!"{exit: true}"("YES");
    }
  }

  io.put("NO");
}

template Region(alias h, alias w)
{
  struct Pos
  {
    int r, c;
    pure this(int r, int c) { this.r = r; this.c = c; }
    pure bool inRegion() { return 0 <= r && r < h && 0 <= c && c < w; }
    pure int p2i() { return cast(int)w*r+c; }

    pure Pos opBinary(string op)(Pos q) if (op=="+"||op=="-")
    { return mixin("Pos(r"~op~"q.r, c"~op~"q.c)"); }
    Pos opOpAssign(string op)(Pos q) if (op=="+"||op=="-")
    { mixin("r"~op~"=q.r; c"~op~"=q.c;"); return this; }
    pure Pos opBinary(string op, U)(U a) if (op=="*"||op=="/")
    { return mixin("Pos(r"~op~"a, c"~op~"a)"); }
    Pos opOpAssign(string op, U)(U a) if (op=="*"||op=="/")
    { mixin("r"~op~"=a; c"~op~"=a;"); return this; }
    pure int opBinary(string op: "*")(Pos q)
    { return r*q.r+c*q.c; }

    pure auto around4()
    {
      return [Pos(r-1, c), Pos(r, c+1), Pos(r+1, c), Pos(r, c-1)]
        .filter!(p => p.inRegion);
    }
    pure auto around8()
    {
      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);
    }
  }

  struct Grid(T)
  {
    T[][] data;
    pure this(T[][] data) { this.data = data; }
    pure Grid!T dup() { return Grid!T(data.map!"a.dup".array); }

    pure T opIndex(size_t r, size_t c) { return data[r][c]; }
    pure T opIndex(Pos p) { return data[p.r][p.c]; }
    Grid!T opIndexAssign(T v, size_t r, size_t c) { data[r][c] = v; return this; }
    Grid!T opIndexAssign(T v, Pos p) { data[p.r][p.c] = v; return this; }
    Grid!T opIndexOpAssign(string op)(T v, size_t r, size_t c)
    { mixin("data[r][c]"~op~"=v;"); return this; }
    Grid!T opIndexOpAssign(string op)(T v, Pos p)
    { mixin("data[p.r][p.c]"~op~"=v;"); return this; }
    Grid!T opIndexUnary(string op)(size_t r, size_t c) if (op=="++"||op=="--")
      { mixin(op~"data[r][c];"); return this; }
    Grid!T opIndexUnary(string op)(Pos p) if (op=="++"||op=="--")
      { mixin(op~"data[p.r][p.c];"); return this; }

    auto walk() { return WalkRange(this); }

    private struct WalkRange
    {
      int r, c;
      this(Grid!T g) { r = 0; c = 0; }
      @property pure Pos front() { return Pos(r, c); }
      void popFront() { if (++c >= w) { c = 0; ++r; } }
      pure bool empty() { return r >= h; }
    }
  }

  pure Pos pos(int r, int c) { return Pos(r, c); }
  pure Grid!T 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.conv, std.format, std.meta, std.traits, core.stdc.stdlib;

  auto getV(T...)(ref T v) { foreach (ref w; v) get(w); }
  auto getA(T)(size_t n, ref T v) if (hasAssignableElements!T)
  { v = new T(n); foreach (ref w; v) get(w); }
  auto 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]);
  }
  auto 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...)
  {
    auto 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 = " ";
  }

  auto put(alias conf = "{}", T...)(T v)
  { mixin("const PutConf c = "~conf~"; putMain!c(v);"); }
  auto putB(alias conf = "{}", S, T)(bool c, S t, T f)
  { if (c) put!conf(t); else put!conf(f); }
  auto 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; }
    auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); }

    auto putMain(PutConf c, T...)(T v)
    {
      foreach (i, w; v) {
        putOne!c(w);
        if (i < v.length-1) OUT.write(c.delimiter);
      }
      static if (c.newline) OUT.writeln;
      static if (c.flush) OUT.flush();
      static if (c.exit) exit(0);
    }
    auto 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);
    }
    auto 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);
      }
    }
  }
}
0