-
Notifications
You must be signed in to change notification settings - Fork 0
/
15.go
57 lines (46 loc) · 853 Bytes
/
15.go
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
package main
import (
"container/list"
"fmt"
)
func main() {
var N, M, K, X int
fmt.Scanln(&N, &M, &K, &X)
info := make([][]int, N+1)
arrived := make([]bool, N+1)
distance := make([]int, N+1)
for i := 0; i < len(distance); i++ {
distance[i] = -1
}
for i := 0; i < M; i++ {
var a, b int
fmt.Scanln(&a, &b)
info[a] = append(info[a], b)
}
arrived[X] = true
distance[X] = 0
queue := list.New()
queue.PushBack(X)
for queue.Len() > 0 {
item := queue.Front()
now := item.Value.(int)
queue.Remove(item)
for _, v := range info[now] {
if !arrived[v] {
queue.PushBack(v)
arrived[v] = true
distance[v] = distance[now] + 1
}
}
}
cityExisted := false
for i := 1; i < len(distance); i++ {
if distance[i] == K {
fmt.Println(i)
cityExisted = true
}
}
if !cityExisted {
fmt.Println(-1)
}
}