結果
問題 | No.1426 Got a Covered OR |
ユーザー | 👑 箱星 |
提出日時 | 2021-03-10 08:05:53 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 1,162 ms / 2,000 ms |
コード長 | 3,170 bytes |
コンパイル時間 | 14,018 ms |
コンパイル使用メモリ | 444,344 KB |
実行使用メモリ | 97,504 KB |
最終ジャッジ日時 | 2024-04-20 04:12:09 |
合計ジャッジ時間 | 28,100 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 266 ms
54,292 KB |
testcase_01 | AC | 254 ms
54,264 KB |
testcase_02 | AC | 262 ms
54,480 KB |
testcase_03 | AC | 261 ms
54,376 KB |
testcase_04 | AC | 266 ms
54,452 KB |
testcase_05 | AC | 256 ms
54,512 KB |
testcase_06 | AC | 268 ms
54,436 KB |
testcase_07 | AC | 266 ms
54,360 KB |
testcase_08 | AC | 263 ms
54,388 KB |
testcase_09 | AC | 258 ms
54,308 KB |
testcase_10 | AC | 260 ms
54,312 KB |
testcase_11 | AC | 264 ms
54,408 KB |
testcase_12 | AC | 374 ms
59,296 KB |
testcase_13 | AC | 379 ms
59,328 KB |
testcase_14 | AC | 404 ms
59,360 KB |
testcase_15 | AC | 414 ms
59,272 KB |
testcase_16 | AC | 335 ms
56,972 KB |
testcase_17 | AC | 426 ms
75,060 KB |
testcase_18 | AC | 914 ms
95,576 KB |
testcase_19 | AC | 811 ms
94,580 KB |
testcase_20 | AC | 527 ms
87,388 KB |
testcase_21 | AC | 557 ms
89,268 KB |
testcase_22 | AC | 392 ms
61,576 KB |
testcase_23 | AC | 1,162 ms
97,504 KB |
testcase_24 | AC | 386 ms
65,496 KB |
testcase_25 | AC | 1,083 ms
95,564 KB |
testcase_26 | AC | 803 ms
94,748 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 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 = binomSimple(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