#492739 (Go) No.1071 ベホマラー

• 問題: No.1071 ベホマラー
• ユーザー: ccppjsrb
• 提出日時: 2020-06-05 21:57:14
• 言語: Go (1.22.1)
• 結果: WA
• 実行時間: -
• コード長: 2,118 bytes
• コンパイル時間: 12,586 ms
• コンパイル使用メモリ: 226,772 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-05-09 21:02:53
• 合計ジャッジ時間: 14,878 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	0 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	WA	-
testcase_11	AC	41 ms; 5,376 KB
testcase_12	WA	-
testcase_13	AC	85 ms; 5,376 KB
testcase_14	AC	60 ms; 5,376 KB
testcase_15	AC	65 ms; 5,376 KB
testcase_16	WA	-
testcase_17	AC	144 ms; 5,376 KB
testcase_18	AC	143 ms; 5,376 KB
testcase_19	AC	109 ms; 5,376 KB
testcase_20	AC	112 ms; 5,376 KB
testcase_21	AC	12 ms; 5,376 KB
testcase_22	AC	118 ms; 5,376 KB
testcase_23	AC	108 ms; 5,376 KB
testcase_24	AC	74 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
	cnt := 1
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		cnt = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	for i := 0; i < cnt; i++ {
		if i > 0 {
			fmt.Fprintln(writer, "-----------------------------------")
		}
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	k := getNextInt64(scanner)
	x := getNextInt64(scanner)
	y := getNextInt64(scanner)
	aa := make([]int64, n)
	for i := 0; i < n; i++ {
		aa[i] = getNextInt64(scanner)
	}
	sort.SliceStable(aa, func(i, j int) bool {
		return aa[i] < aa[j]
	})
	if x >= y {
		fmt.Fprintln(writer, count(aa[n-1]-1, k)*y)
		return
	}
	var l, r, s1, s2 int64
	l = -1
	r = int64(1e9 + 1)
	for 2 < r-l {
		m1 := l + (r-l)/3
		m2 := r - (r-l)/3
		s1 = m1 * y
		s2 = m2 * y
		for i := 0; i < n; i++ {
			s1 += heal(aa[i], k, x, y, m1)
			s2 += heal(aa[i], k, x, y, m2)
		}
		if s1 > s2 {
			l = m1
			continue
		}
		r = m2
	}
	var ans int64
	for i := 0; i < n; i++ {
		ans += heal(aa[i], k, x, y, l+1)
	}
	fmt.Fprintln(writer, ans+y*(l+1))
}
func count(a, k int64) int64 {
	return (a + k - 1) / k
}
func heal(a, k, x, y, c int64) int64 {
	if (a-1)-k*c <= 0 {
		return 0
	}
	return count((a-1)-k*c, k) * x
}