結果

問題 No.1426 Got a Covered OR
ユーザー 箱星箱星
提出日時 2020-12-22 09:20:52
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 971 ms / 2,000 ms
コード長 4,176 bytes
コンパイル時間 16,496 ms
コンパイル使用メモリ 463,488 KB
実行使用メモリ 159,580 KB
最終ジャッジ日時 2024-09-21 13:59:40
合計ジャッジ時間 29,953 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 440 ms
138,396 KB
testcase_01 AC 427 ms
138,500 KB
testcase_02 AC 427 ms
138,488 KB
testcase_03 AC 434 ms
138,400 KB
testcase_04 AC 426 ms
138,532 KB
testcase_05 AC 423 ms
138,436 KB
testcase_06 AC 426 ms
138,408 KB
testcase_07 AC 434 ms
138,264 KB
testcase_08 AC 430 ms
138,552 KB
testcase_09 AC 428 ms
138,336 KB
testcase_10 AC 420 ms
138,236 KB
testcase_11 AC 421 ms
138,404 KB
testcase_12 AC 550 ms
135,824 KB
testcase_13 AC 578 ms
135,248 KB
testcase_14 AC 540 ms
132,712 KB
testcase_15 AC 570 ms
135,988 KB
testcase_16 AC 501 ms
138,116 KB
testcase_17 AC 601 ms
139,460 KB
testcase_18 AC 971 ms
152,100 KB
testcase_19 AC 883 ms
151,904 KB
testcase_20 AC 619 ms
134,704 KB
testcase_21 AC 607 ms
135,196 KB
testcase_22 AC 539 ms
133,252 KB
testcase_23 AC 946 ms
159,580 KB
testcase_24 AC 538 ms
135,960 KB
testcase_25 AC 890 ms
157,072 KB
testcase_26 AC 895 ms
157,032 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)
}

const val fac_size = 600000
var fac_initialized = false
val arr_fac = Array(fac_size) { ModInt(1) }
val arr_invfac = Array(fac_size) { ModInt(1) }

fun facInitialize() {
    for (i in 1 until fac_size) {
        arr_fac[i] = arr_fac[i - 1] * ModInt(i)
    }
    arr_invfac[fac_size - 1] = arr_fac[fac_size - 1].inv()
    for (i in fac_size - 2 downTo 1) {
        arr_invfac[i] = arr_invfac[i + 1] * ModInt(i + 1)
    }
    fac_initialized = true
}

fun fac(n: Int): ModInt {
    if (!fac_initialized) facInitialize()
    return arr_fac[n]
}

fun fac(n: Long): ModInt {
    return fac(n.toInt())
}

fun invfac(n: Int): ModInt {
    if (!fac_initialized) facInitialize()
    return arr_invfac[n]
}

fun invfac(n: Long): ModInt {
    return invfac(n.toInt())
}

fun comb(n: Long, k: Long): ModInt {
    return if (k in 0..n) {
        fac(n) * invfac(k) * invfac(n - k)
    } 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

val pow2 = Array(35) { 1L }

fun PrintWriter.solve() {
    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]
            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(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()
}

// 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
0