#502675 (Go) No.349 干支の置き物

• 問題: No.349 干支の置き物
• ユーザー: ccppjsrb
• 提出日時: 2020-06-26 16:35:25
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,324 bytes
• コンパイル時間: 14,872 ms
• コンパイル使用メモリ: 222,800 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-04 02:27:51
• 合計ジャッジ時間: 15,262 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	1 ms; 6,940 KB
testcase_09	AC	1 ms; 6,944 KB
testcase_10	AC	1 ms; 6,940 KB
testcase_11	AC	1 ms; 6,944 KB
testcase_12	AC	1 ms; 6,944 KB
testcase_13	AC	1 ms; 6,944 KB
testcase_14	AC	1 ms; 6,944 KB
testcase_15	AC	2 ms; 6,944 KB
testcase_16	AC	1 ms; 6,944 KB
testcase_17	AC	1 ms; 6,940 KB
testcase_18	AC	1 ms; 6,940 KB
testcase_19	AC	1 ms; 6,940 KB
testcase_20	AC	1 ms; 6,940 KB
testcase_21	AC	1 ms; 6,940 KB
testcase_22	AC	1 ms; 6,940 KB
testcase_23	AC	1 ms; 6,940 KB
testcase_24	AC	2 ms; 6,940 KB
testcase_25	AC	1 ms; 6,944 KB
testcase_26	AC	1 ms; 6,940 KB
testcase_27	AC	1 ms; 6,940 KB
testcase_28	AC	1 ms; 6,944 KB
testcase_29	AC	1 ms; 6,940 KB
testcase_30	AC	1 ms; 6,944 KB
testcase_31	AC	1 ms; 6,944 KB

ソースコード

package main

import (
	"bufio"
	"container/heap"
	"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 := getNextInt(scanner)
	m := map[string]int{}
	aa := make([]string, n+1)
	for i := 0; i < n; i++ {
		a := getNextString(scanner)
		m[a]++
	}
	ee := make(etoes, 0)
	for a, c := range m {
		ee = append(ee, newEto(a, c))
	}
	heap.Init(&ee)
	i := 0
	for ee.Len() > 0 {
		p := heap.Pop(&ee).(eto)
		if p.a != aa[i] {
			i++
			aa[i] = p.a
			p.c--
			if p.c > 0 {
				heap.Push(&ee, p)
			}
			continue
		}
		if ee.Len() == 0 {
			fmt.Fprintln(writer, "NO")
			return
		}
		pp := heap.Pop(&ee).(eto)
		i++
		aa[i] = pp.a
		pp.c--
		if pp.c > 0 {
			heap.Push(&ee, pp)
		}
		heap.Push(&ee, p)
	}
	fmt.Fprintln(writer, "YES")
}

func newEto(a string, c int) eto {
	return eto{
		a: a,
		c: c,
	}
}

type eto struct {
	a string
	c int
}

type etoes []eto

func (h etoes) Len() int { return len(h) }
func (h etoes) Less(i, j int) bool {
	return h[i].c > h[j].c
}
func (h etoes) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
func (h *etoes) Push(x interface{}) {
	*h = append(*h, x.(eto))
}
func (h *etoes) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}