結果
問題 | No.1988 Divisor Tiling |
ユーザー |
![]() |
提出日時 | 2022-06-28 15:02:33 |
言語 | Kotlin (2.1.0) |
結果 |
AC
|
実行時間 | 389 ms / 2,000 ms |
コード長 | 3,736 bytes |
コンパイル時間 | 16,474 ms |
コンパイル使用メモリ | 456,388 KB |
実行使用メモリ | 56,940 KB |
最終ジャッジ日時 | 2024-11-21 07:49:38 |
合計ジャッジ時間 | 28,736 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 32 |
ソースコード
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/hval 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 = 0var k = d.size-1for( 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 = nvar a = Array<Long>(N+1) {0L}fun sum(i: Int): Long {var idx = i+1var res = 0Lwhile( idx > 0 ) {res += a[idx]idx -= idx and (-idx)}return res}fun add(i: Int, x: Long) {var idx = i+1while( idx <= N ) {a[idx] += xidx += idx and (-idx)}}}class UnionFind(n: Int) {val N = nvar 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 ) returnif( rank[rx] > rank[ry] ) {parent[ry] = rx}else {parent[rx] = ryif( 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: Longdo {r = a%ba = bb = r}while( r > 0 )return a}fun modpow(X: Long, T: Long, P: Long = 9223372036854775807L): Long {var x = Xvar t = Tif( t == 0L ) {return 1L}else {var res = 1Lwhile( t > 0 ) {if( t%2L == 1L ) {res *= xres %= Pt -= 1L}x *= xx %= Pt /= 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 */