結果
問題 | No.3094 Character Table |
ユーザー | 👑 箱 |
提出日時 | 2022-02-17 11:58:42 |
言語 | Kotlin (1.9.10) |
結果 |
AC
|
実行時間 | 274 ms / 2,000 ms |
コード長 | 2,952 bytes |
コンパイル時間 | 16,263 ms |
コンパイル使用メモリ | 429,864 KB |
実行使用メモリ | 56,048 KB |
最終ジャッジ日時 | 2023-09-11 17:36:25 |
合計ジャッジ時間 | 22,103 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 263 ms
52,048 KB |
testcase_01 | AC | 266 ms
54,096 KB |
testcase_02 | AC | 263 ms
54,136 KB |
testcase_03 | AC | 260 ms
52,652 KB |
testcase_04 | AC | 262 ms
52,348 KB |
testcase_05 | AC | 260 ms
52,632 KB |
testcase_06 | AC | 263 ms
54,192 KB |
testcase_07 | AC | 268 ms
54,528 KB |
testcase_08 | AC | 260 ms
52,128 KB |
testcase_09 | AC | 260 ms
52,024 KB |
testcase_10 | AC | 261 ms
54,364 KB |
testcase_11 | AC | 263 ms
52,368 KB |
testcase_12 | AC | 264 ms
52,260 KB |
testcase_13 | AC | 266 ms
56,048 KB |
testcase_14 | AC | 267 ms
52,052 KB |
testcase_15 | AC | 265 ms
54,584 KB |
testcase_16 | AC | 265 ms
54,148 KB |
testcase_17 | AC | 270 ms
54,288 KB |
testcase_18 | AC | 272 ms
52,300 KB |
testcase_19 | AC | 263 ms
54,076 KB |
testcase_20 | AC | 262 ms
52,784 KB |
testcase_21 | AC | 274 ms
53,896 KB |
testcase_22 | AC | 261 ms
54,224 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() if (n == 1) { println(1) return } val a = Array(n) { Array(n) { 0 } } var x = 0 var y = 0 for (i in 0 until n) { for (j in 0 until n) { val s = next() if (s == "?") { x = i y = j } else { a[i][j] = s.toInt() } } } for (j in 0 until n) { if (a[x][j] != 0) { var sum = 0 for (i in 0 until n) { sum -= a[i][j] * a[i][y] } println(sum / a[x][j]) break } } } // region ModInt class ModInt(x: Long) { companion object { const val MOD = 998244353L //const val MOD = 1000000007L } constructor(y: Int) : this(y.toLong()) 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" } } fun Long.toModInt(): ModInt { return ModInt(this) } fun Int.toModInt(): ModInt { return ModInt(this) } fun binomSimple(n: Long, k: Long): ModInt { var numer = ModInt(1) var denom = ModInt(1) for (i in 0 until k) { numer *= ModInt(n - i) denom *= ModInt(k - i) } return numer / denom } // endregion fun main() { Thread(null, { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() }, "solve", abs(1L.shl(26))) .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } } .apply { start() }.join() } // region Scanner private var st = StringTokenizer("") private val br = System.`in`.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() // endregion