-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1741E.go
73 lines (62 loc) · 919 Bytes
/
1741E.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
73
package main
import (
"bufio"
"fmt"
"os"
)
var in, out = bufio.NewReader(os.Stdin), bufio.NewWriter(os.Stdout)
func solve() string {
var n int
fmt.Fscan(in, &n)
v := make([]int, n+1)
for i := 1; i <= n; i++ {
fmt.Fscan(in, &v[i])
}
dp := make([]bool, n+1)
dp[0] = true
for i := 1; i <= n; i++ {
if i+v[i] <= n && dp[i-1] {
dp[i+v[i]] = true
}
if i-v[i]-1 >= 0 && dp[i-v[i]-1] {
dp[i] = true
}
}
if dp[n] {
return "YES"
}
return "NO"
}
func main() {
defer out.Flush()
var t int
for fmt.Fscanln(in, &t); t > 0; t-- {
fmt.Fprintln(out, solve())
}
}
// util functions
func max(x, y int) int {
if x > y {
return x
}
return y
}
func min(x, y int) int {
if x < y {
return x
}
return y
}
func abs(x int) int {
if x < 0 {
return -x
}
return x
}
func makeMatrix(n, m int) [][]int {
x := make([][]int, n)
for i := range x {
x[i] = make([]int, m)
}
return x
}