結果

問題 No.34 砂漠の行商人
コンテスト
ユーザー te-sh
提出日時 2020-02-14 21:37:35
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 1,262 ms / 5,000 ms
コード長 5,934 bytes
コンパイル時間 1,671 ms
コンパイル使用メモリ 153,212 KB
実行使用メモリ 63,920 KB
最終ジャッジ日時 2024-06-22 05:07:39
合計ジャッジ時間 7,068 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(156): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{exit: true}", int).put.putMain!(c, int).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-144(144):        instantiated from here: `putMain!(c, int)`
Main.d(26):        instantiated from here: `put!("{exit: true}", int)`
Main.d(156): 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-144(144):        instantiated from here: `putMain!(c, int)`
Main.d(33):        instantiated from here: `put!("{}", int)`

ソースコード

diff # 

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

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

version(unittest) {} else
void main()
{
  int N, V, Sx, Sy, Gx, Gy; io.getV(N, V, Sx, Sy, Gx, Gy); --Sx; --Sy; --Gx; --Gy;
  int[][] L; io.getM(N, N, L);

  auto m = grid(L);
  alias Pos = m.Pos;
  auto S = m.pos(Sy, Sx), G = m.pos(Gy, Gx);

  auto v = grid!int(N, N), inf = 10^^6;
  foreach (p; v.walk) v[p] = inf;
  v[S] = 0;

  class E { Pos p; int d, h; this(Pos p, int d, int h) { this.p = p; this.d = d; this.h = h; } }
  auto q = DList!E(new E(S, 0, 0));
  while (!q.empty) {
    auto e = q.front; q.removeFront();
    foreach (np; e.p.around4) {
      auto nh = e.h+m[np];
      if (nh >= V) continue;
      if (np == G) io.put!"{exit: true}"(e.d+1);
      if (nh < v[np]) {
        v[np] = nh;
        q.insertBack(new E(np, e.d+1, nh));
      }
    }
  }
  io.put(-1);
}

class Grid(T)
{
  import std.format, std.traits;

  class Pos
  {
    int r, c;
    this(int r, int c) { this.r = r; this.c = c; }
    pure override string toString() { return format("(%d, %d)", r, c); }
    pure override bool opEquals(Object q) { return r == (cast(Pos)q).r && c == (cast(Pos)q).c; }
    pure bool inGrid() { return 0 <= r && r < h && 0 <= c && c < w; }
    pure int p2i() { return cast(int)w*r+c; }

    pure Pos opBinary(string op, U)(U q) if (op=="+"||op=="-")
    { return mixin("pos(r"~op~"q.r, c"~op~"q.c)"); }
    Pos opOpAssign(string op, U)(U 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=="/") && isNumeric!U)
    { return mixin("pos(r"~op~"a, c"~op~"a)"); }
    Pos opOpAssign(string op, U)(U a) if ((op=="*"||op=="/") && isNumeric!U)
    { mixin("r"~op~"=a; c"~op~"=a;"); return this; }
    pure int opBinary(string op: "*", U)(U q) if (!isNumeric!U)
    { 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);
    // }
  }

  size_t h, w;
  T[][] data;

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

  pure Pos pos(int r, int c) { return new Pos(r, c); }

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

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

  private struct WalkRange
  {
    Grid!T g;
    int r, c;
    this(Grid!T g) { this.g = g; r = 0; c = 0; }
    @property pure Pos front() { return g.pos(r, c); }
    void popFront() { if (++c >= g.w) { c = 0; ++r; } }
    pure bool empty() { return r >= g.h; }
  }
}
Grid!T grid(T)(size_t h, size_t w) { return new Grid!T(h, w); }
Grid!T grid(T)(T[][] data) { return new Grid!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