結果

問題 No.2197 Same Dish
コンテスト
ユーザー 箱星
提出日時 2021-07-16 05:34:05
言語 Kotlin
(2.1.0)
結果
WA  
実行時間 -
コード長 3,437 bytes
コンパイル時間 16,718 ms
コンパイル使用メモリ 463,424 KB
実行使用メモリ 309,556 KB
最終ジャッジ日時 2024-06-23 08:45:17
合計ジャッジ時間 20,721 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 3 WA * 7 TLE * 1 -- * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val n = nextInt()
    val k = nextLong()
    val customers = mutableListOf<Pair<Int, Int>>()
    for (i in 0 until n) {
        val l = nextInt()
        val r = nextInt()
        customers.add(l to r)
    }
    val adj = Array(n) { mutableListOf<Int>() }
    fun intersect(l1: Int, r1: Int, l2: Int, r2: Int): Boolean {
        if (l1 > l2) return intersect(l2, r2, l1, r1)
        return l2 < r1
    }
    for (i in 0 until n) {
        for (j in 0 until i) {
            if (intersect(customers[i].first, customers[i].second, customers[j].first, customers[j].second)) {
                adj[i].add(j)
                adj[j].add(i)
            }
        }
    }
    val visited = BooleanArray(n) { false }
    var compl = ModInt(1)
    for (i in 0 until n) {
        if (visited[i]) continue
        val stack = Stack<Int>()
        stack.push(i)
        while (stack.isNotEmpty()) {
            val v = stack.pop()
            if (visited[v]) continue
            var choice = k
            for (w in adj[v]) {
                if (visited[w]) {
                    choice--
                } else {
                    stack.push(w)
                }
            }
            compl *= choice.toModInt()
            visited[v] = true
        }
    }
    val ans = ModInt(k).pow(n.toLong()) - compl
    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() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

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