#525026 (Go) No.92 逃走経路

• 問題: No.92 逃走経路
• ユーザー: aru aru
• 提出日時: 2020-08-05 21:23:37
• 言語: Go (1.23.4)
• 結果: AC
• 実行時間: 9 ms / 5,000 ms
• コード長: 1,871 bytes
• コンパイル時間: 12,566 ms
• コンパイル使用メモリ: 239,204 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-17 12:28:02
• 合計ジャッジ時間: 13,284 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 18

ソースコード

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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
package main
import (
    "bufio"
    "fmt"
    "os"
    "sort"
    "strconv"
)
func out(x ...interface{}) {
    fmt.Println(x...)
}
var sc = bufio.NewScanner(os.Stdin)
func getInt() int {
    sc.Scan()
    i, e := strconv.Atoi(sc.Text())
    if e != nil {
        panic(e)
    }
    return i
}
func getInts(N int) []int {
    ret := make([]int, N)
    for i := 0; i < N; i++ {
        ret[i] = getInt()
    }
    return ret
}
func getString() string {
    sc.Scan()
    return sc.Text()
}
// min, max, asub, absなど基本関数
func max(a, b int) int {
    if a > b {
        return a
    }
    return b
}
func min(a, b int) int {
    if a < b {
        return a
    }
    return b
}
func asub(a, b int) int {
    if a > b {
        return a - b
    }
    return b - a
}
func abs(a int) int {
    if a >= 0 {
        return a
    }
    return -a
}
func lowerBound(a []int, x int) int {
    idx := sort.Search(len(a), func(i int) bool {
        return a[i] >= x
    })
    return idx
}
func upperBound(a []int, x int) int {
    idx := sort.Search(len(a), func(i int) bool {
        return a[i] > x
    })
    return idx
}
type pair struct {
    t, c int
}
var N, M, K int
var node [][]pair
var d []int
var find []int
var memo [100][1010]bool
func check(p, k int) {
    if k == K {
        find = append(find, (p + 1))
        return
    }
    if memo[p][k] == true {
        return
    }
    memo[p][k] = true
    for _, v := range node[p] {
        if v.c == d[k] {
            check(v.t, k+1)
        }
    }
    return
}
func main() {
    sc.Split(bufio.ScanWords)
    N, M, K = getInt(), getInt(), getInt()
    node = make([][]pair, N)
    for i := 0; i < M; i++ {
        f, t, c := getInt()-1, getInt()-1, getInt()
        // out(f, t, c)
        node[f] = append(node[f], pair{t, c})
        node[t] = append(node[t], pair{f, c})
    }
    d = getInts(K)
    for i := 0; i < N; i++ {
        check(i, 0)
    }
    ans := make([]int, 0)
    sort.Ints(find)
    prev := -1
    for _, e := range find {
        if e != prev {
            ans = append(ans, e)
        }
        prev = e
    }
    out(len(ans))
    for _, e := range ans {
        fmt.Print(e, " ")
    }
    out()
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX