結果
問題 | No.1426 Got a Covered OR |
ユーザー | 箱星 |
提出日時 | 2020-11-29 04:48:37 |
言語 | Kotlin (1.9.23) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,639 bytes |
コンパイル時間 | 14,555 ms |
コンパイル使用メモリ | 457,984 KB |
実行使用メモリ | 98,360 KB |
最終ジャッジ日時 | 2024-09-19 21:10:10 |
合計ジャッジ時間 | 28,732 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 272 ms
56,852 KB |
testcase_01 | AC | 274 ms
56,876 KB |
testcase_02 | AC | 276 ms
56,724 KB |
testcase_03 | AC | 277 ms
56,788 KB |
testcase_04 | AC | 283 ms
56,768 KB |
testcase_05 | AC | 277 ms
56,776 KB |
testcase_06 | AC | 293 ms
56,832 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 279 ms
56,860 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 421 ms
63,816 KB |
testcase_23 | AC | 770 ms
98,192 KB |
testcase_24 | AC | 430 ms
65,888 KB |
testcase_25 | WA | - |
testcase_26 | AC | 883 ms
96,684 KB |
ソースコード
import java.io.InputStream import java.io.PrintWriter import java.util.* // ModInt // region class ModInt(x: Long) { companion object { const val MOD = 1000000007L //const val MOD = 998244353L } 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" } } val fac = mutableListOf<ModInt>() val invfac = mutableListOf<ModInt>() fun fact(n: Long, b: Boolean): ModInt { if (fac.count() == 0) { fac.add(ModInt(1)) invfac.add(ModInt(1)) } while (fac.count() <= n) { fac.add(fac.last() * ModInt(fac.count().toLong())) invfac.add(fac.last().inv()) } return if (b) { fac[n.toInt()] } else { invfac[n.toInt()] } } fun comb(n: Long, k: Long): ModInt { return fact(n, true) * fact(k, false) * fact(n - k, false) } fun comb2(n: Long, k: Long): ModInt { var ans = ModInt(1) for (i in 0 until k) { ans = ans * ModInt(n - i) / ModInt(k - i) } return ans } // endregion val pow2 = Array(35) { 1L } fun PrintWriter.solve() = with(FastScanner(System.`in`)) { for (i in 0 until pow2.count() - 1) { pow2[i + 1] = pow2[i] * 2 } 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] } } 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(pow2[(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() } class FastScanner(s: InputStream) { private var st = StringTokenizer("") private val br = s.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() }