結果
問題 | No.1660 Matrix Exponentiation |
ユーザー | 👑 箱 |
提出日時 | 2021-07-23 06:01:55 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 1,408 ms / 2,000 ms |
コード長 | 3,054 bytes |
コンパイル時間 | 17,321 ms |
コンパイル使用メモリ | 454,020 KB |
実行使用メモリ | 120,560 KB |
最終ジャッジ日時 | 2023-12-20 02:25:34 |
合計ジャッジ時間 | 35,253 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 314 ms
57,520 KB |
testcase_01 | AC | 287 ms
54,036 KB |
testcase_02 | AC | 303 ms
57,512 KB |
testcase_03 | AC | 301 ms
57,508 KB |
testcase_04 | AC | 313 ms
57,520 KB |
testcase_05 | AC | 283 ms
53,976 KB |
testcase_06 | AC | 276 ms
54,032 KB |
testcase_07 | AC | 287 ms
53,976 KB |
testcase_08 | AC | 311 ms
57,512 KB |
testcase_09 | AC | 459 ms
65,056 KB |
testcase_10 | AC | 493 ms
65,108 KB |
testcase_11 | AC | 288 ms
58,716 KB |
testcase_12 | AC | 289 ms
54,032 KB |
testcase_13 | AC | 283 ms
54,036 KB |
testcase_14 | AC | 305 ms
57,540 KB |
testcase_15 | AC | 344 ms
59,852 KB |
testcase_16 | AC | 320 ms
59,752 KB |
testcase_17 | AC | 307 ms
57,580 KB |
testcase_18 | AC | 343 ms
59,856 KB |
testcase_19 | AC | 826 ms
78,212 KB |
testcase_20 | AC | 774 ms
73,976 KB |
testcase_21 | AC | 863 ms
76,112 KB |
testcase_22 | AC | 511 ms
63,232 KB |
testcase_23 | AC | 634 ms
69,872 KB |
testcase_24 | AC | 1,286 ms
118,556 KB |
testcase_25 | AC | 1,033 ms
87,316 KB |
testcase_26 | AC | 1,408 ms
118,708 KB |
testcase_27 | AC | 302 ms
58,716 KB |
testcase_28 | AC | 821 ms
87,080 KB |
testcase_29 | AC | 947 ms
120,560 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val m = nextInt() val adj = Array(n) { mutableListOf<Int>() } val set = mutableSetOf<Pair<Int, Int>>() for (i in 0 until m) { val v1 = nextInt() - 1 val v2 = nextInt() - 1 if (v1 == v2 || set.contains(v2 to v1)) { println(-1) return } adj[v1].add(v2) set.add(v1 to v2) } if (findCycle(adj).isNotEmpty()) { println(-1) } else { val lst = topologicalSort(adj) val dp = IntArray(n) { -1 } fun dfs(v: Int): Int { if (dp[v] != -1) return dp[v] var max = 0 for (w in adj[v]) { max = maxOf(max, dfs(w)) } dp[v] = max + 1 return dp[v] } lst.forEach { dfs(it) } println(dp.maxOrNull()!!) } } fun findCycle(adj: Array<MutableList<Int>>): List<Int> { val n = adj.size val seen = BooleanArray(n) { false } val finished = BooleanArray(n) { false } var pos = -1 val hist = Stack<Int>() fun dfs(v: Int, p: Int) { seen[v] = true hist.push(v) for (w in adj[v]) { if (w == p) continue if (finished[w]) continue if (seen[w] && !finished[w]) { pos = w return } dfs(w, v) if (pos != -1) return } hist.pop() finished[v] = true } for (i in 0 until n) { if (!finished[i]) { dfs(i, -1) if (pos != -1) break } } val cycle = mutableListOf<Int>() while (hist.isNotEmpty()) { val t = hist.pop() cycle.add(t) if (t == pos) break } return cycle } fun topologicalSort(adj: Array<MutableList<Int>>): List<Int> { val ans = mutableListOf<Int>() val n = adj.size val ind = IntArray(n) { 0 } for (i in 0 until n) { for (v in adj[i]) ind[v]++ } val que: Queue<Int> = ArrayDeque() for (i in 0 until n) { if (ind[i] == 0) que.add(i) } while (que.isNotEmpty()) { val now = que.poll() ans.add(now) for (v in adj[now]) { ind[v]-- if (ind[v] == 0) que.add(v) } } return ans } fun main2() { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() } fun main() = Thread(null, ::main2, "", 64 * 1024 * 1024) .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