結果

問題 No.1885 Flat Permutation
ユーザー 箱星箱星
提出日時 2022-09-11 19:16:41
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,331 ms / 2,000 ms
コード長 3,299 bytes
コンパイル時間 17,806 ms
コンパイル使用メモリ 446,312 KB
実行使用メモリ 107,572 KB
最終ジャッジ日時 2024-11-28 09:24:10
合計ジャッジ時間 49,825 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 310 ms
50,024 KB
testcase_01 AC 306 ms
50,168 KB
testcase_02 AC 306 ms
50,288 KB
testcase_03 AC 384 ms
54,736 KB
testcase_04 AC 304 ms
50,228 KB
testcase_05 AC 304 ms
49,912 KB
testcase_06 AC 302 ms
50,068 KB
testcase_07 AC 309 ms
49,808 KB
testcase_08 AC 310 ms
49,968 KB
testcase_09 AC 308 ms
50,124 KB
testcase_10 AC 308 ms
49,936 KB
testcase_11 AC 307 ms
49,932 KB
testcase_12 AC 307 ms
49,860 KB
testcase_13 AC 308 ms
49,936 KB
testcase_14 AC 309 ms
50,028 KB
testcase_15 AC 309 ms
49,992 KB
testcase_16 AC 307 ms
50,232 KB
testcase_17 AC 306 ms
49,856 KB
testcase_18 AC 304 ms
49,992 KB
testcase_19 AC 1,286 ms
107,316 KB
testcase_20 AC 1,276 ms
107,456 KB
testcase_21 AC 1,275 ms
107,300 KB
testcase_22 AC 1,171 ms
85,160 KB
testcase_23 AC 303 ms
50,148 KB
testcase_24 AC 302 ms
50,192 KB
testcase_25 AC 305 ms
50,280 KB
testcase_26 AC 309 ms
49,916 KB
testcase_27 AC 1,309 ms
107,336 KB
testcase_28 AC 1,292 ms
107,272 KB
testcase_29 AC 1,284 ms
107,436 KB
testcase_30 AC 1,306 ms
107,256 KB
testcase_31 AC 1,281 ms
107,184 KB
testcase_32 AC 308 ms
50,072 KB
testcase_33 AC 307 ms
50,272 KB
testcase_34 AC 310 ms
49,896 KB
testcase_35 AC 1,314 ms
107,212 KB
testcase_36 AC 1,331 ms
107,304 KB
testcase_37 AC 308 ms
49,968 KB
testcase_38 AC 310 ms
49,932 KB
testcase_39 AC 307 ms
50,260 KB
testcase_40 AC 525 ms
59,560 KB
testcase_41 AC 750 ms
68,380 KB
testcase_42 AC 431 ms
56,288 KB
testcase_43 AC 1,280 ms
107,288 KB
testcase_44 AC 1,276 ms
107,572 KB
testcase_45 AC 1,303 ms
107,400 KB
testcase_46 AC 1,281 ms
107,296 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val n = nextInt()
    val _x = nextInt()
    val _y = nextInt()
    val x = minOf(_x, _y)
    val y = maxOf(_x, _y)
    val a = if (x == 1) 1 else x + 1
    val b = if (y == n) n else y - 1
    val l = b - a
    val memo = mutableMapOf<Int, ModInt>()
    fun f(l: Int): ModInt {
        if (l < 0) {
            return ModInt(0)
        }
        if (l <= 2) {
            return ModInt(1)
        }
        if (memo.containsKey(l)) {
            return memo[l]!!
        }
        val ret = f(l - 1) + f(l - 3)
        memo[l] = ret
        return ret
    }
    println(f(l))
}

// 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(this)

fun Int.toModInt() = 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
0