#500768 (Go) No.3 ビットすごろく

• 問題: No.3 ビットすごろく
• ユーザー: aru aru
• 提出日時: 2020-06-21 12:02:59
• 言語: Go (1.23.4)
• 結果: AC
• 実行時間: 3 ms / 5,000 ms
• コード長: 2,923 bytes
• コンパイル時間: 11,510 ms
• コンパイル使用メモリ: 222,480 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-07-01 09:51:06
• 合計ジャッジ時間: 12,288 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
other	AC * 33

ソースコード

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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
package main
import (
    "bufio"
    "container/heap"
    "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
}
func bitCount(bits int) int {
    bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555)
    bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333)
    bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f)
    bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff)
    return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff)
}
var node [][]int
var used []bool
var dist []int
var N int
const inf = 100100101001
type pqi struct{ a int }
type priorityQueue []pqi
func (pq priorityQueue) Len() int            { return len(pq) }
func (pq priorityQueue) Swap(i, j int)       { pq[i], pq[j] = pq[j], pq[i] }
func (pq priorityQueue) Less(i, j int) bool  { return pq[i].a < pq[j].a }
func (pq *priorityQueue) Push(x interface{}) { *pq = append(*pq, x.(pqi)) }
func (pq *priorityQueue) Pop() interface{} {
    x := (*pq)[len(*pq)-1]
    *pq = (*pq)[0 : len(*pq)-1]
    return x
}
func dijkstra(x int) {
    dist = make([]int, N+1)
    for i := 0; i <= N; i++ {
        dist[i] = inf
    }
    pq := priorityQueue{}
    heap.Push(&pq, pqi{x})
    dist[x] = 1
    for len(pq) != 0 {
        cur := heap.Pop(&pq).(pqi).a
        for _, to := range node[cur] {
            if dist[to] > dist[cur]+1 {
                dist[to] = dist[cur] + 1
                heap.Push(&pq, pqi{to})
            }
        }
    }
}
func bsf(x int) {
    dist = make([]int, N+1)
    for i := 0; i <= N; i++ {
        dist[i] = inf
    }
    q := make([]int, 0)
    q = append(q, 1)
    dist[1] = 1
    for len(q) != 0 {
        cur := q[0]
        q = q[1:]
        for _, to := range node[cur] {
            if dist[to] > dist[cur]+1 {
                dist[to] = dist[cur] + 1
                q = append(q, to)
            }
        }
    }
}
func main() {
    sc.Split(bufio.ScanWords)
    N = getInt()
    node = make([][]int, N+1)
    for i := 1; i < N; i++ {
        n := bitCount(i)
        if i+n <= N {
            node[i] = append(node[i], i+n)
        }
        if i-n >= 0 {
            node[i] = append(node[i], i-n)
        }
    }
    used = make([]bool, N+1)
    //　ダイクストラでも幅優先でもどちらでもＯＫ
    //      dijkstra(1)
    bsf(1)
    if dist[N] == inf {
        out(-1)
        return
    }
    out(dist[N])
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX