結果
| 問題 |
No.990 N×Mマス計算(Kの倍数)
|
| コンテスト | |
| ユーザー |
yakamoto
|
| 提出日時 | 2020-02-14 22:04:21 |
| 言語 | Kotlin (2.1.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 3,942 bytes |
| コンパイル時間 | 18,886 ms |
| コンパイル使用メモリ | 471,044 KB |
| 実行使用メモリ | 183,856 KB |
| 最終ジャッジ日時 | 2024-11-16 00:44:51 |
| 合計ジャッジ時間 | 39,662 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 16 TLE * 3 |
ソースコード
import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min
val MOD = 1_000_000_007
typealias Fac = MutableMap<Int, Int>
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
fun solve() {
val N = ni()
val M = ni()
val K = ni()
val op = next()
val B = na(M)
val A = na(N)
B.sort()
if (op == "+") {
val C = mutableMapOf<Int, Int>()
for (i in 0 until M) {
val m = B[i] % K
C.merge(m, 1, Int::plus)
}
var ans = 0L
for (i in 0 until N) {
val mm = A[i] % K
val m = (K - mm) % K
ans += C.getOrDefault(m, 0)
}
out.println(ans)
} else {
val fk = factorzie(K)
val C = mutableMapOf<Fac, Int>()
for (i in 0 until M) {
val fb = factorzie(B[i])
C.merge(filter(fb, fk), 1, Int::plus)
}
var ans = 0L
for (i in 0 until N) {
val fa = factorzie(A[i])
val needed = needs(fa, fk)
C.forEach {
if (isSatisfy(it.key, needed)) {
ans += it.value
}
}
}
out.println(ans)
}
}
fun factorzie(a: Int): Fac {
val res = mutableMapOf<Int, Int>()
var x = a
loop@while(x > 1) {
var i = 2
while(i * i <= x) {
if (x % i == 0) {
res.merge(i, 1, Int::plus)
x /= i
continue@loop
}
i++
}
res.merge(x, 1, Int::plus)
x = 0
}
return res
}
fun filter(x: Fac, filter: Fac): Fac {
val res: Fac = mutableMapOf()
x.forEach {
if (filter.containsKey(it.key)) {
res[it.key] = min(filter[it.key]!!, it.value)
}
}
return res
}
fun needs(x: Fac, target: Fac): Fac {
val res: Fac = mutableMapOf()
target.forEach {
if (!x.containsKey(it.key)) {
res[it.key] = it.value
} else {
res[it.key] = max(0, it.value - x[it.key]!!)
}
}
return res
}
fun isSatisfy(a: Fac, needed: Fac): Boolean {
var ok = true
needed.forEach {
ok = ok and (it.value <= a.getOrDefault(it.key, 0))
}
return ok
}
private val isDebug = try {
// なんか本番でエラーでる
System.getenv("MY_DEBUG") != null
} catch (t: Throwable) {
false
}
private var tokenizer: StringTokenizer? = null
private val reader = BufferedReader(InputStreamReader(stream), 32768)
private fun next(): String {
while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
tokenizer = StringTokenizer(reader.readLine())
}
return tokenizer!!.nextToken()
}
private fun ni() = next().toInt()
private fun nl() = next().toLong()
private fun ns() = next()
private fun na(n: Int, offset: Int = 0): IntArray {
return map(n, offset) { ni() }
}
private inline fun map(n: Int, offset: Int = 0, f: (Int) -> Int): IntArray {
val res = IntArray(n)
for (i in 0 until n) {
res[i] = f(i + offset)
}
return res
}
private inline fun debug(msg: () -> String) {
if (isDebug) System.err.println(msg())
}
private fun debug(a: LongArray) {
debug { a.joinToString(" ") }
}
private fun debug(a: IntArray) {
debug { a.joinToString(" ") }
}
private fun debug(a: BooleanArray) {
debug { a.map { if (it) 1 else 0 }.joinToString("") }
}
private fun debugDim(A: Array<IntArray>) {
if (isDebug) {
for (a in A) {
debug(a)
}
}
}
/**
* 勝手にimport消されるのを防ぎたい
*/
private fun hoge() {
min(1, 2)
max(1, 2)
abs(-10)
}
}
fun <A, B> pair(a: A, b: B) = RPair(a, b)
data class RPair<A, B>(val _1: A, val _2: B)
fun main() {
val out = java.io.PrintWriter(System.out)
Solver(System.`in`, out).solve()
out.flush()
}
yakamoto