結果

問題 No.1948 足し算するだけのパズルゲーム(1)
ユーザー allegrogikenallegrogiken
提出日時 2022-05-21 00:06:52
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 275 ms / 2,000 ms
コード長 4,271 bytes
コンパイル時間 952 ms
コンパイル使用メモリ 134,096 KB
実行使用メモリ 58,332 KB
最終ジャッジ日時 2024-06-22 15:18:10
合計ジャッジ時間 5,147 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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,940 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 156 ms
34,380 KB
testcase_08 AC 114 ms
26,676 KB
testcase_09 AC 181 ms
33,176 KB
testcase_10 AC 188 ms
34,992 KB
testcase_11 AC 118 ms
27,096 KB
testcase_12 AC 117 ms
28,468 KB
testcase_13 AC 112 ms
29,188 KB
testcase_14 AC 112 ms
27,992 KB
testcase_15 AC 98 ms
26,152 KB
testcase_16 AC 1 ms
6,940 KB
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 1 ms
6,948 KB
testcase_19 AC 1 ms
6,940 KB
testcase_20 AC 260 ms
48,816 KB
testcase_21 AC 258 ms
48,852 KB
testcase_22 AC 90 ms
26,264 KB
testcase_23 AC 89 ms
26,328 KB
testcase_24 AC 275 ms
58,332 KB
testcase_25 AC 256 ms
48,928 KB
testcase_26 AC 264 ms
51,180 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

void main() { runSolver(); }

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

  auto solve() {
    auto dp = new long[][][](H, W, 2);
    dp[0][0][] = A[0][0];

    alias Point = Tuple!(int, "x", int, "y", int, "c");
    auto visited = new bool[][][](H, W, 2);

    for(auto q = DList!Point([Point(0, 0, 0)]); !q.empty;) {
      auto p = q.front;
      q.removeFront;
      if (visited[p.y][p.x][p.c]) continue;

      visited[p.y][p.x][p.c] = true;
      auto strength = dp[p.y][p.x][p.c];

      foreach(a; [Point(p.x + 1, p.y, p.c), Point(p.x, p.y + 1, p.c)]) {
        if (a.x >= W || a.y >= H) continue;
        // deb(a, strength);
        
        if (strength > A[a.y][a.x]) {
          if (dp[a.y][a.x][a.c].chmax(strength + A[a.y][a.x])) {
            q.insertBack(Point(a.x, a.y, a.c));
          }
        } else {
          if (a == Point(W - 1, H - 1, 0)) continue;
          if (a.c == 0 && dp[a.y][a.x][1].chmax(strength)) {
            q.insertBack(Point(a.x, a.y, 1));
          } 
        }
      }
    }

    // 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"];

// -----------------------------------------------
0