結果
問題 | No.1201 お菓子配り-4 |
ユーザー | 👑 箱星 |
提出日時 | 2020-11-29 01:04:38 |
言語 | Kotlin (1.9.23) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,287 bytes |
コンパイル時間 | 19,064 ms |
コンパイル使用メモリ | 427,852 KB |
実行使用メモリ | 57,472 KB |
最終ジャッジ日時 | 2023-10-11 02:07:57 |
合計ジャッジ時間 | 73,738 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 442 ms
55,400 KB |
testcase_01 | AC | 2,174 ms
55,460 KB |
testcase_02 | AC | 2,956 ms
55,676 KB |
testcase_03 | AC | 1,609 ms
55,496 KB |
testcase_04 | AC | 931 ms
55,180 KB |
testcase_05 | AC | 1,890 ms
55,484 KB |
testcase_06 | AC | 543 ms
55,404 KB |
testcase_07 | AC | 1,012 ms
55,180 KB |
testcase_08 | AC | 2,295 ms
55,424 KB |
testcase_09 | AC | 1,777 ms
55,192 KB |
testcase_10 | AC | 301 ms
52,856 KB |
testcase_11 | AC | 696 ms
55,336 KB |
testcase_12 | AC | 3,364 ms
55,380 KB |
testcase_13 | AC | 386 ms
55,044 KB |
testcase_14 | AC | 338 ms
55,120 KB |
testcase_15 | AC | 2,711 ms
55,308 KB |
testcase_16 | AC | 1,029 ms
55,084 KB |
testcase_17 | AC | 1,234 ms
55,228 KB |
testcase_18 | AC | 459 ms
55,148 KB |
testcase_19 | AC | 447 ms
55,168 KB |
testcase_20 | AC | 269 ms
50,500 KB |
testcase_21 | AC | 268 ms
50,412 KB |
testcase_22 | AC | 268 ms
50,332 KB |
testcase_23 | AC | 261 ms
50,440 KB |
testcase_24 | AC | 264 ms
50,536 KB |
testcase_25 | AC | 266 ms
50,540 KB |
testcase_26 | AC | 264 ms
50,560 KB |
testcase_27 | AC | 267 ms
50,648 KB |
testcase_28 | AC | 266 ms
50,292 KB |
testcase_29 | AC | 265 ms
50,368 KB |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | TLE | - |
testcase_35 | TLE | - |
ソースコード
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() }