結果
問題 | No.2060 AND Sequence |
ユーザー | 箱星 |
提出日時 | 2022-09-09 08:54:50 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 316 ms / 2,000 ms |
コード長 | 3,328 bytes |
コンパイル時間 | 15,508 ms |
コンパイル使用メモリ | 456,376 KB |
実行使用メモリ | 59,204 KB |
最終ジャッジ日時 | 2024-11-25 06:19:18 |
合計ジャッジ時間 | 28,694 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 316 ms
58,944 KB |
testcase_01 | AC | 277 ms
58,920 KB |
testcase_02 | AC | 274 ms
59,076 KB |
testcase_03 | AC | 282 ms
58,928 KB |
testcase_04 | AC | 271 ms
58,812 KB |
testcase_05 | AC | 276 ms
58,832 KB |
testcase_06 | AC | 275 ms
58,908 KB |
testcase_07 | AC | 274 ms
58,944 KB |
testcase_08 | AC | 279 ms
58,800 KB |
testcase_09 | AC | 280 ms
58,848 KB |
testcase_10 | AC | 276 ms
58,816 KB |
testcase_11 | AC | 282 ms
59,076 KB |
testcase_12 | AC | 274 ms
58,828 KB |
testcase_13 | AC | 273 ms
59,008 KB |
testcase_14 | AC | 276 ms
58,880 KB |
testcase_15 | AC | 277 ms
59,056 KB |
testcase_16 | AC | 278 ms
58,916 KB |
testcase_17 | AC | 276 ms
58,836 KB |
testcase_18 | AC | 278 ms
58,944 KB |
testcase_19 | AC | 279 ms
58,712 KB |
testcase_20 | AC | 280 ms
58,952 KB |
testcase_21 | AC | 276 ms
58,916 KB |
testcase_22 | AC | 275 ms
58,972 KB |
testcase_23 | AC | 279 ms
58,916 KB |
testcase_24 | AC | 275 ms
58,908 KB |
testcase_25 | AC | 280 ms
58,916 KB |
testcase_26 | AC | 276 ms
58,912 KB |
testcase_27 | AC | 274 ms
59,016 KB |
testcase_28 | AC | 272 ms
59,068 KB |
testcase_29 | AC | 278 ms
58,980 KB |
testcase_30 | AC | 272 ms
58,884 KB |
testcase_31 | AC | 277 ms
58,844 KB |
testcase_32 | AC | 282 ms
58,916 KB |
testcase_33 | AC | 281 ms
58,916 KB |
testcase_34 | AC | 283 ms
58,824 KB |
testcase_35 | AC | 277 ms
59,040 KB |
testcase_36 | AC | 276 ms
58,932 KB |
testcase_37 | AC | 285 ms
58,948 KB |
testcase_38 | AC | 280 ms
58,896 KB |
testcase_39 | AC | 278 ms
58,944 KB |
testcase_40 | AC | 274 ms
58,836 KB |
testcase_41 | AC | 276 ms
58,948 KB |
testcase_42 | AC | 281 ms
58,904 KB |
testcase_43 | AC | 279 ms
58,816 KB |
testcase_44 | AC | 274 ms
58,836 KB |
testcase_45 | AC | 274 ms
59,204 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val m = nextInt() val s = m.toString(2).padStart(30, '0') val dp = Array(31) { Array(2) { ModInt(0) } } // dp[i][j] : i桁目まで見る。j=0: mより小さいことが未確定。 dp[0][0] = ModInt(1) for (i in 0 until 30) { if (s[i] == '0') { dp[i + 1][0] = dp[i][0] dp[i + 1][1] = dp[i][1] * ModInt(n + 1) } else { dp[i + 1][0] = dp[i][0] * ModInt(n) dp[i + 1][1] = dp[i][0] + dp[i][1] * ModInt(n + 1) } } println(dp[30][0] + dp[30][1]) } // region ModInt class ModInt(x: Long) { companion object { const val MOD = 998244353L //const val MOD = 1000000007L } 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" } } class ModIntArray(n: Int) { private val a = LongArray(n) { 0L } constructor(n: Int, init: (Int) -> ModInt) : this(n) { for (i in 0 until n) { a[i] = init(i).x } } operator fun set(i: Int, x: ModInt) { a[i] = x.x } operator fun get(i: Int): ModInt { return ModInt(a[i]) } fun joinToString(s: String = ", "): String { return a.joinToString(s) } } 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", abs(1L.shl(26))) .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } } .apply { start() }.join() } // 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