結果

問題 No.1201 お菓子配り-4
ユーザー 箱星箱星
提出日時 2020-11-29 01:04:38
言語 Kotlin
(1.9.23)
結果
TLE  
実行時間 -
コード長 3,287 bytes
コンパイル時間 17,073 ms
コンパイル使用メモリ 464,620 KB
実行使用メモリ 92,984 KB
最終ジャッジ日時 2024-09-13 01:44:39
合計ジャッジ時間 75,185 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 456 ms
70,556 KB
testcase_01 AC 2,198 ms
85,720 KB
testcase_02 AC 2,993 ms
85,684 KB
testcase_03 AC 1,629 ms
85,508 KB
testcase_04 AC 953 ms
77,140 KB
testcase_05 AC 1,917 ms
85,720 KB
testcase_06 AC 567 ms
69,064 KB
testcase_07 AC 1,041 ms
79,272 KB
testcase_08 AC 2,329 ms
85,684 KB
testcase_09 AC 1,808 ms
85,640 KB
testcase_10 AC 313 ms
56,600 KB
testcase_11 AC 700 ms
70,992 KB
testcase_12 AC 3,362 ms
85,436 KB
testcase_13 AC 395 ms
62,756 KB
testcase_14 AC 345 ms
58,616 KB
testcase_15 AC 2,733 ms
85,476 KB
testcase_16 AC 1,044 ms
81,320 KB
testcase_17 AC 1,257 ms
85,616 KB
testcase_18 AC 472 ms
66,972 KB
testcase_19 AC 466 ms
66,932 KB
testcase_20 AC 285 ms
54,296 KB
testcase_21 AC 284 ms
54,232 KB
testcase_22 AC 285 ms
54,332 KB
testcase_23 AC 280 ms
54,280 KB
testcase_24 AC 281 ms
54,388 KB
testcase_25 AC 278 ms
54,392 KB
testcase_26 AC 286 ms
54,536 KB
testcase_27 AC 296 ms
54,288 KB
testcase_28 AC 280 ms
54,220 KB
testcase_29 AC 287 ms
54,336 KB
testcase_30 TLE -
testcase_31 TLE -
testcase_32 TLE -
testcase_33 TLE -
testcase_34 TLE -
testcase_35 TLE -
権限があれば一括ダウンロードができます

ソースコード

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 floorSum(n: Long, m: Long, a: Long, b: Long): Long {
    var ans = 0L
    var a1 = a
    var b1 = b
    if (a1 >= m) {
        ans += (n - 1) * n * (a1 / m) / 2
        a1 %= m
    }
    if (b1 >= m) {
        ans += n * (b1 / m)
        b1 %= m
    }
    val yMax = (a1 * n + b1) / m
    val xMax = (yMax * m - b1)
    if (yMax == 0L) return ans
    ans += (n - (xMax + a1 - 1) / a1) * yMax
    ans += floorSum(yMax, a1, m, (a1 - xMax % a1) % a1)
    return ans
}

fun PrintWriter.solve() = with(FastScanner(System.`in`)) {
    val n = nextInt()
    val m = nextInt()
    val a = Array(n) { nextLong() }
    val b = Array(m) { nextLong() }
    var ans = ModInt(0)
    for (i in 0 until n) {
        for (j in 0 until m) {
            ans += ModInt(2) * ModInt(floorSum(b[j] + 1, b[j], a[i], 0))
        }
    }
    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