結果
問題 | No.1426 Got a Covered OR |
ユーザー | 箱星 |
提出日時 | 2021-03-10 08:05:53 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 1,135 ms / 2,000 ms |
コード長 | 3,170 bytes |
コンパイル時間 | 16,348 ms |
コンパイル使用メモリ | 445,780 KB |
実行使用メモリ | 97,072 KB |
最終ジャッジ日時 | 2024-10-11 23:07:52 |
合計ジャッジ時間 | 30,159 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 270 ms
54,128 KB |
testcase_01 | AC | 268 ms
54,076 KB |
testcase_02 | AC | 269 ms
54,100 KB |
testcase_03 | AC | 269 ms
54,348 KB |
testcase_04 | AC | 275 ms
54,076 KB |
testcase_05 | AC | 270 ms
54,052 KB |
testcase_06 | AC | 275 ms
54,136 KB |
testcase_07 | AC | 277 ms
54,156 KB |
testcase_08 | AC | 287 ms
54,140 KB |
testcase_09 | AC | 283 ms
54,128 KB |
testcase_10 | AC | 275 ms
54,164 KB |
testcase_11 | AC | 278 ms
54,160 KB |
testcase_12 | AC | 396 ms
59,072 KB |
testcase_13 | AC | 404 ms
58,840 KB |
testcase_14 | AC | 384 ms
59,220 KB |
testcase_15 | AC | 403 ms
59,208 KB |
testcase_16 | AC | 338 ms
56,620 KB |
testcase_17 | AC | 433 ms
72,736 KB |
testcase_18 | AC | 773 ms
94,480 KB |
testcase_19 | AC | 834 ms
94,352 KB |
testcase_20 | AC | 556 ms
87,108 KB |
testcase_21 | AC | 560 ms
89,060 KB |
testcase_22 | AC | 439 ms
61,084 KB |
testcase_23 | AC | 874 ms
97,072 KB |
testcase_24 | AC | 409 ms
65,184 KB |
testcase_25 | AC | 1,135 ms
95,140 KB |
testcase_26 | AC | 839 ms
94,560 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