結果

問題 No.2075 GCD Subsequence
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-09-16 21:26:36
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 481 ms / 4,000 ms
コード長 4,340 bytes
コンパイル時間 1,675 ms
コンパイル使用メモリ 159,388 KB
実行使用メモリ 35,788 KB
最終ジャッジ日時 2024-06-22 16:14:07
合計ジャッジ時間 10,624 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,820 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 2 ms
6,944 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 145 ms
25,984 KB
testcase_09 AC 223 ms
33,892 KB
testcase_10 AC 149 ms
26,212 KB
testcase_11 AC 206 ms
20,952 KB
testcase_12 AC 170 ms
25,884 KB
testcase_13 AC 131 ms
25,464 KB
testcase_14 AC 200 ms
20,664 KB
testcase_15 AC 134 ms
24,164 KB
testcase_16 AC 143 ms
24,976 KB
testcase_17 AC 218 ms
34,488 KB
testcase_18 AC 465 ms
35,244 KB
testcase_19 AC 465 ms
33,908 KB
testcase_20 AC 481 ms
33,576 KB
testcase_21 AC 469 ms
34,516 KB
testcase_22 AC 465 ms
34,584 KB
testcase_23 AC 473 ms
35,788 KB
testcase_24 AC 469 ms
34,292 KB
testcase_25 AC 472 ms
34,132 KB
testcase_26 AC 473 ms
33,624 KB
testcase_27 AC 468 ms
35,148 KB
testcase_28 AC 378 ms
28,472 KB
testcase_29 AC 1 ms
6,944 KB
testcase_30 AC 1 ms
6,940 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.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(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;


void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt;
      }
      
      const lim = A.maxElement + 1;
      auto lpf = iota(lim).array;
      foreach (p; 2 .. lim) if (lpf[p] == p) {
        for (int n = 2 * p; n < lim; n += p) chmin(lpf[n], p);
      }
      
      auto dp = new Mint[N];
      auto sums = new Mint[lim];
      foreach (i; 0 .. N) {
        int[] ps;
        for (int a = A[i]; a > 1; ) {
          const p = lpf[a];
          ps ~= p;
          do {
            a /= p;
          } while (a % p == 0);
        }
        const psLen = cast(int)(ps.length);
        auto prod = new int[1 << psLen];
        prod[0] = 1;
        foreach (j; 0 .. psLen) {
          foreach (h; 0 .. 1 << j) {
            prod[h | 1 << j] = prod[h] * ps[j];
          }
        }
        dp[i] = 1;
        foreach (h; 1 .. 1 << psLen) {
          dp[i] += (-1)^^((popcnt(h) - 1) & 1) * sums[prod[h]];
        }
        foreach (h; 1 .. 1 << psLen) {
          sums[prod[h]] += dp[i];
        }
      }
      debug {
        writeln("dp = ", dp);
      }
      
      const ans = dp.sum;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0