結果

問題 No.1242 高橋君とすごろく
ユーザー ccppjsrbccppjsrb
提出日時 2020-10-02 22:12:45
言語 Go
(1.23.4)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,082 bytes
コンパイル時間 14,903 ms
コンパイル使用メモリ 232,228 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-20 02:47:20
合計ジャッジ時間 15,863 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
)
func configure(scanner *bufio.Scanner) {
scanner.Split(bufio.ScanWords)
scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
scanned := scanner.Scan()
if !scanned {
panic("scan failed")
}
return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
i, _ := strconv.Atoi(getNextString(scanner))
return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
i, _ := strconv.ParseFloat(getNextString(scanner), 64)
return i
}
func main() {
fp := os.Stdin
wfp := os.Stdout
extra := 0
if os.Getenv("I") == "IronMan" {
fp, _ = os.Open(os.Getenv("END_GAME"))
extra = 100
}
scanner := bufio.NewScanner(fp)
configure(scanner)
writer := bufio.NewWriter(wfp)
defer func() {
r := recover()
if r != nil {
fmt.Fprintln(writer, r)
}
writer.Flush()
}()
solve(scanner, writer)
for i := 0; i < extra; i++ {
fmt.Fprintln(writer, "-----------------------------------")
solve(scanner, writer)
}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
_ = getNextInt64(scanner)
k := getNextInt(scanner)
aa := make([]int64, k)
m := map[int64]bool{}
for i := 0; i < k; i++ {
aa[i] = getNextInt64(scanner)
m[aa[i]] = true
}
loop := true
for loop {
loop = false
for i := len(aa) - 1; i >= 0; i-- {
for j := 0; j < 3; j++ {
s := int64(j*2 + 1)
if aa[i]-s < 1 {
continue
}
if !m[aa[i]-s] {
continue
}
if aa[i]-int64(4+j) < 1 {
continue
}
if m[aa[i]-int64(4+j)] {
continue
}
m[aa[i]-int64(4+j)] = true
aa = append(aa, aa[i]-int64(4+j))
loop = true
}
}
sort.Slice(aa, func(i, j int) bool {
return aa[i] < aa[j]
})
for i := len(aa) - 1; i-5 >= 0; i-- {
if aa[i-5]+5 == aa[i] {
fmt.Fprintln(writer, "No")
return
}
}
}
if m[1] {
fmt.Fprintln(writer, "No")
return
}
fmt.Fprintln(writer, "Yes")
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0