結果

問題 No.1988 Divisor Tiling
ユーザー yakamoto
提出日時 2022-06-25 15:53:52
言語 Kotlin
(2.1.0)
結果
AC  
実行時間 382 ms / 2,000 ms
コード長 4,578 bytes
コンパイル時間 17,074 ms
コンパイル使用メモリ 469,872 KB
実行使用メモリ 60,736 KB
最終ジャッジ日時 2024-11-14 14:23:07
合計ジャッジ時間 30,243 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:185:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: LongArray) {
          ^
Main.kt:189:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: IntArray) {
          ^
Main.kt:193:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: BooleanArray) {
          ^
Main.kt:197:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")}
          ^
Main.kt:199:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<LongArray>) {
          ^
Main.kt:206:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<IntArray>) {
          ^
Main.kt:213:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<BooleanArray>) {
          ^
Main.kt:230:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()}
          ^

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.lang.AssertionError
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min
val MOD = 1_000_000_007
fun divisors(x: Int): MutableList<Int> {
val res = mutableListOf<Int>()
val post = mutableListOf<Int>()
var d = 1
while (d * d <= x) {
if (x % d == 0) {
res += d
if (d * d != x) post += x / d
}
++d
}
for (i in post.size - 1 downTo 0) {
res += post[i]
}
return res
}
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
private val reader = BufferedReader(InputStreamReader(stream), 32768)
fun transpose(g: Array<IntArray>): Array<IntArray> {
val H = g.size
val W = g[0].size
val g2 = Array(W){IntArray(H)}
for (h in 0 until H) {
for (w in 0 until W) {
g2[w][h] = g[h][w]
}
}
return g2
}
fun solve() {
val N = ni()
val H0 = ni()
if (H0 == 1) {
val ans = IntArray(N)
var cur = 0
for (d in divisors(N).dropLast(1)) {
for (i in 0 until d) {
ans[cur++] = d
}
}
out.println(ans.joinToString(" "))
return
}
if (H0 == N) {
for (d in divisors(N).dropLast(1)) {
for (i in 0 until d) {
out.println(d)
}
}
return
}
val H = if (N/H0 > H0) N/H0 else H0
debug{"H:$H"}
val divs = divisors(N).dropLast(1)
val g = Array(H){IntArray(N/H)}
val prevs = divs.take(divs.indexOf(H))
var row = 0
for (d in prevs) {
for (i in 0 until d) {
g[row++][0] = d
}
}
var col = 1
for (d in divs.drop(divs.indexOf(H))) {
for (i in 0 until d/H) {
for (j in 0 until H) {
g[j][col] = d
}
col++
}
}
debugDim(g)
val ans = if (H != H0) transpose(g) else g
for (i in 0 until H0) {
out.println(ans[i].joinToString(" "))
}
}
private val isDebug = try {
//
System.getenv("MY_DEBUG") != null
} catch (t: Throwable) {
false
}
private var tokenizer: StringTokenizer? = null
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 IntArray(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 debug(msg: () -> String) {
if (isDebug) System.err.println(msg())
}
/**
* debug(dp[1])debug{}
*/
private inline fun debug(a: LongArray) {
debug { a.joinToString(" ") }
}
private inline fun debug(a: IntArray) {
debug { a.joinToString(" ") }
}
private inline fun debug(a: BooleanArray) {
debug { toString(a) }
}
private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")}
private inline fun debugDim(A: Array<LongArray>) {
if (isDebug) {
for (a in A) {
debug(a)
}
}
}
private inline fun debugDim(A: Array<IntArray>) {
if (isDebug) {
for (a in A) {
debug(a)
}
}
}
private inline fun debugDim(A: Array<BooleanArray>) {
if (isDebug) {
for (a in A) {
debug(a)
}
}
}
/**
* import
*/
private fun hoge() {
min(1, 2)
max(1, 2)
abs(-10)
}
private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()}
private inline fun assert(b: Boolean, f: () -> String) = run{if (!b) throw AssertionError(f())}
companion object {
// TestRunnermain
fun main() {
val out = java.io.PrintWriter(System.out)
Solver(System.`in`, out).solve()
out.flush()
}
}
}
/**
* judge
*/
fun main() = Solver.main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0