結果
問題 | No.1917 LCMST |
ユーザー |
👑 |
提出日時 | 2022-04-29 23:14:55 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 471 ms / 4,000 ms |
コード長 | 2,491 bytes |
コンパイル時間 | 1,030 ms |
コンパイル使用メモリ | 132,408 KB |
実行使用メモリ | 67,228 KB |
最終ジャッジ日時 | 2024-06-22 15:03:05 |
合計ジャッジ時間 | 16,805 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
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)); }int root(int[] uf, int u) {return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));}bool connect(int[] uf, int u, int v) {u = uf.root(u);v = uf.root(v);if (u == v) return false;if (uf[u] > uf[v]) swap(u, v);uf[u] += uf[v];uf[v] = u;return true;}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 freq = new int[lim];foreach (i; 0 .. N) {++freq[A[i]];}long ans;foreach (x; 1 .. lim) if (freq[x] > 0) {ans += 1L * (freq[x] - 1) * x;}alias Edge = Tuple!(long, "c", int, "x", int, "y");Edge[] es;foreach (d; 1 .. lim) {int xm;for (int x = d; x < lim; x += d) if (freq[x] > 0) {if (!xm) {xm = x;} else {es ~= Edge(1L * xm / d * x, xm, x);}}}es.sort;debug {if (lim <= 10) {writeln("es = ", es);}}auto uf = new int[lim];uf[] = -1;foreach (ref e; es) {if (uf.connect(e.x, e.y)) {ans += e.c;}}writeln(ans);}} catch (EOFException e) {}}