結果
問題 |
No.1645 AB's abs
|
ユーザー |
|
提出日時 | 2021-08-13 21:54:03 |
言語 | Kotlin (2.1.0) |
結果 |
AC
|
実行時間 | 496 ms / 2,000 ms |
コード長 | 2,719 bytes |
コンパイル時間 | 15,647 ms |
コンパイル使用メモリ | 460,684 KB |
実行使用メモリ | 90,728 KB |
最終ジャッジ日時 | 2024-10-03 18:37:42 |
合計ジャッジ時間 | 33,292 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
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, ModInt>() map[0] = ModInt(1) for (i in 0 until n) { val map2 = mutableMapOf<Int, ModInt>() for (k in map.keys) { map2[k + a[i]] = (map2[k + a[i]] ?: ModInt(0)) + map[k]!! val v = (k - a[i]).absoluteValue map2[v] = (map2[v] ?: ModInt(0)) + map[k]!! } map = map2 } var ans = ModInt(0) for ((k, v) in map) { ans += k.toModInt() * v } 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