結果

問題 No.2497 GCD of LCMs
ユーザー 👑 hos.lyrichos.lyric
提出日時 2023-10-06 22:04:41
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 4,989 bytes
コンパイル時間 4,282 ms
コンパイル使用メモリ 175,360 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-26 16:09:23
合計ジャッジ時間 2,882 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 8 ms
5,376 KB
testcase_08 AC 20 ms
5,376 KB
testcase_09 AC 22 ms
5,376 KB
testcase_10 AC 35 ms
5,376 KB
testcase_11 AC 17 ms
5,376 KB
testcase_12 AC 38 ms
5,376 KB
testcase_13 AC 48 ms
5,376 KB
testcase_14 AC 23 ms
5,376 KB
testcase_15 AC 22 ms
5,376 KB
testcase_16 AC 49 ms
5,376 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; }

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

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


enum INF = 1001001001;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      auto C = new int[N];
      foreach (u; 0 .. N) {
        C[u] = readInt;
      }
      auto A = new int[M];
      auto B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      
      int[] ps;
      foreach (i; 0 .. N) {
        int c = C[i];
        for (int p = 2; p * p <= c; ++p) if (c % p == 0) {
          ps ~= p;
          do {
            c /= p;
          } while (c % p == 0);
        }
        if (c > 1) {
          ps ~= c;
        }
      }
      ps = ps.sort.uniq.array;
      debug {
        writeln("ps = ", ps);
      }
      
      auto graph = new int[][N];
      foreach (i; 0 .. M) {
        graph[A[i]] ~= B[i];
        graph[B[i]] ~= A[i];
      }
      
      auto ans = new Mint[N];
      ans[] = Mint(1);
      foreach (p; ps) {
        auto es = new int[N];
        foreach (u; 0 .. N) {
          for (int c = C[u]; c % p == 0; c /= p) ++es[u];
        }
        alias Entry = Tuple!(int, "c", int, "u");
        BinaryHeap!(Array!Entry, "a.c > b.c") que;
        auto dist = new int[N];
        dist[] = INF;
        que.insert(Entry(dist[0] = es[0], 0));
        for (; !que.empty; ) {
          const c = que.front.c;
          const u = que.front.u;
          que.removeFront;
          if (dist[u] == c) {
            foreach (v; graph[u]) {
              const cc = max(c, es[v]);
              if (chmin(dist[v], cc)) {
                que.insert(Entry(cc, v));
              }
            }
          }
        }
        debug {
          writeln(p, ": ", dist);
        }
        foreach (u; 0 .. N) {
          ans[u] *= Mint(p)^^dist[u];
        }
      }
      foreach (u; 0 .. N) {
        writeln(ans[u]);
      }
    }
  } catch (EOFException e) {
  }
}
0