結果

問題 No.8120 Aoki's Present for Takahashi
コンテスト
ユーザー hos.lyric
提出日時 2025-04-01 21:38:09
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 250 ms / 2,000 ms
コード長 5,373 bytes
コンパイル時間 685 ms
コンパイル使用メモリ 108,868 KB
実行使用メモリ 23,928 KB
最終ジャッジ日時 2025-04-01 23:11:56
合計ジャッジ時間 6,027 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = cast(uint)(x_ % M); }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}


// a x + b y = (+/-) gcd(a, b)
//   (a, 0): g = a, x = 1, y = 0
//   (0, b), (b, b), (-b, b) (b != 0): g = b, x = 0, y = 1
//   otherwise: 2 |x| <= |b|, 2 |y| <= |a|
// T: int, long
S gojo(S)(S a, S b, out S x, out S y) {
  if (b != 0) {
    const S g = gojo(b, a % b, y, x);
    y -= (a / b) * x;
    return g;
  } else {
    x = 1;
    y = 0;
    return a;
  }
}

// x == b0  (mod m0),  x == b1  (mod m1)
// S: signed integer
Tuple!(S, "m", S, "b") modSystem(S)(S m0, S b0, S m1, S b1) {
  import std.algorithm.mutation : swap;
  import std.typecons : tuple;
  assert(m0 >= 1, "[modSystem] m0 >= 1 must hold.");
  assert(m1 >= 1, "[modSystem] m1 >= 1 must hold.");
  if ((b0 %= m0) < 0) b0 += m0;
  if ((b1 %= m1) < 0) b1 += m1;
  if (m0 < m1) {
    swap(m0, m1);
    swap(b0, b1);
  }
  // to avoid overflow
  if (m0 % m1 == 0) {
    if (b0 % m1 != b1) return tuple!(S, "m", S, "b")(0, 0);
    return tuple!(S, "m", S, "b")(m0, b0);
  }
  S z0, z1;
  const S g = gojo(m0, m1, z0, z1);
  b1 -= b0;
  if (b1 % g != 0) return tuple!(S, "m", S, "b")(0, 0);
  (b1 /= g) %= m1;
  m1 /= g;
  b0 += m0 * ((z0 * b1) % m1);
  m0 *= m1;
  if (b0 < 0) b0 += m0;
  return tuple!(S, "m", S, "b")(m0, b0);
}


class Solver(int P) {
  alias Mint = ModInt!P;
  Mint[] fac, invFac;
  this() {
    fac = new Mint[P];
    invFac = new Mint[P];
    fac[0] = 1;
    foreach (i; 1 .. P) fac[i] = fac[i - 1] * i;
    invFac[P - 1] = fac[P - 1].inv;
    foreach_reverse (i; 1 .. P) invFac[i - 1] = i * invFac[i];
  }
  Mint binom(int n, int k) {
    Mint ret = 1;
    for (; k; n /= P, k /= P) {
      const nr = n % P;
      const kr = k % P;
      if (nr < kr) return Mint(0);
      ret *= fac[nr] * invFac[kr] * invFac[nr - kr];
    }
    return ret;
  }
}

enum P0 = 443;
enum P1 = 2253371;

void main() {
  auto s0 = new Solver!P0;
  auto s1 = new Solver!P1;
  
  try {
    for (; ; ) {
      const Text = readInt;
      const Tau = readInt;
      foreach (t; 1 .. Tau + 1) {
        const N = readInt;
        const M = readInt;
        if (t == Text) {
          writeln(-1);
        } else {
          const long b0 = s0.binom(M, N).x;
          const long b1 = s1.binom(M, N).x;
          const ans = modSystem!long(P0, b0, P1, b1);
          writeln(ans.b);
        }
      }
    }
  } catch (EOFException e) {
  }
}
0