提出 #46322767

---

ソースコード 拡げる

fun main() {
    val (n, m) = readln().split(" ").map { it.toInt() }
    val a = readln().split(" ").map { it.toInt() }
    val s = List(n) {
        val s = readln()
        s
    }

    val sums = IntArray(n)
    for(i in 0 until n) {
        for(j in 0 until m) {
            if(s[i][j] == 'x') {
                continue
            }
            sums[i] += a[j]
        }
        sums[i] += i + 1
    }
    val max = sums.max()

    val c = sums.count { it == max }
    val flag = c == 1

    val sortedA = a.mapIndexed { index, i -> index to i }.sortedByDescending { it.second }

    for(i in 0 until n) {
        var sum = sums[i]
        var count = 0

        if(sum == max && flag) {
            println(0)
            continue
        }

        var printed = false
        for(j in 0 until m) {
            if(max < sum) {
                printed = true
                println(count)
                break
            }

            if(s[i][sortedA[j].first] == 'o') {
                continue
            }

            sum += sortedA[j].second
            count++
        }
        if(!printed) {
            println(count)
        }
    }
}

提出情報

ジャッジ結果