-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path021.swift
59 lines (50 loc) · 1.08 KB
/
021.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
func readInts() -> [Int] {
readLine()!.split(separator: " ").map { Int(String($0))! }
}
let nm = readInts()
let n = nm[0]
let m = nm[1]
var arrows: [[Int]] = [[Int]](repeating: [], count: n + 1)
var revArrows: [[Int]] = [[Int]](repeating: [], count: n + 1)
for _ in 1...m {
let input = readInts()
arrows[input[0]].append(input[1])
revArrows[input[1]].append(input[0])
}
var order1: [Int] = []
var done1 = [Bool](repeating: false, count: n + 1)
func dfs1(n: Int) {
done1[n] = true
for c in arrows[n] {
if done1[c] == false {
dfs1(n: c)
}
}
order1.append(n)
}
for i in 1...n {
if done1[i] == false {
dfs1(n: i)
}
}
let order2 = order1.reversed()
var done2 = [Bool](repeating: false, count: n + 1)
var counter = 0
var ans = 0
func dfs2(n: Int) {
done2[n] = true
counter += 1
for c in revArrows[n] {
if done2[c] == false {
dfs2(n: c)
}
}
}
for i in order2 {
if done2[i] == false {
counter = 0
dfs2(n: i)
ans += counter * (counter - 1) / 2
}
}
print(ans)