結果

問題 No.1949 足し算するだけのパズルゲーム(2)
ユーザー allegrogikenallegrogiken
提出日時 2022-05-21 00:21:31
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 260 ms / 3,000 ms
コード長 5,221 bytes
コンパイル時間 977 ms
コンパイル使用メモリ 128,196 KB
実行使用メモリ 25,888 KB
最終ジャッジ日時 2023-09-04 17:15:37
合計ジャッジ時間 4,977 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 232 ms
25,232 KB
testcase_08 AC 52 ms
7,532 KB
testcase_09 AC 244 ms
15,068 KB
testcase_10 AC 259 ms
25,888 KB
testcase_11 AC 260 ms
25,564 KB
testcase_12 AC 241 ms
25,772 KB
testcase_13 AC 259 ms
25,284 KB
testcase_14 AC 167 ms
11,144 KB
testcase_15 AC 167 ms
11,140 KB
testcase_16 AC 24 ms
7,084 KB
testcase_17 AC 229 ms
25,092 KB
testcase_18 AC 24 ms
6,968 KB
testcase_19 AC 1 ms
4,380 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 221 ms
25,036 KB
testcase_23 AC 1 ms
4,380 KB
testcase_24 AC 120 ms
14,660 KB
testcase_25 AC 232 ms
23,576 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(39): Warning: statement is not reachable
Main.d(39): Warning: statement is not reachable

ソースコード

diff # 

void main() { runSolver(); }

void problem() {
  auto H = scan!int;
  auto W = scan!int;
  auto Y = scan!int;
  auto X = scan!int;
  auto A = scan!long(H * W).chunks(W).array;

  auto solve() {
    auto rect = GridPoint(W, H);
    auto visited = new bool[][](H, W);
    visited[Y-1][X-1] = true;

    alias Enemy = Tuple!(GridPoint, "p", long, "v");
    auto q = DList!GridPoint([GridPoint(X - 1, Y - 1)]);
    long strength = A[Y-1][X-1];
    auto heap = (new Enemy[](0)).heapify!"a.v > b.v";
    while(true) {
      auto p = q.front;
      q.removeFront;
      foreach(a; p.around(rect)) {
        if (a.of(visited)) continue;

        visited[a.y][a.x] = true;
        heap.insert(Enemy(a, A[a.y][a.x]));
      }

      while(!heap.empty && heap.front.v < strength) {
        strength += heap.front.v;
        q.insertBack(heap.front.p);
        heap.removeFront;
      }

      if (heap.empty && q.empty) return YESNO[true];
      if (!heap.empty && q.empty) return YESNO[false];
    }

    return YESNO[false];

    // dp.deb;
    // return YESNO[dp[$ - 1][$ - 1].maxElement > 0];
  }

  outputForAtCoder(&solve);
}

// ----------------------------------------------

import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons, std.numeric, std.traits, std.functional, std.bigint, std.datetime.stopwatch, core.time, core.bitop;
T[][] combinations(T)(T[] s, in long m) {   if (!m) return [[]];   if (s.empty) return [];   return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }
string scan(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T scan(T)(){ return scan.to!T; }
T[] scan(T)(long n){ return n.iota.map!(i => scan!T()).array; }
void deb(T ...)(T t){ debug writeln(t); }
long[] divisors(long n) { long[] ret; for (long i = 1; i * i <= n; i++) { if (n % i == 0) { ret ~= i; if (i * i != n) ret ~= n / i; } } return ret.sort.array; }
bool chmin(T)(ref T a, T b) { if (b < a) { a = b; return true; } else return false; }
bool chmax(T)(ref T a, T b) { if (b > a) { a = b; return true; } else return false; }
string charSort(alias S = "a < b")(string s) { return (cast(char[])((cast(byte[])s).sort!S.array)).to!string; }
ulong comb(ulong a, ulong b) { if (b == 0) {return 1;}else{return comb(a - 1, b - 1) * a / b;}}
string toAnswerString(R)(R r) { return r.map!"a.to!string".joiner(" ").array.to!string; }
struct ModInt(uint MD) if (MD < int.max) {ulong v;this(string v) {this(v.to!long);}this(int v) {this(long(v));}this(long v) {this.v = (v%MD+MD)%MD;}void opAssign(long t) {v = (t%MD+MD)%MD;}static auto normS(ulong x) {return (x<MD)?x:x-MD;}static auto make(ulong x) {ModInt m; m.v = x; return m;}auto opBinary(string op:"+")(ModInt r) const {return make(normS(v+r.v));}auto opBinary(string op:"-")(ModInt r) const {return make(normS(v+MD-r.v));}auto opBinary(string op:"*")(ModInt r) const {return make((ulong(v)*r.v%MD).to!ulong);}auto opBinary(string op:"^^", T)(T r) const {long x=v;long y=1;while(r){if(r%2==1)y=(y*x)%MD;x=x^^2%MD;r/=2;} return make(y);}auto opBinary(string op:"/")(ModInt r) const {return this*memoize!inv(r);}static ModInt inv(ModInt x) {return x^^(MD-2);}string toString() const {return v.to!string;}auto opOpAssign(string op)(ModInt r) {return mixin ("this=this"~op~"r");}}
alias MInt1 = ModInt!(10^^9 + 7);
alias MInt9 = ModInt!(998_244_353);
void outputForAtCoder(T)(T delegate() fn) {
  static if (is(T == float) || is(T == double) || is(T == real)) "%.16f".writefln(fn());
  else static if (is(T == void)) fn();
  else static if (is(T == string)) fn().writeln;
  else static if (isInputRange!T) {
    static if (!is(string == ElementType!T) && isInputRange!(ElementType!T)) foreach(r; fn()) r.toAnswerString.writeln;
    else foreach(r; fn()) r.writeln;
  }
  else fn().writeln;
}
void runSolver() {
  enum BORDER = "==================================";
  debug { BORDER.writeln; while(!stdin.eof) { "<<< Process time: %s >>>".writefln(benchmark!problem(1)); BORDER.writeln; } }
  else problem();
}
enum YESNO = [true: "Yes", false: "No"];

// -----------------------------------------------

struct GridPoint {
  static enum ZERO = GridPoint(0, 0);
  int x, y;
 
  static GridPoint reversed(int y, int x) {
    return GridPoint(x, y);
  }
 
  this(int x, int y) {
    this.x = x;
    this.y = y;
  }
 
  inout GridPoint left() { return GridPoint(x - 1, y); }
  inout GridPoint right() { return GridPoint(x + 1, y); }
  inout GridPoint up() { return GridPoint(x, y - 1); }
  inout GridPoint down() { return GridPoint(x, y + 1); }
  inout GridPoint leftUp() { return GridPoint(x - 1, y - 1); }
  inout GridPoint leftDown() { return GridPoint(x - 1, y + 1); }
  inout GridPoint rightUp() { return GridPoint(x + 1, y - 1); }
  inout GridPoint rightDown() { return GridPoint(x + 1, y + 1); }
  inout GridPoint[] around() { return [left(), up(), right(), down()]; }
  inout GridPoint[] around(GridPoint max) { GridPoint[] ret; if (x > 0) ret ~= left; if(x < max.x-1) ret ~= right; if(y > 0) ret ~= up; if(y < max.y-1) ret ~= down; return ret; }
  inout T of(T)(inout ref T[][] grid) { return grid[y][x]; }
}
0