結果
問題 | No.2211 Frequency Table of GCD |
ユーザー | 👑 箱 |
提出日時 | 2023-02-10 21:58:30 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 1,716 ms / 2,000 ms |
コード長 | 3,735 bytes |
コンパイル時間 | 20,417 ms |
コンパイル使用メモリ | 431,596 KB |
実行使用メモリ | 77,416 KB |
最終ジャッジ日時 | 2023-09-22 01:07:47 |
合計ジャッジ時間 | 45,341 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 306 ms
58,880 KB |
testcase_01 | AC | 304 ms
59,048 KB |
testcase_02 | AC | 303 ms
57,156 KB |
testcase_03 | AC | 624 ms
70,460 KB |
testcase_04 | AC | 949 ms
69,292 KB |
testcase_05 | AC | 1,142 ms
73,160 KB |
testcase_06 | AC | 1,016 ms
72,304 KB |
testcase_07 | AC | 1,191 ms
74,872 KB |
testcase_08 | AC | 464 ms
57,984 KB |
testcase_09 | AC | 439 ms
58,264 KB |
testcase_10 | AC | 464 ms
60,368 KB |
testcase_11 | AC | 478 ms
59,896 KB |
testcase_12 | AC | 448 ms
60,472 KB |
testcase_13 | AC | 924 ms
66,364 KB |
testcase_14 | AC | 962 ms
68,596 KB |
testcase_15 | AC | 895 ms
71,320 KB |
testcase_16 | AC | 981 ms
69,384 KB |
testcase_17 | AC | 1,081 ms
72,916 KB |
testcase_18 | AC | 1,374 ms
74,840 KB |
testcase_19 | AC | 1,385 ms
76,824 KB |
testcase_20 | AC | 1,329 ms
77,416 KB |
testcase_21 | AC | 1,354 ms
76,720 KB |
testcase_22 | AC | 1,373 ms
76,936 KB |
testcase_23 | AC | 568 ms
68,492 KB |
testcase_24 | AC | 750 ms
75,192 KB |
testcase_25 | AC | 466 ms
59,952 KB |
testcase_26 | AC | 303 ms
59,296 KB |
testcase_27 | AC | 1,716 ms
75,056 KB |
testcase_28 | AC | 749 ms
75,852 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val m = nextInt() val a = Array(n) { nextInt() } val freq = Array(m + 1) { 0L } val counter = Array(m + 1) { 0L } for (v in a) { freq[v]++ } for (v in 1..m) { if (freq[v] == 0L) continue // region divisors val number = v.toLong() val divs = mutableListOf<Long>() var divisor = 1L while (divisor * divisor <= number) { if (number % divisor == 0L) { divs.add(divisor) if (divisor * divisor != number) { divs.add(number / divisor) } } divisor++ } // endregion for (d in divs) { counter[d.toInt()] += freq[v] } } val ans = Array(m + 1) { ModInt(0) } for (k in m downTo 1) { ans[k] = ModInt(2).pow(counter[k]) - ModInt(1) for (l in 2 * k..m step k) { ans[k] -= ans[l] } } println(ans.drop(1).joinToString("\n")) } // region ModInt class ModInt(x: Long) { companion object { const val MOD = 998244353L //const val MOD = 1000000007L } constructor(y: Int) : this(y.toLong()) val x = (x % MOD + MOD) % MOD operator fun plus(other: ModInt): ModInt { return ModInt(x + other.x) } operator fun minus(other: ModInt): ModInt { return ModInt(x - other.x) } operator fun times(other: ModInt): ModInt { return ModInt(x * other.x) } operator fun div(other: ModInt): ModInt { return this * other.inv() } fun pow(exp: Long): ModInt { if (exp == 0L) return ModInt(1L) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } fun inv(): ModInt { return this.pow(MOD - 2) } override fun equals(other: Any?): Boolean { if (this === other) return true if (javaClass != other?.javaClass) return false other as ModInt if (x != other.x) return false return true } override fun hashCode(): Int { return x.hashCode() } override fun toString(): String { return "$x" } } class ModIntArray(n: Int) { private val a = LongArray(n) { 0L } constructor(n: Int, init: (Int) -> ModInt) : this(n) { for (i in 0 until n) { a[i] = init(i).x } } operator fun set(i: Int, x: ModInt) { a[i] = x.x } operator fun get(i: Int): ModInt { return ModInt(a[i]) } fun joinToString(s: String = ", "): String { return a.joinToString(s) } } fun Long.toModInt() = ModInt(this) fun Int.toModInt() = ModInt(this) fun binomSimple(n: Long, k: Long): ModInt { var numer = ModInt(1) var denom = ModInt(1) for (i in 0 until k) { numer *= ModInt(n - i) denom *= ModInt(k - i) } return numer / denom } // endregion fun main() { Thread(null, { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() }, "solve", abs(1L.shl(26))) .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } } .apply { start() }.join() } // region Scanner private var st = StringTokenizer("") private val br = System.`in`.bufferedReader() fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() // endregion