結果
問題 | No.1426 Got a Covered OR |
ユーザー | 👑 箱星 |
提出日時 | 2021-03-10 08:07:06 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 871 ms / 2,000 ms |
コード長 | 4,195 bytes |
コンパイル時間 | 13,773 ms |
コンパイル使用メモリ | 454,044 KB |
実行使用メモリ | 153,108 KB |
最終ジャッジ日時 | 2024-04-20 04:13:09 |
合計ジャッジ時間 | 29,457 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 392 ms
139,460 KB |
testcase_01 | AC | 391 ms
139,396 KB |
testcase_02 | AC | 392 ms
139,520 KB |
testcase_03 | AC | 394 ms
139,540 KB |
testcase_04 | AC | 389 ms
139,388 KB |
testcase_05 | AC | 389 ms
139,388 KB |
testcase_06 | AC | 390 ms
139,560 KB |
testcase_07 | AC | 383 ms
139,296 KB |
testcase_08 | AC | 388 ms
139,196 KB |
testcase_09 | AC | 397 ms
139,404 KB |
testcase_10 | AC | 392 ms
139,460 KB |
testcase_11 | AC | 387 ms
139,584 KB |
testcase_12 | AC | 518 ms
140,104 KB |
testcase_13 | AC | 522 ms
140,160 KB |
testcase_14 | AC | 519 ms
140,216 KB |
testcase_15 | AC | 521 ms
140,088 KB |
testcase_16 | AC | 444 ms
139,884 KB |
testcase_17 | AC | 523 ms
141,308 KB |
testcase_18 | AC | 840 ms
152,136 KB |
testcase_19 | AC | 837 ms
152,184 KB |
testcase_20 | AC | 601 ms
141,348 KB |
testcase_21 | AC | 609 ms
141,576 KB |
testcase_22 | AC | 504 ms
140,172 KB |
testcase_23 | AC | 871 ms
151,032 KB |
testcase_24 | AC | 504 ms
140,152 KB |
testcase_25 | AC | 828 ms
149,104 KB |
testcase_26 | AC | 838 ms
153,108 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* // region ModInt class ModInt(x: Long) { companion object { const val MOD = 1000000007L //const val MOD = 998244353L } 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" } } fun Long.toModInt(): ModInt { return ModInt(this) } fun Int.toModInt(): ModInt { return 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 class CombinationCalculator { companion object { private const val fac_size = 600000 } private val arrFac = Array(fac_size) { ModInt(1) } private val arrInvfac = Array(fac_size) { ModInt(1) } init { for (i in 1 until fac_size) { arrFac[i] = arrFac[i - 1] * ModInt(i) } arrInvfac[fac_size - 1] = arrFac[fac_size - 1].inv() for (i in fac_size - 2 downTo 1) { arrInvfac[i] = arrInvfac[i + 1] * ModInt(i + 1) } } fun fac(n: Int): ModInt { return arrFac[n] } fun fac(n: Long): ModInt { return fac(n.toInt()) } fun invfac(n: Int): ModInt { return arrInvfac[n] } fun invfac(n: Long): ModInt { return invfac(n.toInt()) } fun binom(n: Long, k: Long): ModInt { return if (k in 0..n) { arrFac[n.toInt()] * arrInvfac[k.toInt()] * arrInvfac[(n - k).toInt()] } else { ModInt(0) } } } val cc = CombinationCalculator() fun PrintWriter.solve() { val n = nextInt() val b = Array(n) { nextLong() } var prev = 0L var streak = 0L var ans = ModInt(1) for (i in 0 until n) { if (b[i] == -1L) streak++ else { var c01 = 0L var c11 = 0L for (j in 0 until 32) { when ((prev.shr(j) % 2) to (b[i].shr(j) % 2)) { 0L to 1L -> { c01++ } 1L to 1L -> { c11++ } 1L to 0L -> { println(0) return } } } ans *= calc(streak + 1, c01, c11) prev = b[i] streak = 0L } } println(ans) } fun calc(a: Long, b: Long, c: Long): ModInt { var ret = ModInt(0) for (i in 0..b) { val v = cc.binom(b, i) * ModInt(1L.shl((b + c - i).toInt()) - 1).pow(a) if (i % 2 == 0L) ret += v else ret -= v } return ret } fun main() { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() } // 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