結果
問題 | No.1988 Divisor Tiling |
ユーザー | ripity |
提出日時 | 2022-06-28 15:02:33 |
言語 | Kotlin (1.9.10) |
結果 |
AC
|
実行時間 | 374 ms / 2,000 ms |
コード長 | 3,736 bytes |
コンパイル時間 | 16,521 ms |
コンパイル使用メモリ | 432,472 KB |
実行使用メモリ | 52,940 KB |
最終ジャッジ日時 | 2023-08-13 12:50:26 |
合計ジャッジ時間 | 30,262 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 276 ms
50,272 KB |
testcase_01 | AC | 274 ms
50,304 KB |
testcase_02 | AC | 272 ms
50,524 KB |
testcase_03 | AC | 274 ms
50,292 KB |
testcase_04 | AC | 277 ms
50,332 KB |
testcase_05 | AC | 275 ms
50,308 KB |
testcase_06 | AC | 276 ms
50,220 KB |
testcase_07 | AC | 274 ms
50,228 KB |
testcase_08 | AC | 283 ms
50,348 KB |
testcase_09 | AC | 287 ms
50,376 KB |
testcase_10 | AC | 289 ms
50,552 KB |
testcase_11 | AC | 285 ms
50,212 KB |
testcase_12 | AC | 286 ms
50,284 KB |
testcase_13 | AC | 285 ms
50,544 KB |
testcase_14 | AC | 284 ms
50,400 KB |
testcase_15 | AC | 287 ms
50,624 KB |
testcase_16 | AC | 280 ms
50,384 KB |
testcase_17 | AC | 281 ms
50,228 KB |
testcase_18 | AC | 359 ms
52,632 KB |
testcase_19 | AC | 355 ms
52,932 KB |
testcase_20 | AC | 365 ms
52,728 KB |
testcase_21 | AC | 362 ms
52,808 KB |
testcase_22 | AC | 361 ms
52,640 KB |
testcase_23 | AC | 362 ms
52,612 KB |
testcase_24 | AC | 361 ms
52,672 KB |
testcase_25 | AC | 354 ms
52,768 KB |
testcase_26 | AC | 355 ms
52,532 KB |
testcase_27 | AC | 361 ms
52,784 KB |
testcase_28 | AC | 358 ms
52,636 KB |
testcase_29 | AC | 357 ms
52,736 KB |
testcase_30 | AC | 357 ms
52,780 KB |
testcase_31 | AC | 374 ms
52,940 KB |
testcase_32 | AC | 273 ms
50,316 KB |
testcase_33 | AC | 274 ms
50,320 KB |
ソースコード
import java.io.* import java.util.* import kotlin.math.* fun main() { // val T = nextInt() // repeat(T) {solve()} // pw.flush() solve() pw.flush() } fun solve() { val N = nextInt() val h = nextInt() val w = N/h val H = min(h, w) val W = max(h, w) var x = Array(H) { IntArray(W) { -1 } } val d = when(N) { 6 -> arrayOf(1, 2, 3) 28 -> arrayOf(1, 2, 4, 7, 14) 496 -> arrayOf(1, 2, 4, 8, 16, 31, 62, 124, 248) else -> arrayOf(1, 2, 4, 8, 16, 32, 64, 127, 254, 508, 1016, 2032, 4064) } var cnt = 0 var k = d.size-1 for( i in 0 until H ) { for( j in 0 until W ) { if( cnt == d[k] ) { cnt = 0; k-- } cnt++ x[i][j] = d[k] } } for( i in 0 until h ) { for( j in 0 until w ) { val ans = if( H == h ) x[i][j] else x[j][i] pw.print("$ans ") } pw.println() } } /* struct begin */ data class Cell(val r: Int, val c: Int) data class Point(val x: Long, val y: Long) data class Pii(val fi: Int, val se: Int) data class Edge(val to: Int, val w: Long) class BinaryIndexedTree(n: Int) { val N = n var a = Array<Long>(N+1) {0L} fun sum(i: Int): Long { var idx = i+1 var res = 0L while( idx > 0 ) { res += a[idx] idx -= idx and (-idx) } return res } fun add(i: Int, x: Long) { var idx = i+1 while( idx <= N ) { a[idx] += x idx += idx and (-idx) } } } class UnionFind(n: Int) { val N = n var parent = Array<Int>(N) {it} var rank = Array<Int>(N) {1} fun root(x: Int): Int { if( parent[x] == x ) { return x }else { parent[x] = root(parent[x]) return parent[x] } } fun unite(x: Int, y: Int) { val rx = root(x) val ry = root(y) if( rx == ry ) return if( rank[rx] > rank[ry] ) { parent[ry] = rx }else { parent[rx] = ry if( rank[rx] == rank[ry] ) rank[ry]++ } } fun same(x: Int, y: Int): Boolean = (root(x) == root(y)) } /* struct end */ /* math begin */ fun intceil(x: Double) = ceil(x).toInt() fun intfloor(x: Double) = floor(x).toInt() fun gcd(x: Long, y: Long): Long { var a = max(abs(x), abs(y)) var b = min(abs(x), abs(y)) var r: Long do { r = a%b a = b b = r }while( r > 0 ) return a } fun modpow(X: Long, T: Long, P: Long = 9223372036854775807L): Long { var x = X var t = T if( t == 0L ) { return 1L }else { var res = 1L while( t > 0 ) { if( t%2L == 1L ) { res *= x res %= P t -= 1L } x *= x x %= P t /= 2 } return res%P } } /* math end */ /* I/O begin */ var st = StringTokenizer("") val br = System.`in`.bufferedReader() val pw = PrintWriter(System.out, false) fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine()!! fun nextDouble() = next().toDouble() fun nextIntarr(n: Int) = Array<Int>(n) {nextInt()} fun nextStrarr(n: Int) = Array<String>(n) {next()} fun nextLongarr(n: Int) = Array<Long>(n) {nextLong()} fun next(): String { while( !st.hasMoreTokens() ) st = StringTokenizer(br.readLine()!!) return st.nextToken() } /* I/O end */