#603488 (Go) No.343 手抜き工事のプロ

• 問題: No.343 手抜き工事のプロ
• ユーザー: aru aru
• 提出日時: 2021-01-15 20:35:21
• 言語: Go (1.23.4)
• 結果: AC
• 実行時間: 8 ms / 2,000 ms
• コード長: 2,026 bytes
• コンパイル時間: 13,637 ms
• コンパイル使用メモリ: 235,568 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-26 12:08:01
• 合計ジャッジ時間: 12,580 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

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

ソースコード

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
package main
import (
    "bufio"
    "fmt"
    "os"
    "sort"
    "strconv"
)
var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)
func out(x ...interface{}) {
    fmt.Fprintln(wr, x...)
}
func getI() int {
    sc.Scan()
    i, e := strconv.Atoi(sc.Text())
    if e != nil {
        panic(e)
    }
    return i
}
func getF() float64 {
    sc.Scan()
    i, e := strconv.ParseFloat(sc.Text(), 64)
    if e != nil {
        panic(e)
    }
    return i
}
func getInts(N int) []int {
    ret := make([]int, N)
    for i := 0; i < N; i++ {
        ret[i] = getI()
    }
    return ret
}
func getS() 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
}
// min for n entry
func nmin(a ...int) int {
    ret := a[0]
    for _, e := range a {
        ret = min(ret, e)
    }
    return ret
}
// max for n entry
func nmax(a ...int) int {
    ret := a[0]
    for _, e := range a {
        ret = max(ret, e)
    }
    return ret
}
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 main() {
    defer wr.Flush()
    sc.Split(bufio.ScanWords)
    sc.Buffer([]byte{}, 1000000)
    // this template is new version.
    // use getI(), getS(), getInts(), getF()
    N, L := getI(), getI()
    X := make([]int, N+1)
    for i := 0; i < N-1; i++ {
        X[i+1] = getI()
        X[i+1] += 100000
    }
    X[0] = 100000
    for i := 0; i < N-1; i++ {
        if abs(X[i]-X[i+1]) >= L {
            out(-1)
            return
        }
    }
    tot := 0
    ret := 0
    for i := N - 1; i >= 0; i-- {
        if i <= N-2 {
            mul := 2 * (N - 1 - i)
            //out(mul, N-1-i)
            if tot <= X[i+1]*mul ||
                (X[i+1]+L)*mul <= tot ||
                tot <= X[i]*mul ||
                (X[i]+L)*mul <= tot {
                ret++
            }
        }
        tot += 2*X[i] + L
    }
    out(ret)
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX