結果
問題 | No.1553 Lovely City |
ユーザー |
![]() |
提出日時 | 2021-06-19 11:56:07 |
言語 | Kotlin (2.1.0) |
結果 |
AC
|
実行時間 | 1,290 ms / 2,000 ms |
コード長 | 7,016 bytes |
コンパイル時間 | 17,459 ms |
コンパイル使用メモリ | 472,788 KB |
実行使用メモリ | 140,384 KB |
最終ジャッジ日時 | 2024-06-22 21:55:59 |
合計ジャッジ時間 | 47,299 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 26 |
コンパイルメッセージ
Main.kt:290: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:294: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:298: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:302: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:304: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:311: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:318: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:335: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()} ^
ソースコード
import java.io.BufferedReaderimport java.io.InputStreamimport java.io.InputStreamReaderimport java.lang.AssertionErrorimport java.util.*import kotlin.math.absimport kotlin.math.maximport kotlin.math.minval MOD = 998244353class UnionFind(n: Int) {private val par = IntArray(n){it}private val rank = IntArray(n){1} // 集合の要素数private val visits = IntArray(n) // 訪れた場所をfind毎に用意するのがもったいないのでつかいまわすfun find(x: Int): Int {var ptr = 0var i = xwhile(par[i] != i) {visits[ptr++] = ii = par[i]}for (j in 0 until ptr) {par[visits[j]] = i}return i}private fun merge(node: Int, rt: Int): Int {par[node] = rtrank[rt] += rank[node]return rt}fun unite(x: Int, y: Int): Boolean {val x1 = find(x)val y1 = find(y)return if (x1 == y1) falseelse {if (rank[x1] < rank[y1])merge(x1, y1)elsemerge(y1, x1)true}}fun isSame(x: Int, y: Int) = find(x) == find(y)fun isRoot(x: Int) = par[x] == x/*** xを解決する必要がないときは直にrankをみる*/fun cntNodes(x: Int): Int = rank[find(x)]fun inspect() = run{par}}/*** 連結成分毎にsubgraphに分けて、subgraph上で番号を振り直す処理をまとめたもの*/class GroupedByDSU(private val N: Int,private val M: Int,private val from: IntArray,private val to: IntArray){private class BuildingGroup {val from = mutableListOf<Int>()val to = mutableListOf<Int>()val nodes = mutableListOf<Int>()}data class Group(val N: Int, val from: IntArray, val to: IntArray)/*** 引数のIntArrayはzip_id->node_idのmapping*/fun process(f: (Group, IntArray) -> Unit) {val uf = UnionFind(N)for (i in 0 until M) {uf.unite(from[i], to[i])}val grpOf = IntArray(N)val grp = Array(N){BuildingGroup()}for (i in 0 until N) {grpOf[i] = uf.find(i)grp[grpOf[i]].nodes += i}for (i in 0 until M) {val g = grp[grpOf[from[i]]]g.from += from[i]g.to += to[i]}val mapping = IntArray(N) // zip_id -> node_idval inv = IntArray(N) // node_id -> zip_idfor (g in grp) {if (g.nodes.size == 0) continuefor (i in g.nodes.indices) {val v = g.nodes[i]mapping[i] = vinv[v] = i}val gFrom = IntArray(g.from.size)val gTo = IntArray(g.to.size)for (i in g.from.indices) {gFrom[i] = inv[g.from[i]]gTo[i] = inv[g.to[i]]}val group = Group(g.nodes.size, gFrom, gTo)f(group, mapping)}}}fun packDGraph(n: Int, from: IntArray, to: IntArray): Array<IntArray> {val p = IntArray(n)val m = from.sizefor (i in 0 until m) {++p[from[i]]}val g = Array(n){IntArray(p[it])}for (i in 0 until m) {g[from[i]][--p[from[i]]] = to[i]}return g}/*** @return node->order じゃなくて、nodeのリストを返す。*/fun topologicalSort(n: Int, g: Array<IntArray>): IntArray? {val res = IntArray(n){-1}var ptr = 0val que = ArrayDeque<Int>()val deg = IntArray(n)for (v in 0 until n) {for (o in g[v]) {deg[o]++}}for (v in 0 until n) {if (deg[v] == 0) que.add(v)}while(que.isNotEmpty()) {val v = que.poll()res[ptr++] = vfor (i in g[v].indices) {val o = g[v][i]if (--deg[o] == 0) que.add(o)}}// 全部に順序がつかないとループがあったってこと// グラフにでてこないノードにも順序がつくreturn if (ptr < n) null else res}class Solver(stream: InputStream, private val out: java.io.PrintWriter) {private val reader = BufferedReader(InputStreamReader(stream), 32768)fun solve() {val (N, M) = na(2)val (from, to) = na2(M, -1)val ans = mutableListOf<Pair<Int, Int>>()val grouped = GroupedByDSU(N, M, from, to)grouped.process { grp, map ->val n = grp.Nval g = packDGraph(n, grp.from, grp.to)val top = topologicalSort(n, g)if (top == null) {// 一回転for (i in 0 until n) {ans += Pair(map[i], map[(i + 1)%n])}}else {// 一直線for (o in 0 until n - 1) {ans += Pair(map[top[o]], map[top[o + 1]])}}}out.println(ans.size)for (i in ans) {out.println("${i.first+1} ${i.second+1}")}}private val isDebug = try {// なんか本番でエラーでるSystem.getenv("MY_DEBUG") != null} catch (t: Throwable) {false}private var tokenizer: StringTokenizer? = nullprivate 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())}}fun main() {val out = java.io.PrintWriter(System.out)Solver(System.`in`, out).solve()out.flush()}