結果

問題 No.936 Are
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-11-29 23:10:58
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 611 ms / 3,000 ms
コード長 5,422 bytes
コンパイル時間 1,524 ms
コンパイル使用メモリ 153,712 KB
実行使用メモリ 84,880 KB
最終ジャッジ日時 2023-09-04 03:30:43
合計ジャッジ時間 8,967 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
4,376 KB
testcase_01 AC 285 ms
83,644 KB
testcase_02 AC 611 ms
83,388 KB
testcase_03 AC 4 ms
4,376 KB
testcase_04 AC 5 ms
4,376 KB
testcase_05 AC 3 ms
4,376 KB
testcase_06 AC 4 ms
4,376 KB
testcase_07 AC 3 ms
4,376 KB
testcase_08 AC 3 ms
4,376 KB
testcase_09 AC 4 ms
4,376 KB
testcase_10 AC 4 ms
5,004 KB
testcase_11 AC 4 ms
4,376 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 164 ms
24,684 KB
testcase_14 AC 490 ms
68,444 KB
testcase_15 AC 194 ms
29,404 KB
testcase_16 AC 351 ms
49,656 KB
testcase_17 AC 318 ms
44,768 KB
testcase_18 AC 127 ms
21,200 KB
testcase_19 AC 576 ms
79,308 KB
testcase_20 AC 586 ms
79,524 KB
testcase_21 AC 520 ms
73,112 KB
testcase_22 AC 319 ms
44,772 KB
testcase_23 AC 596 ms
84,880 KB
testcase_24 AC 597 ms
84,296 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(int M_) {
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  string toString() const { return x.to!string; }
}

enum MO = 10^^9 + 7;
alias Mint = ModInt!MO;

enum M = 5;

void main() {
  int V;
  auto ids = new int[][][][](M, M, M, M);
  foreach (a; 0 .. M) foreach (b; 0 .. M) foreach (c; 0 .. M) foreach (d; 0 .. M) {
    ids[a][b][c][d] = V++;
  }
  auto winMoves = new int[][V];
  auto moves = new int[][V];
  foreach (a; 0 .. M) foreach (b; 0 .. M) foreach (c; 0 .. M) foreach (d; 0 .. M) {
    if (a + b == 0 || c + d == 0) {
      continue;
    }
    const u = ids[a][b][c][d];
    void check(int aa, int bb, int cc, int dd) {
      const v = ids[aa][bb][cc][dd];
      if (aa + bb == 0) {
        winMoves[u] ~= v;
      } else {
        moves[u] ~= v;
      }
    }
    // attack
    if (a != 0 && c != 0) check((c + a) % M, d, a, b);
    if (b != 0 && c != 0) check((c + b) % M, d, a, b);
    if (a != 0 && d != 0) check(c, (d + a) % M, a, b);
    if (b != 0 && d != 0) check(c, (d + b) % M, a, b);
    // split
    foreach (x; 0 .. M) foreach (y; 0 .. M) {
      if (a + b == x + y || (a + b) % M == x + y) {
        if (a == y && b == x) continue;
        if (a == x && b == y) continue;
        if (x + y == 0) continue;
        check(c, d, x, y);
      }
    }
    assert(!winMoves[u].empty || !moves[u].empty);
  }
  auto takahashi = new int[][V];
  foreach (u; 0 .. V) {
    if (winMoves[u].empty) {
      foreach (v; moves[u]) {
        if (winMoves[v].empty) {
          takahashi[u] ~= v;
        }
      }
      if (takahashi[u].empty) {
        debug {
          writeln("misery ", u);
        }
        takahashi[u] = moves[u].dup;
      }
    }
  }
  
  debug {
    foreach (a; 0 .. M) foreach (b; 0 .. M) foreach (c; 0 .. M) foreach (d; 0 .. M) {
      const u = ids[a][b][c][d];
      if (!winMoves[u].empty) {
        writeln(a, " ", b, " ", c, " ", d, ": ", winMoves[u]);
      }
    }
  }
  
  try {
    for (; ; ) {
      const N = readInt();
      const K = readInt();
      int[2] L, R;
      foreach (i; 0 .. 2) {
        L[i] = readInt();
        R[i] = readInt();
      }
      
      Mint ans;
      auto dp = new Mint[][](K + 1, V);
      dp[0][ids[L[N]][R[N]][L[N ^ 1]][R[N ^ 1]]] = 1;
      foreach (k; 0 .. K) {
        const player = N ^ (k & 1);
        switch (player) {
          case 0: {
            foreach (u; 0 .. V) {
              foreach (v; winMoves[u]) {
                ans += dp[k][u];
              }
              foreach (v; moves[u]) {
                dp[k + 1][v] += dp[k][u];
              }
            }
          } break;
          case 1: {
            foreach (u; 0 .. V) {
              foreach (v; takahashi[u]) {
                dp[k + 1][v] += dp[k][u];
              }
            }
          } break;
          default: assert(false);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0