結果
問題 | No.1060 素敵な宝箱 |
ユーザー | yakamoto |
提出日時 | 2020-05-22 22:20:37 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 479 ms / 2,000 ms |
コード長 | 2,933 bytes |
コンパイル時間 | 17,770 ms |
コンパイル使用メモリ | 454,988 KB |
実行使用メモリ | 65,428 KB |
最終ジャッジ日時 | 2024-04-15 17:17:58 |
合計ジャッジ時間 | 28,941 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 310 ms
57,668 KB |
testcase_01 | AC | 315 ms
57,776 KB |
testcase_02 | AC | 309 ms
57,892 KB |
testcase_03 | AC | 313 ms
57,808 KB |
testcase_04 | AC | 310 ms
57,980 KB |
testcase_05 | AC | 312 ms
57,664 KB |
testcase_06 | AC | 313 ms
57,884 KB |
testcase_07 | AC | 311 ms
57,960 KB |
testcase_08 | AC | 333 ms
60,032 KB |
testcase_09 | AC | 325 ms
59,904 KB |
testcase_10 | AC | 325 ms
57,736 KB |
testcase_11 | AC | 325 ms
59,928 KB |
testcase_12 | AC | 414 ms
60,792 KB |
testcase_13 | AC | 456 ms
63,400 KB |
testcase_14 | AC | 459 ms
63,356 KB |
testcase_15 | AC | 477 ms
65,352 KB |
testcase_16 | AC | 453 ms
63,008 KB |
testcase_17 | AC | 429 ms
61,188 KB |
testcase_18 | AC | 436 ms
61,248 KB |
testcase_19 | AC | 422 ms
60,976 KB |
testcase_20 | AC | 466 ms
63,224 KB |
testcase_21 | AC | 465 ms
63,180 KB |
testcase_22 | AC | 465 ms
63,288 KB |
testcase_23 | AC | 452 ms
60,880 KB |
testcase_24 | AC | 478 ms
65,224 KB |
testcase_25 | AC | 476 ms
65,356 KB |
testcase_26 | AC | 479 ms
65,428 KB |
ソースコード
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_007L class Solver(stream: InputStream, private val out: java.io.PrintWriter) { fun solve() { val N = ni() val M = ni() val A = Array(N){nal(M)} val coef = LongArray(M) for (i in 0 until N) { for (j in 0 until M) { coef[j] += A[i][j] } } A.sortBy { var sum = 0L for (j in 0 until M) { sum += coef[j] * it[j] } -sum } val C = Array(2){LongArray(M)} for (i in 0 until N) { for (j in 0 until M) { C[i % 2][j] += A[i][j] } } var ans = 0L for (j in 0 until M) { ans += C[0][j] * C[0][j] - C[1][j] * C[1][j] } out.println(ans) } 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) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array<IntArray> { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun map(n: Int, f: (Int) -> Int): IntArray { val res = IntArray(n) for (i in 0 until n) { res[i] = f(i) } 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<LongArray>) { if (isDebug) { for (a in A) { debug(a) } } } 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 main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }