← Home
For problem statement at 2000-2999/2100-2199/2110-2119/2111/problemC.txt this is a correct solution, but verifier at 2000-2999/2100-2199/2110-2119/2111/verifierC.go ends with All 143 tests passed. can you fix the verifier? package main

import (
	"bufio"
	"fmt"
	"os"
)

type FastScanner struct {
	r *bufio.Reader
}

func NewFastScanner() *FastScanner {
	return &FastScanner{r: bufio.NewReaderSize(os.Stdin, 1<<20)}
}

func (fs *FastScanner) NextInt() int {
	sign, val := 1, 0
	c, _ := fs.r.ReadByte()
	for (c < '0' || c > '9') && c != '-' {
		c, _ = fs.r.ReadByte()
	}
	if c == '-' {
		sign = -1
		c, _ = fs.r.ReadByte()
	}
	for c >= '0' && c <= '9' {
		val = val*10 + int(c-'0')
		c, _ = fs.r.ReadByte()
	}
	return sign * val
}

func main() {
	in := NewFastScanner()
	out := bufio.NewWriterSize(os.Stdout, 1<<20)
	defer out.Flush()

	t := in.NextInt()
	for ; t > 0; t-- {
		n := in.NextInt()
		a := make([]int, n)
		for i := 0; i < n; i++ {
			a[i] = in.NextInt()
		}
		maxLen := make([]int, n+1)
		if n > 0 {
			curVal := a[0]
			curLen := 1
			for i := 1; i < n; i++ {
				if a[i] == curVal {
					curLen++
				} else {
					if curLen > maxLen[curVal] {
						maxLen[curVal] = curLen
					}
					curVal = a[i]
					curLen = 1
				}
			}
			if curLen > maxLen[curVal] {
				maxLen[curVal] = curLen
			}
		}
		ans := int64(1<<62 - 1)
		for v := 1; v <= n; v++ {
			if maxLen[v] > 0 {
				cost := int64(v) * int64(n-maxLen[v])
				if cost < ans {
					ans = cost
				}
			}
		}
		fmt.Fprintln(out, ans)
	}
}