#560330 (Go) No.972 選び方のスコア

• 問題: No.972 選び方のスコア
• ユーザー: ccppjsrb
• 提出日時: 2020-09-30 12:46:55
• 言語: Go (1.22.1)
• 結果: WA
• 実行時間: -
• コード長: 2,143 bytes
• コンパイル時間: 12,492 ms
• コンパイル使用メモリ: 231,784 KB
• 実行使用メモリ: 5,888 KB
• 最終ジャッジ日時: 2024-07-05 19:40:21
• 合計ジャッジ時間: 16,222 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	73 ms; 5,888 KB
testcase_01	AC	91 ms; 5,888 KB
testcase_02	AC	85 ms; 5,760 KB
testcase_03	AC	41 ms; 5,376 KB
testcase_04	AC	84 ms; 5,888 KB
testcase_05	WA	-
testcase_06	AC	76 ms; 5,888 KB
testcase_07	AC	53 ms; 5,376 KB
testcase_08	AC	38 ms; 5,888 KB
testcase_09	AC	38 ms; 5,760 KB
testcase_10	AC	36 ms; 5,888 KB
testcase_11	AC	37 ms; 5,888 KB
testcase_12	AC	40 ms; 5,888 KB
testcase_13	AC	39 ms; 5,888 KB
testcase_14	AC	39 ms; 5,888 KB
testcase_15	AC	47 ms; 5,888 KB
testcase_16	AC	46 ms; 5,888 KB
testcase_17	AC	45 ms; 5,888 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	72 ms; 5,888 KB
testcase_20	AC	71 ms; 5,888 KB
testcase_21	AC	72 ms; 5,888 KB
testcase_22	WA	-
testcase_23	AC	71 ms; 5,888 KB
testcase_24	AC	72 ms; 5,888 KB
testcase_25	AC	1 ms; 5,376 KB
testcase_26	AC	1 ms; 5,376 KB
testcase_27	AC	1 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	1 ms; 5,376 KB
testcase_32	AC	1 ms; 5,376 KB
testcase_33	AC	1 ms; 5,376 KB
testcase_34	AC	1 ms; 5,376 KB

ソースコード

package main

import (
	"bufio"
	"fmt"
	"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)
	aa := make([]int64, n)
	ss := make([]int64, n+1)
	for i := 0; i < n; i++ {
		aa[i] = getNextInt64(scanner)
	}
	sort.Slice(aa, func(i, j int) bool {
		return aa[i] < aa[j]
	})
	for i := 0; i < n; i++ {
		ss[i+1] = ss[i] + aa[i]
	}
	var ans int64
	for i := 0; i < n; i++ {
		l := 0
		r := min(i, n-i-1) + 1
		for l+1 < r {
			m := (l + r) >> 1
			if aa[i-m]+aa[n-1-m] < aa[i]*2 {
				r = m
				continue
			}
			l = m
		}
		s := ss[i+1] - ss[i-l] + ss[n] - ss[n-l] - aa[i]*int64(l<<1+1)
		if ans < s {
			ans = s
		}
		if i+1 == n {
			break
		}
		l = 0
		r = min(i, n-i-2) + 1
		for l+1 < r {
			m := (l + r) >> 1
			if aa[i-m]+aa[n-1-m] < aa[i]+aa[i+1] {
				r = m
				continue
			}
			l = m
		}
		s = ss[i+1] - ss[i-l] + ss[n] - ss[n-l] - (aa[i]+aa[i+1])*int64(l+1)
		if ans < s {
			ans = s
		}
	}
	fmt.Fprintln(writer, ans)
}
func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}