-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1741D.go
64 lines (56 loc) · 899 Bytes
/
1741D.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
package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var in, out = bufio.NewReader(os.Stdin), bufio.NewWriter(os.Stdout)
func solve() string {
var n, res int
fmt.Fscan(in, &n)
v := make([]int, n)
for i := range v {
fmt.Fscan(in, &v[i])
}
for step := 1; step < n; step *= 2 {
for i := 0; i < n; i += 2 * step {
min, max := 262145, 0
for j := i; j < i+2*step; j++ {
if v[j] < min {
min = v[j]
}
if v[j] > max {
max = v[j]
}
}
if max-min >= 2*step {
return "-1"
}
if v[i] > v[i+step] {
res++
}
}
}
return strconv.Itoa(res)
}
func main() {
defer out.Flush()
var t int
for fmt.Fscanln(in, &t); t > 0; t-- {
fmt.Fprintln(out, solve())
}
}
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
}