結果

問題 No.179 塗り分け
ユーザー te-sh
提出日時 2020-02-15 04:01:23
言語 D
(dmd 2.089.1)
結果
AC  
実行時間 140 ms
コード長 5,561 Byte
コンパイル時間 2,076 ms
使用メモリ 4,076 KB
最終ジャッジ日時 2020-02-15 04:01:29

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00_sample1.txt AC 0 ms
3,004 KB
00_sample2.txt AC 4 ms
3,004 KB
00_sample3.txt AC 4 ms
3,060 KB
00_sample4.txt AC 0 ms
3,056 KB
00_sample5.txt AC 0 ms
3,028 KB
00_sample6.txt AC 12 ms
3,912 KB
10_hand01.txt AC 0 ms
3,140 KB
10_hand02.txt AC 4 ms
3,112 KB
10_hand03.txt AC 36 ms
3,936 KB
10_hand04.txt AC 44 ms
4,040 KB
10_hand05.txt AC 4 ms
3,780 KB
10_hand06.txt AC 4 ms
3,656 KB
10_hand07.txt AC 40 ms
3,872 KB
10_hand08.txt AC 0 ms
2,988 KB
10_hand09.txt AC 4 ms
3,000 KB
10_hand10.txt AC 4 ms
2,968 KB
10_hand11.txt AC 0 ms
3,048 KB
10_hand12.txt AC 0 ms
3,048 KB
10_hand13.txt AC 4 ms
4,076 KB
10_hand14.txt AC 4 ms
3,940 KB
10_hand15.txt AC 36 ms
3,952 KB
10_hand16.txt AC 68 ms
3,836 KB
10_hand17.txt AC 140 ms
3,892 KB
10_hand18.txt AC 4 ms
3,832 KB
10_hand19.txt AC 44 ms
3,844 KB
10_hand20.txt AC 4 ms
4,020 KB
20_random01.txt AC 8 ms
4,040 KB
20_random02.txt AC 40 ms
3,864 KB
20_random03.txt AC 4 ms
4,068 KB
20_random04.txt AC 48 ms
3,912 KB
20_random05.txt AC 16 ms
3,996 KB
20_random06.txt AC 44 ms
3,848 KB
20_random07.txt AC 12 ms
3,940 KB
20_random08.txt AC 40 ms
3,912 KB
20_random09.txt AC 12 ms
3,924 KB
20_random10.txt AC 40 ms
3,848 KB
99_system_test1.txt AC 0 ms
2,988 KB
99_system_test2.txt AC 4 ms
2,968 KB
99_system_test3.txt AC 0 ms
3,008 KB
system_test1.txt AC 4 ms
2,968 KB
system_test2.txt AC 4 ms
3,004 KB
system_test3.txt AC 4 ms
2,956 KB
system_test4.txt AC 4 ms
3,876 KB
system_test5.txt AC 8 ms
3,944 KB
system_test6.txt AC 4 ms
3,072 KB
テストケース一括ダウンロード

ソースコード

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);

  auto a = 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 = b.pos(y, x);
      foreach (p; b.walk)
        if (b[p] == 1) {
          b[p] = 2;
          auto q = p+d;
          if (!q.inGrid || b[q] != 1) continue loop;
          b[q] = 3;
        }
      io.put!"{exit: true}"("YES");
    }
  }

  io.put("NO");
}

template Grid(alias h, alias w)
{
  struct Pos
  {
    int r, c;
    this(int r, int c) { this.r = r; this.c = c; }
    bool inGrid() { return 0 <= r && r < h && 0 <= c && c < w; }
    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.inGrid);
    }
    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.inGrid);
    }
  }

  struct Data(T)
  {
    alias Pos = Grid!(h, w).Pos;

    T[][] data;

    this(T[][] data) { h = data.length; w = data[0].length; this.data = data; }
    pure Data!T dup() { return Data!T(data.map!"a.dup".array); }

    pure Pos pos(int r, int c) { return Pos(r, c); }
    pure Data!U grid(U)() { return Data!U(new U[][](h, w)); }

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

auto grid(T)(size_t h, size_t w)
{ return Grid!(h, w).Data!T(new T[][](h, w)); }
auto grid(T)(T[][] data)
{ auto h = data.length, w = data[0].length; return Grid!(h, w).Data!T(data); }

pure int distManhattan(T)(T p1, T p2) { return abs(p1.r-p2.r) + abs(p1.c-p2.c); }

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 if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v));
      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