結果

問題 No.1645 AB's abs
ユーザー 箱星箱星
提出日時 2021-08-13 21:49:22
言語 Kotlin
(1.9.23)
結果
WA  
実行時間 -
コード長 2,683 bytes
コンパイル時間 15,162 ms
コンパイル使用メモリ 452,320 KB
実行使用メモリ 93,804 KB
最終ジャッジ日時 2024-10-03 18:26:13
合計ジャッジ時間 32,885 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 292 ms
58,436 KB
testcase_01 AC 291 ms
58,472 KB
testcase_02 AC 354 ms
61,072 KB
testcase_03 AC 291 ms
58,332 KB
testcase_04 AC 293 ms
58,348 KB
testcase_05 AC 293 ms
58,408 KB
testcase_06 AC 298 ms
58,356 KB
testcase_07 AC 295 ms
58,384 KB
testcase_08 AC 361 ms
62,920 KB
testcase_09 AC 364 ms
65,188 KB
testcase_10 AC 365 ms
63,144 KB
testcase_11 AC 362 ms
62,952 KB
testcase_12 AC 359 ms
63,180 KB
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 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextInt()
    val a = Array(n) { nextInt() }
    var map = mutableMapOf<Int, Int>()
    map[0] = 1
    for (i in 0 until n) {
        val map2 = mutableMapOf<Int, Int>()
        for (k in map.keys) {
            map2[k + a[i]] = (map2[k + a[i]] ?: 0) + map[k]!!
            map2[k - a[i]] = (map2[k - a[i]] ?: 0) + map[k]!!
        }
        map = map2
    }
    var ans = ModInt(0)
    for ((k, v) in map) {
        ans += (k * v.toLong()).absoluteValue.toModInt()
    }
    println(ans)
}

// 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 main() {
    Thread(null, {
        val writer = PrintWriter(System.out, false)
        writer.solve()
        writer.flush()
    }, "solve", 1.shl(26)).start()
}

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