結果

問題 No.1958 Bit Game
ユーザー yakamoto
提出日時 2022-05-27 22:19:23
言語 Kotlin
(2.1.0)
結果
AC  
実行時間 745 ms / 2,000 ms
コード長 4,719 bytes
コンパイル時間 18,063 ms
コンパイル使用メモリ 468,684 KB
実行使用メモリ 88,300 KB
最終ジャッジ日時 2024-09-20 16:04:22
合計ジャッジ時間 36,701 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:177: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:181: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:185: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:189: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:191: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:198: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:205: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:222: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 = 998244353
fun powMat(a: Array<LongArray>, n: Long, mod: Int): Array<LongArray> {
fun I() = run {
Array(a.size){
val res = LongArray(a.size)
res[it] = 1
res
}
}
if (n == 0L) return I()
if (n == 1L) return a
val res = powMat(mulMat(a, a, mod), n / 2, mod)
return if (n % 2 == 1L) mulMat(res, a, mod) else res
}
fun mulMat(a: Array<LongArray>, b: Array<LongArray>, mod: Int): Array<LongArray> {
assert(a[0].size == b.size)
val len = a[0].size
val h = a.size
val w = b[0].size
val res = Array(h){LongArray(w)}
val th = 7e18.toLong()
for (i in 0 until h) {
for (j in 0 until w) {
var v = 0L
for (k in 0 until len) {
v += a[i][k] * b[k][j]
if (v > th) v %= mod
}
res[i][j] = if (v >= mod) v % mod else v
}
}
return res
}
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)
fun solve() {
val N = nl()
val (X, Y) = na(2)
val A = na(X)
val B = na(Y)
var ans = 0L
for (i in 0 until 20) {
var x = 0
var y = 0
for (j in 0 until X) {
if (A[j] shr i and 1 == 1) x++
}
for (j in 0 until Y) {
if (B[j] shr i and 1 == 1) y++
}
val a = (y.toLong() * (X-x)) % MOD
val b = y.toLong() * x % MOD
val mat = arrayOf(
longArrayOf(a, b),
longArrayOf(0, X.toLong()*Y.toLong()%MOD)
)
val f0 = arrayOf(
longArrayOf(0),
longArrayOf(1)
)
val An = powMat(mat, N, MOD)
val vec = mulMat(An, f0, MOD)
val v = vec[0][0]
debug{"i:$i v:$v x:$x y:$y"}
ans = (ans + v * (1L shl i)) % MOD
}
out.println(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()}
private inline fun assert(b: Boolean, f: () -> String) = run{if (!b) throw AssertionError(f())}
companion object {
// TestRunnermain
fun main() {
val out = java.io.PrintWriter(System.out)
Solver(System.`in`, out).solve()
out.flush()
}
}
}
/**
* judge
*/
fun main() = Solver.main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0