結果

問題 No.1300 Sum of Inversions
ユーザー 箱星箱星
提出日時 2020-11-27 22:20:09
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,447 ms / 2,000 ms
コード長 4,202 bytes
コンパイル時間 19,343 ms
コンパイル使用メモリ 467,524 KB
実行使用メモリ 106,860 KB
最終ジャッジ日時 2024-07-26 13:21:57
合計ジャッジ時間 60,260 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 322 ms
58,136 KB
testcase_01 AC 323 ms
58,056 KB
testcase_02 AC 318 ms
58,032 KB
testcase_03 AC 1,219 ms
98,468 KB
testcase_04 AC 1,203 ms
96,656 KB
testcase_05 AC 1,090 ms
90,172 KB
testcase_06 AC 1,385 ms
105,916 KB
testcase_07 AC 1,229 ms
105,948 KB
testcase_08 AC 1,350 ms
106,860 KB
testcase_09 AC 1,383 ms
106,564 KB
testcase_10 AC 1,061 ms
91,628 KB
testcase_11 AC 1,018 ms
93,772 KB
testcase_12 AC 1,140 ms
96,380 KB
testcase_13 AC 1,172 ms
97,220 KB
testcase_14 AC 1,447 ms
102,168 KB
testcase_15 AC 1,349 ms
106,412 KB
testcase_16 AC 1,227 ms
96,212 KB
testcase_17 AC 985 ms
91,692 KB
testcase_18 AC 1,079 ms
94,180 KB
testcase_19 AC 1,184 ms
94,444 KB
testcase_20 AC 1,139 ms
95,068 KB
testcase_21 AC 1,156 ms
94,872 KB
testcase_22 AC 1,105 ms
91,840 KB
testcase_23 AC 1,301 ms
105,852 KB
testcase_24 AC 1,108 ms
88,016 KB
testcase_25 AC 1,023 ms
89,456 KB
testcase_26 AC 1,058 ms
89,828 KB
testcase_27 AC 1,076 ms
91,968 KB
testcase_28 AC 1,314 ms
101,176 KB
testcase_29 AC 1,172 ms
97,408 KB
testcase_30 AC 1,354 ms
106,536 KB
testcase_31 AC 1,114 ms
97,180 KB
testcase_32 AC 1,132 ms
96,104 KB
testcase_33 AC 728 ms
90,224 KB
testcase_34 AC 778 ms
93,348 KB
testcase_35 AC 824 ms
100,828 KB
testcase_36 AC 838 ms
100,996 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.InputStream
import java.io.PrintWriter
import java.util.*

// ModInt
// region
class ModInt(x: Long) {

    companion object {
        //const val MOD = 1000000007L
        const val MOD = 998244353L
    }

    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"
    }

}

val fac = mutableListOf<ModInt>()
val invfac = mutableListOf<ModInt>()

fun fact(n: Long, b: Boolean): ModInt {
    if (fac.count() == 0) {
        fac.add(ModInt(1))
        invfac.add(ModInt(1))
    }
    while (fac.count() <= n) {
        fac.add(fac.last() * ModInt(fac.count().toLong()))
        invfac.add(fac.last().inv())
    }
    return if (b) {
        fac[n.toInt()]
    } else {
        invfac[n.toInt()]
    }
}

fun comb(n: Long, k: Long): ModInt {
    return fact(n, true) * fact(k, false) * fact(n - k, false)
}

fun comb2(n: Long, k: Long): ModInt {
    var ans = ModInt(1)
    for (i in 0 until k) {
        ans = ans * ModInt(n - i) / ModInt(k - i)
    }
    return ans
}
// endregion

fun compress(a: Array<Long>): Array<Int> {
    val n = a.count()
    val b = a.sorted().distinct().toTypedArray()
    val c = Array(n) { 0 }
    for (i in 0 until n) {
        c[i] = Arrays.binarySearch(b, a[i])
    }
    return c
}

class BIT(private val n: Int) {
    private val data = LongArray(n) { 0 }

    fun add(i: Int, x: Long) {
        var p = i + 1
        while (p <= n) {
            data[p - 1] += x
            p += p and -p
        }
    }

    fun sum(l: Int, r: Int): Long {
        return sum(r) - sum(l)
    }

    private fun sum(i: Int): Long {
        var r = i
        var s = 0L
        while(r > 0) {
            s += data[r - 1]
            r -= r and -r
        }
        return s
    }
}

fun PrintWriter.solve() = with(FastScanner(System.`in`)) {
    val n = nextInt()
    val a = Array(n) { nextLong() }
    val b = compress(a)
    val bit1 = BIT(n)
    val bit2 = BIT(n)
    val cnt_l = LongArray(n) { 0L }
    val sum_l = LongArray(n) { 0L }
    var sum = 0L
    for (i in 0 until n) {
        cnt_l[i] = i - bit1.sum(0, b[i] + 1)
        bit1.add(b[i], 1)
        sum_l[i] = sum - bit2.sum(0, b[i] + 1)
        bit2.add(b[i], a[i])
        sum += a[i]
    }
    val bit3 = BIT(n)
    val bit4 = BIT(n)
    val cnt_r = LongArray(n) { 0L }
    val sum_r = LongArray(n) { 0L }
    sum = 0L
    for (i in n - 1 downTo 0) {
        cnt_r[i] = bit3.sum(0, b[i])
        bit3.add(b[i], 1)
        sum_r[i] = bit4.sum(0, b[i])
        bit4.add(b[i], a[i])
        sum += a[i]
    }
    var ans = ModInt(0)
    for (j in 1 until n - 1) {
        ans += ModInt(a[j]) * ModInt(cnt_l[j] * cnt_r[j])
        ans += ModInt(sum_l[j]) * ModInt(cnt_r[j])
        ans += ModInt(sum_r[j]) * ModInt(cnt_l[j])
    }
    println(ans)
}

fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

class FastScanner(s: InputStream) {
    private var st = StringTokenizer("")
    private val br = s.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()
}
0