#871580 (D) No.2313 Product of Subsequence (hard)

提出ソース

結果

問題	No.2313 Product of Subsequence (hard)
ユーザー	👑 hos.lyric
提出日時	2023-05-24 21:13:34
言語	D (dmd 2.106.1)
結果	WA
実行時間	-
コード長	5,537 bytes
コンパイル時間	1,539 ms
コンパイル使用メモリ	158,640 KB
実行使用メモリ	45,856 KB
最終ジャッジ日時	2024-06-22 17:57:46
合計ジャッジ時間	8,210 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	16 ms 12,076 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	AC	18 ms 10,888 KB
testcase_22	AC	16 ms 12,180 KB
testcase_23	AC	16 ms 10,992 KB
testcase_24	AC	17 ms 11,944 KB
testcase_25	AC	122 ms 25,856 KB
testcase_26	AC	81 ms 19,892 KB
testcase_27	WA	-
testcase_28	AC	123 ms 27,416 KB
testcase_29	AC	153 ms 28,536 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`

ソースコード

raw source code

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

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

enum MO = 998244353;
alias Mint = ModInt!MO;

enum LIM_INV = 6 * 10^^5 + 10;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM_INV];
  fac = new Mint[LIM_INV];
  invFac = new Mint[LIM_INV];
  inv[1] = 1;
  foreach (i; 2 .. LIM_INV) {
    inv[i] = -((Mint.M / i) * inv[cast(size_t)(Mint.M % i)]);
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM_INV) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (n < 0) {
    if (k >= 0) {
      return (-1)^^(k & 1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (-1)^^((n - k) & 1) * binom(-k - 1, n - k);
    } else {
      return Mint(0);
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
    } else {
      return Mint(0);
    }
  }
}


void main() {
  prepare;
  
  try {
    for (; ; ) {
      const N = readInt;
      const K = readLong;
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
      }
      
      long[] ds;
      for (long d = 1; d * d <= K; ++d) if (K % d == 0) {
        ds ~= d;
        if (d != K / d) ds ~= K / d;
      }
      ds.sort;
      const dsLen = cast(int)(ds.length);
      debug {
        writeln("ds = ", ds);
      }
      int[long] ids;
      foreach (j; 0 .. dsLen) {
        ids[ds[j]] = j;
      }
      auto mul = new int[][](dsLen, dsLen);
      foreach (j; 0 .. dsLen) foreach (k; 0 .. dsLen) {
        mul[j][k] = ids[gcd(ds[j] * ds[k], K)];
      }
      
      auto freq = new int[dsLen];
      foreach (i; 0 .. N) {
        ++freq[ids[gcd(A[i], K)]];
      }
      debug {
        writeln("freq = ", freq);
      }
      
      auto crt = new Mint[dsLen];
      crt[0] = Mint(2)^^freq[0];
      foreach (j; 1 .. dsLen) {
        auto nxt = new Mint[dsLen];
        const f = freq[j];
        const two = Mint(2)^^f;
        foreach (k; 0 .. dsLen) {
          Mint lot = two;
          int kk = k;
          foreach (e; 0 .. f + 1) {
            const bn = binom(f, e);
            nxt[kk] += crt[k] * bn;
            lot -= bn;
            if (kk == mul[kk][j]) break;
            kk = mul[kk][j];
          }
          nxt[dsLen - 1] += crt[k] * lot;
        }
        debug {
          writeln(ds[j], " ", nxt);
        }
        crt = nxt;
      }
      
      Mint ans = crt[dsLen - 1];
      if (K == 1) {
        ans -= 1;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード