#553659 (Go) No.360 増加門松列

• 問題: No.360 増加門松列
• ユーザー: ccppjsrb
• 提出日時: 2020-09-16 18:24:59
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 1,948 bytes
• コンパイル時間: 13,824 ms
• コンパイル使用メモリ: 228,524 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 03:26:10
• 合計ジャッジ時間: 12,431 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,940 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	2 ms; 6,940 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	AC	2 ms; 6,940 KB
testcase_11	AC	2 ms; 6,944 KB
testcase_12	AC	2 ms; 6,940 KB
testcase_13	AC	2 ms; 6,940 KB
testcase_14	AC	2 ms; 6,940 KB
testcase_15	AC	1 ms; 6,944 KB
testcase_16	AC	2 ms; 6,944 KB
testcase_17	AC	2 ms; 6,940 KB
testcase_18	AC	2 ms; 6,940 KB
testcase_19	AC	2 ms; 6,944 KB
testcase_20	AC	2 ms; 6,940 KB
testcase_21	AC	2 ms; 6,940 KB

ソースコード

package main

import (
	"bufio"
	"fmt"
	"os"
	"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) {
	n := 7
	dd := make([]int, n)
	for i := 0; i < n; i++ {
		dd[i] = getNextInt(scanner)
	}
	aa := make([]int, n)
	ans := false
	var dfs func(i int, used uint32)
	dfs = func(i int, used uint32) {
		if i == n {
			ok := func() bool {
				for i := 0; i < n-2; i++ {
					if kadomatu(dd[aa[i]], dd[aa[i+1]], dd[aa[i+2]]) == false {
						return false
					}
				}
				return true
			}
			if ok() {
				ans = true
				return
			}
		}
		for j := 0; j < n; j++ {
			if used>>uint(j)&1 == 1 {
				continue
			}
			aa[i] = j
			dfs(i+1, used|1<<uint(j))
		}
	}
	dfs(0, 0)
	if ans {
		fmt.Fprintln(writer, "YES")
		return
	}
	fmt.Fprintln(writer, "NO")
}
func kadomatu(a, b, c int) bool {
	return a < c && (a > b && b < c || a < b && b > c)
}