結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
|
提出日時 | 2022-01-11 11:32:21 |
言語 | Kotlin (2.1.0) |
結果 |
AC
|
実行時間 | 1,676 ms / 2,000 ms |
コード長 | 1,627 bytes |
コンパイル時間 | 17,117 ms |
コンパイル使用メモリ | 441,800 KB |
実行使用メモリ | 144,580 KB |
最終ジャッジ日時 | 2024-11-14 11:34:06 |
合計ジャッジ時間 | 57,520 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
ソースコード
class SegmentTree(initial: List<Long>) {private val half = ceilPow2(initial.size)private val vec = LongArray(half * 2)init {for (i in initial.indices) {vec[half + i] = initial[i]}for (i in half - 1 downTo 1) {vec[i] = gcd(vec[i * 2], vec[i * 2 + 1])}}fun get(from: Int, until: Int): Long {check(from in vec.indices && until in 0 .. vec.size)var l = from + halfvar r = until + halfvar result = 0Lwhile (l < r) {if (l and 1 == 1) {result = gcd(result, vec[l])l += 1}if (r and 1 == 1) {r -= 1result = gcd(result, vec[r])}l = l shr 1r = r shr 1}return result}companion object {fun ceilPow2(value: Int): Int {var result = 1while (result < value) {result *= 2}return result}}}tailrec fun gcd(a: Long, b: Long): Long {return when(b){0L -> aelse -> gcd(b, a % b)}}fun main() {val n = readLine()!!.trim().toInt()val num = readLine()!!.trim().split(' ').map(String::toLong)val seg = SegmentTree(num)var j = 0var result = 0Lfor (i in 0 until n) {var d = seg.get(i, j)while (j in num.indices && d != 1L) {d = gcd(d, num[j])j += 1}if (d == 1L) {result += n - j + 1}}println(result)}