-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0291-蒙德里安的梦想.go
72 lines (61 loc) · 907 Bytes
/
0291-蒙德里安的梦想.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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
package main
import (
"fmt"
)
const (
N = 12
M = 1 << N
)
func main() {
var (
st [M]bool
state = map[int][]int{}
n, m int
)
// in := oj.In()
// os.Stdin = in
// defer in.Close()
for {
fmt.Scan(&n, &m)
if n|m == 0 {
break
}
var f [N][M]int64
for i := 0; i < 1<<n; i++ {
cnt := 0
isValid := true
for j := 0; j < n; j++ {
if i>>j&1 == 1 {
if cnt&1 == 1 {
isValid = false
break
}
cnt = 0
} else {
cnt++
}
}
if cnt&1 == 1 {
isValid = false
}
st[i] = isValid
}
for i := 0; i < 1<<n; i++ {
state[i] = []int{}
for j := 0; j < 1<<n; j++ {
if i&j == 0 && st[i|j] {
state[i] = append(state[i], j)
}
}
}
f[0][0] = 1
for i := 1; i <= m; i++ {
for j := 0; j < 1<<n; j++ {
for _, k := range state[j] {
f[i][j] += f[i-1][k]
}
}
}
fmt.Println(f[m][0])
}
}