#511382 (Go) No.837 Noelちゃんと星々2

• 問題: No.837 Noelちゃんと星々2
• ユーザー: ccppjsrb
• 提出日時: 2020-07-13 23:50:52
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 59 ms / 2,000 ms
• コード長: 1,945 bytes
• コンパイル時間: 10,780 ms
• コンパイル使用メモリ: 226,432 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-11 14:29:08
• 合計ジャッジ時間: 12,432 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

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

ソースコード

package main

import (
	"bufio"
	"fmt"
	"math"
	"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) {
	n := getNextInt(scanner)
	yy := make(int64s, n)
	for i := 0; i < n; i++ {
		yy[i] = getNextInt64(scanner)
	}
	sort.SliceStable(yy, yy.less)
	if yy[0] == yy[n-1] {
		fmt.Fprintln(writer, 1)
		return
	}
	ss := make(int64s, n+1)
	for i := 0; i < n; i++ {
		ss[i+1] = ss[i] + yy[i]
	}
	var ans int64
	ans = math.MaxInt64
	for i := 1; i < n; i++ {
		lsum := yy[i/2]*int64(i/2) - ss[i/2] + ss[i] - ss[i/2] - yy[i/2]*int64(i-i/2)
		rsum := yy[i+(n-i)/2]*int64((n-i)/2) - (ss[i+(n-i)/2] - ss[i]) + (ss[n] - ss[i+(n-i)/2] - yy[i+(n-i)/2]*int64(n-i-(n-i)/2))
		if ans > lsum+rsum {
			ans = lsum + rsum
		}
	}
	fmt.Fprintln(writer, ans)
}

type int64s []int64

func (s int64s) less(i, j int) bool {
	return s[i] < s[j]
}