結果

問題 No.1759 Silver Tour
コンテスト
ユーザー hos.lyric
提出日時 2021-11-20 17:19:13
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 5,126 bytes
コンパイル時間 1,480 ms
コンパイル使用メモリ 155,928 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-22 13:24:22
合計ジャッジ時間 2,602 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

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.mathspecial, 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 {
  static int 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 if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      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; }
}

alias Mint = ModInt;


enum DX = [-1, -1, +1, +1, +1];
enum DY = [-1, +1, -1, 0, +1];

void main() {
  debug {
    foreach (n; 2 .. 16 + 1) {
      foreach (s; 0 .. n) {
        auto cnt = new int[n];
        auto vis = new bool[][](2, n);
        void dfs(int len, int x, int y) {
          if (vis[x][y]) return;
          vis[x][y] = true;
          if (len == 2 * n) {
            assert(x == 1);
            ++cnt[y];
          } else {
            foreach (dir; 0 .. 5) {
              const xx = x + DX[dir];
              const yy = y + DY[dir];
              if (0 <= xx && xx < 2 && 0 <= yy && yy < n) {
                dfs(len + 1, xx, yy);
              }
            }
          }
          vis[x][y] = false;
        }
        dfs(1, 0, s);
        writeln(cnt);
        foreach (t; 0 .. 2) {
          int c;
          if (s < t && s % 2 == 0 && (n - 1 - t) % 2 == 0) ++c;
          if (t < s && t % 2 == 0 && (n - 1 - s) % 2 == 0) ++c;
          if (n % 2 != 0 && s == 0 && t == 0) ++c;
          if (n % 2 != 0 && s == n - 1 && t == n - 1) ++c;
          assert(cnt[t] == c);
        }
      }
      writeln;
    }
  }
  
  try {
    for (; ; ) {
      const H = readInt();
      const W = readInt();
      Mint.M = readInt();
      
      Mint ans;
      if (W == 1) {
        ans = Mint(1);
      } else {
        if (H % 2 == 0) {
          auto f = new int[][](W, W);
          foreach (s; 0 .. W) foreach (t; 0 .. W) {
            int c;
            if (s < t && s % 2 == 0 && (W - 1 - t) % 2 == 0) ++c;
            if (t < s && t % 2 == 0 && (W - 1 - s) % 2 == 0) ++c;
            if (W % 2 != 0 && s == 0 && t == 0) ++c;
            if (W % 2 != 0 && s == W - 1 && t == W - 1) ++c;
            f[s][t] = c;
          }
          auto crt = new Mint[W];
          foreach (s; 0 .. W) foreach (t; 0 .. W) {
            crt[t] += f[s][t];
          }
          foreach (h; 1 .. H / 2) {
            auto nxt = new Mint[W];
            foreach (r; 0 .. W) {
              foreach (s; r - 1 .. r + 1 + 1) if (0 <= s && s < W) {
                foreach (t; 0 .. W) if (f[s][t]) {
                  nxt[t] += crt[r];
                }
              }
            }
            crt = nxt;
          }
          foreach (r; 0 .. W) {
            ans += crt[r];
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0