結果

問題 No.1426 Got a Covered OR
ユーザー yakamotoyakamoto
提出日時 2021-03-13 00:00:48
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 547 ms / 2,000 ms
コード長 5,178 bytes
コンパイル時間 18,620 ms
コンパイル使用メモリ 455,500 KB
実行使用メモリ 69,976 KB
最終ジャッジ日時 2024-10-14 14:22:24
合計ジャッジ時間 30,621 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 298 ms
54,444 KB
testcase_01 AC 299 ms
54,396 KB
testcase_02 AC 298 ms
54,280 KB
testcase_03 AC 297 ms
54,156 KB
testcase_04 AC 300 ms
54,292 KB
testcase_05 AC 302 ms
54,288 KB
testcase_06 AC 296 ms
54,380 KB
testcase_07 AC 297 ms
54,328 KB
testcase_08 AC 294 ms
54,384 KB
testcase_09 AC 295 ms
54,356 KB
testcase_10 AC 295 ms
54,300 KB
testcase_11 AC 294 ms
54,464 KB
testcase_12 AC 419 ms
59,064 KB
testcase_13 AC 436 ms
59,712 KB
testcase_14 AC 429 ms
59,148 KB
testcase_15 AC 428 ms
59,252 KB
testcase_16 AC 363 ms
54,868 KB
testcase_17 AC 407 ms
57,076 KB
testcase_18 AC 514 ms
63,872 KB
testcase_19 AC 506 ms
63,420 KB
testcase_20 AC 459 ms
59,308 KB
testcase_21 AC 480 ms
61,340 KB
testcase_22 AC 433 ms
61,376 KB
testcase_23 AC 545 ms
69,976 KB
testcase_24 AC 435 ms
63,388 KB
testcase_25 AC 547 ms
68,116 KB
testcase_26 AC 546 ms
68,260 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:212:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: LongArray) {
          ^
Main.kt:216:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: IntArray) {
          ^
Main.kt:220:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: BooleanArray) {
          ^
Main.kt:224:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")}
          ^
Main.kt:226:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<LongArray>) {
          ^
Main.kt:233:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<IntArray>) {
          ^
Main.kt:240:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<BooleanArray>) {
          ^
Main.kt:257:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()}
          ^

ソースコード

diff # 

import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.lang.AssertionError
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007

class Comb(n: Int, val mod: Int) {

  val F = LongArray(n + 1)
  val I = LongArray(n + 1)
  init {
    F[0] = 1
    for (i in 1..n) {
      F[i] = F[i - 1] * i % mod
    }
    I[n] = powMod(F[n], (mod - 2).toLong(), mod)
    for (i in n - 1 downTo 0) {
      I[i] = I[i + 1] * (i + 1) % mod
    }
  }

  private fun powMod(a: Long, n: Long, mod: Int): Long {
    if (n == 0L) return 1
    val res = powMod(a * a % mod, n / 2, mod)
    return if (n % 2 == 1L) res * a % mod else res
  }

  fun comb(n: Int, k: Int): Long {
    if (n < k) return 0L
    return F[n] * I[k] % mod * I[n - k] % mod
  }

  fun perm(n: Int, k: Int): Long {
    return F[n] * I[n - k] % mod
  }

  fun inv(x: Int): Long {
    return I[x] * F[x - 1] % mod
  }

  /**
   * nのグループからk回重複ありで選ぶ組み合わせ数
   * n - 1のしきりとkの○で考える
   */
  fun H(n: Int, k: Int) = comb(n + k - 1, k)
}
fun powMod(a: Long, n: Long, mod: Int): Long {
  if (n == 0L) return 1
  val res = powMod(a * a % mod, n / 2, mod)
  return if (n % 2 == 1L) res * a % mod else res
}
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  private val reader = BufferedReader(InputStreamReader(stream), 32768)

  private val N = ni()
  private val A = na(N)
  fun solve() {
    out.println(solve2())
  }

  fun solve2(): Long {
    var bit = 0
    var ans = 1L
    var n = 0L

    val comb = Comb(100, MOD)
    val sub1 = MOD - 1

    for (i in 0 until N) {
      n++
      if (A[i] == -1) continue

      val prev = bit
      bit = A[i]
      val C = IntArray(3)
      for (j in 0 until 30) {
        val px = prev shr j and 1
        val x = bit shr j and 1
        if (px == 0 && x == 0) {
          C[0]++ // 全部0
        }
        else if (px == 0 && x == 1) {
          C[1]++ // 1を含む
        }
        else if (px == 1 && x == 1) {
          C[2]++ // 何でもあり
        }
        else {
          return 0
        }
      }

      debug(C)

      val K1 = C[1]
      val K = C[1] + C[2]
      var sign = 1
      var v = 0L
      for (k in 0 .. K1) { // 和集合を除いたものがほしいので、開始は k=0, sign=1
        if (k == K) continue // 全部0の場合はcolの条件を満たさないので、元の集合に含まれていない
        val col = (powMod(2, (K - k).toLong(), MOD) + sub1) % MOD
        val diff = comb.comb(K1, k) * powMod(col, n, MOD) % MOD
        debug{"k:$k col:$col diff:$diff"}
        val d = (MOD + diff*sign) % MOD
        v = (v + d) % MOD
        sign *= -1
      }
      debug{"i:$i v:$v"}
      ans = ans * v % MOD

      n = 0
    }

    return ans
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return IntArray(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }

  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  /**
   * コーナーケースでエラー出たりするので、debug(dp[1])のように添え字付きの場合はdebug{}をつかうこと
   */
  private inline fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private inline fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private inline fun debug(a: BooleanArray) {
    debug { toString(a) }
  }

  private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")}

  private inline fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private inline fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private inline fun debugDim(A: Array<BooleanArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }

  private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()}
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}
0