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) { t := getNextInt(scanner) for i := 0; i < t; i++ { testcase(scanner, writer) } } func testcase(scanner *bufio.Scanner, writer *bufio.Writer) { n := getNextInt(scanner) m := map[int]int{} for i := 0; i < n; i++ { l := getNextInt(scanner) m[l]++ } bb := &bamboo{} for _, c := range m { heap.Push(bb, c) } var ans int for bb.Len() >= 3 { ans++ b1 := heap.Pop(bb).(int) b2 := heap.Pop(bb).(int) b3 := heap.Pop(bb).(int) b1-- b2-- b3-- if b1 > 0 { heap.Push(bb, b1) } if b2 > 0 { heap.Push(bb, b2) } if b3 > 0 { heap.Push(bb, b3) } } fmt.Fprintln(writer, ans) } type bamboo []int func (h bamboo) Len() int { return len(h) } func (h bamboo) Less(i, j int) bool { return h[i] > h[j] } func (h bamboo) Swap(i, j int) { h[i], h[j] = h[j], h[i] } func (h *bamboo) Push(x interface{}) { *h = append(*h, x.(int)) } func (h *bamboo) Pop() interface{} { old := *h n := len(old) x := old[n-1] *h = old[0 : n-1] return x }