結果

問題 No.988 N×Mマス計算（総和）
ユーザー mikhailmikhail
提出日時 2020-03-22 20:32:14
言語 Kotlin
(1.9.23)
結果
WA  
実行時間 -
コード長 2,671 bytes
コンパイル時間 16,078 ms
コンパイル使用メモリ 456,528 KB
実行使用メモリ 79,692 KB
最終ジャッジ日時 2024-07-06 07:38:49
合計ジャッジ時間 26,461 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 332 ms
56,992 KB
testcase_01 AC 319 ms
57,104 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 307 ms
56,788 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 306 ms
56,800 KB
testcase_08 AC 312 ms
56,876 KB
testcase_09 AC 311 ms
57,024 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 533 ms
68,844 KB
testcase_14 WA -
testcase_15 AC 421 ms
63,344 KB
testcase_16 AC 597 ms
73,396 KB
testcase_17 AC 628 ms
77,688 KB
testcase_18 AC 553 ms
72,732 KB
testcase_19 AC 621 ms
77,408 KB
testcase_20 AC 666 ms
79,692 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:9:10: warning: parameter 'args' is never used
fun main(args: Array<String>){
         ^
Main.kt:63:118: warning: unnecessary non-null assertion (!!) on a non-null receiver of type Int
fun max(a: Int = -INF, b: Int = -INF, c: Int = -INF, d: Int = -INF, e: Int = -INF): Int = listOf(a, b, c, d, e).max()!!
                                                                                                                     ^
Main.kt:64:129: warning: unnecessary non-null assertion (!!) on a non-null receiver of type Long
fun max(a: Long = -LINF, b: Long = -LINF, c: Long = -LINF, d: Long = -LINF, e: Long = -LINF): Long = listOf(a, b, c, d, e).max()!!.toLong()
                                                                                                                                ^
Main.kt:65:124: warning: unnecessary non-null assertion (!!) on a non-null receiver of type Long
fun min(a: Long = LINF, b: Long = LINF, c: Long = LINF, d: Long = LINF, e: Long = LINF): Long = listOf(a, b, c, d, e).min()!!.toLong()
                                                                                                                           ^

ソースコード

diff # 

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

val pw = PrintWriter(System.out)
val MOD = 1000000007L
val INF = 2147483647
val LINF = 9223372036854775807L

fun main(args: Array<String>){
    solve()
    pw.flush()    
}

fun solve(){
    val (n, m, k) = nextIntList()
    val list = nextList()
    val op = list.first()
    val b = list.drop(1).map{ it.toLong() }
    val bsum = b.sum()
    val a = nextLongAryln(n)

    var ans = 0L
    if(op.equals("+")){
        for (i in a.indices) {
            ans = (ans + a[i] * m.toLong() + bsum) % k.toLong()
        }
    } else {
        for (i in a.indices) {
            ans = (ans + a[i] * bsum) % k.toLong()
        }
    }

    println(ans)

}

// Print
fun println(v: String){
    pw.println(v)
}
fun print(v: String){
    pw.print(v)
}

// Read
fun next() = readLine()!!
fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextDouble() = next().toDouble()
fun nextList() = next().split(" ")
fun nextIntList() = next().split(" ").map{ it.toInt() }
fun nextLongList() = next().split(" ").map{ it.toLong() }
fun nextDoubleList() = next().split(" ").map{ it.toDouble() }
fun nextAryln(n: Int) = Array(n){ next() }
fun nextIntAryln(n: Int) = IntArray(n){ nextInt() }
fun nextLongAryln(n: Int) = LongArray(n){ nextLong() }
fun nextDoubleAryln(n: Int) = DoubleArray(n) { nextDouble() }

// Math
fun abs(n: Int) : Int = Math.abs(n)
fun abs(n: Long) : Long = Math.abs(n)
fun abs(n: Double) : Double = Math.abs(n)
fun max(a: Int = -INF, b: Int = -INF, c: Int = -INF, d: Int = -INF, e: Int = -INF): Int = listOf(a, b, c, d, e).max()!!
fun max(a: Long = -LINF, b: Long = -LINF, c: Long = -LINF, d: Long = -LINF, e: Long = -LINF): Long = listOf(a, b, c, d, e).max()!!.toLong()
fun min(a: Long = LINF, b: Long = LINF, c: Long = LINF, d: Long = LINF, e: Long = LINF): Long = listOf(a, b, c, d, e).min()!!.toLong()
fun prime(from: Long, to: Long = from) : List<Long>{
    return (from..to).filter{ i ->
        val max = Math.sqrt(i.toDouble()).toLong()
        (2..max).all{ j -> i % j != 0L}
    }
}
fun gcd(a: Long, b: Long) : Long = if(a % b == 0L) b else gcd(b, (a % b))
fun lcm(a: Long, b: Long) : Long = a / gcd(a, b) * b
fun modpow(a: Long, n: Long, p:Long = MOD) : Long {
    var res = 1L
    var ar = a
    var nr = n
    while(nr > 0){
        if((nr and 1) == 1L) res = res * ar % p
        ar = ar * ar % p
        nr = nr shr 1
    }
    return res
}
fun modinv(a: Long, p: Long = MOD) : Long = modpow(a, p - 2, p)
fun ncr(n: Long, r: Long) : Long {
    var a = 1L
    var b = 1L
    for (i in 1..r) {
        a = a * (n + 1 - i) % MOD
        b = b * i % MOD
    }
    return modinv(b, MOD) * a % MOD
}
0