結果
問題 | No.1426 Got a Covered OR |
ユーザー | 👑 箱星 |
提出日時 | 2021-01-13 09:26:49 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 888 ms / 2,000 ms |
コード長 | 4,135 bytes |
コンパイル時間 | 17,231 ms |
コンパイル使用メモリ | 451,304 KB |
実行使用メモリ | 103,612 KB |
最終ジャッジ日時 | 2024-05-01 19:06:58 |
合計ジャッジ時間 | 32,654 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 314 ms
59,104 KB |
testcase_01 | AC | 324 ms
59,416 KB |
testcase_02 | AC | 322 ms
59,324 KB |
testcase_03 | AC | 317 ms
60,536 KB |
testcase_04 | AC | 318 ms
63,624 KB |
testcase_05 | AC | 317 ms
59,384 KB |
testcase_06 | AC | 315 ms
59,312 KB |
testcase_07 | AC | 318 ms
59,188 KB |
testcase_08 | AC | 322 ms
59,440 KB |
testcase_09 | AC | 317 ms
59,040 KB |
testcase_10 | AC | 319 ms
59,164 KB |
testcase_11 | AC | 318 ms
58,968 KB |
testcase_12 | AC | 479 ms
63,796 KB |
testcase_13 | AC | 473 ms
64,456 KB |
testcase_14 | AC | 471 ms
63,316 KB |
testcase_15 | AC | 483 ms
63,380 KB |
testcase_16 | AC | 384 ms
60,016 KB |
testcase_17 | AC | 490 ms
69,956 KB |
testcase_18 | AC | 812 ms
99,172 KB |
testcase_19 | AC | 854 ms
98,836 KB |
testcase_20 | AC | 574 ms
92,376 KB |
testcase_21 | AC | 586 ms
92,704 KB |
testcase_22 | AC | 488 ms
66,340 KB |
testcase_23 | AC | 888 ms
103,612 KB |
testcase_24 | AC | 467 ms
70,140 KB |
testcase_25 | AC | 857 ms
101,552 KB |
testcase_26 | AC | 839 ms
101,516 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* // region ModInt const val MOD = 1000000007L class ModInt(x: Long) { 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) } const val fac_size = 600000 var fac_initialized = false val arr_fac = LongArray(fac_size) { 1 } val arr_invfac = LongArray(fac_size) { 1 } fun facInitialize() { for (i in 1 until fac_size) { arr_fac[i] = arr_fac[i - 1] * i % MOD } arr_invfac[fac_size - 1] = arr_fac[fac_size - 1].toModInt().inv().x for (i in fac_size - 2 downTo 1) { arr_invfac[i] = arr_invfac[i + 1] * (i + 1) % MOD } fac_initialized = true } fun fac(n: Int): ModInt { if (!fac_initialized) facInitialize() return arr_fac[n].toModInt() } fun fac(n: Long): ModInt { return fac(n.toInt()) } fun invfac(n: Int): ModInt { if (!fac_initialized) facInitialize() return arr_invfac[n].toModInt() } fun invfac(n: Long): ModInt { return invfac(n.toInt()) } fun comb(n: Long, k: Long): ModInt { return if (k in 0..n) { if (!fac_initialized) facInitialize() arr_fac[n.toInt()].toModInt() * arr_invfac[k.toInt()].toModInt() * arr_invfac[(n - k).toInt()].toModInt() } else { ModInt(0) } } fun comb2(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 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 = comb(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