結果
問題 | No.2045 Two Reflections |
ユーザー | 👑 箱 |
提出日時 | 2022-02-16 21:17:41 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 426 ms / 2,000 ms |
コード長 | 3,104 bytes |
コンパイル時間 | 15,060 ms |
コンパイル使用メモリ | 453,992 KB |
実行使用メモリ | 63,528 KB |
最終ジャッジ日時 | 2023-10-20 07:30:07 |
合計ジャッジ時間 | 27,001 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 284 ms
53,884 KB |
testcase_01 | AC | 282 ms
53,884 KB |
testcase_02 | AC | 373 ms
61,284 KB |
testcase_03 | AC | 426 ms
61,524 KB |
testcase_04 | AC | 386 ms
61,536 KB |
testcase_05 | AC | 335 ms
56,480 KB |
testcase_06 | AC | 355 ms
61,392 KB |
testcase_07 | AC | 396 ms
61,528 KB |
testcase_08 | AC | 370 ms
59,468 KB |
testcase_09 | AC | 398 ms
61,532 KB |
testcase_10 | AC | 395 ms
61,536 KB |
testcase_11 | AC | 316 ms
56,428 KB |
testcase_12 | AC | 272 ms
53,860 KB |
testcase_13 | AC | 279 ms
53,864 KB |
testcase_14 | AC | 285 ms
53,856 KB |
testcase_15 | AC | 281 ms
53,864 KB |
testcase_16 | AC | 281 ms
53,876 KB |
testcase_17 | AC | 282 ms
53,864 KB |
testcase_18 | AC | 286 ms
53,848 KB |
testcase_19 | AC | 282 ms
53,860 KB |
testcase_20 | AC | 401 ms
63,528 KB |
testcase_21 | AC | 373 ms
61,304 KB |
testcase_22 | AC | 377 ms
61,304 KB |
testcase_23 | AC | 373 ms
61,312 KB |
testcase_24 | AC | 379 ms
61,308 KB |
testcase_25 | AC | 379 ms
61,308 KB |
testcase_26 | AC | 375 ms
61,296 KB |
testcase_27 | AC | 376 ms
61,300 KB |
testcase_28 | AC | 376 ms
61,300 KB |
testcase_29 | AC | 380 ms
61,288 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* // 置換の積を計算 fun prod(p: Array<Int>, q: Array<Int>): Array<Int> { val n = p.size val r = Array(n) { 0 } for (i in 0 until n) { r[i] = q[p[i]] } return r } fun makeReflectionLeft(n: Int, p: Int): Array<Int> { val x = Array(n) { it } for (i in 0 until p) { x[p - 1 - i] = i } return x } fun makeReflectionRight(n: Int, q: Int): Array<Int> { val x = Array(n) { it } for (i in n - q until n) { x[i] = 2 * n - q - i - 1 } return x } fun lcm(a: Long, b: Long): Long { return a / gcd(a, b) * b } fun gcd(a: Long, b: Long): Long { if (b == 0L) return a val c = a % b return gcd(b, c) } fun PrintWriter.solve() { val n = nextInt() val p = nextInt() val q = nextInt() if (p == 1 && q == 1) { println(1) } else if (p == 1 || q == 1) { println(2) } else { val x = makeReflectionLeft(n, p) val y = makeReflectionRight(n, q) val xy = prod(x, y) val uf = UnionFind(n) for (i in 0 until n) { uf.unite(i, xy[i]) } val set = mutableSetOf<Int>() for (i in 0 until n) { set.add(uf.find(i)) } val sizes = mutableSetOf<Long>() for (i in set) { sizes.add(uf.size(i).toLong()) } println(2 * sizes.fold(1L, ::lcm) % 998244353) } } class UnionFind(n: Int) { private val rank = IntArray(n) { 0 } private val parent = IntArray(n) { -1 } fun find(x: Int): Int { if (parent[x] < 0) { return x } parent[x] = find(parent[x]) return parent[x] } fun unite(x: Int, y: Int) { val x1 = find(x) val y1 = find(y) if (x1 == y1) { return } if (rank[x1] < rank[y1]) { parent[y1] += parent[x1] parent[x1] = y1 } else { parent[x1] += parent[y1] parent[y1] = x1 if (rank[x1] == rank[y1]) { rank[x1]++ } } } fun same(x: Int, y: Int): Boolean { return find(x) == find(y) } fun size(x: Int): Int { return -parent[find(x)] } } 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