#549349 (Go) No.1163 I want to be a high achiever

• 問題: No.1163 I want to be a high achiever
• ユーザー: ccppjsrb
• 提出日時: 2020-09-06 23:53:40
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 35 ms / 2,000 ms
• コード長: 2,183 bytes
• コンパイル時間: 12,520 ms
• コンパイル使用メモリ: 244,432 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-06 21:40:40
• 合計ジャッジ時間: 13,298 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	30 ms; 5,376 KB
testcase_05	AC	33 ms; 5,376 KB
testcase_06	AC	27 ms; 5,376 KB
testcase_07	AC	34 ms; 5,376 KB
testcase_08	AC	34 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	30 ms; 5,376 KB
testcase_11	AC	33 ms; 5,376 KB
testcase_12	AC	30 ms; 5,376 KB
testcase_13	AC	28 ms; 5,376 KB
testcase_14	AC	28 ms; 5,376 KB
testcase_15	AC	34 ms; 5,376 KB
testcase_16	AC	30 ms; 5,376 KB
testcase_17	AC	31 ms; 5,376 KB
testcase_18	AC	34 ms; 5,376 KB
testcase_19	AC	28 ms; 5,376 KB
testcase_20	AC	26 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	32 ms; 5,376 KB
testcase_23	AC	31 ms; 5,376 KB
testcase_24	AC	35 ms; 5,376 KB
testcase_25	AC	30 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	21 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

ソースコード

package main

import (
	"bufio"
	"fmt"
	"math"
	"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) {
	n := getNextInt(scanner)
	x := getNextInt(scanner)
	aa := make([]int, n)
	bb := make([]int, n)
	var sum int
	found := false
	for i := 0; i < n; i++ {
		aa[i] = getNextInt(scanner) - x
		if aa[i] >= 0 {
			found = true
		}
		sum += aa[i]
	}
	for i := 0; i < n; i++ {
		bb[i] = getNextInt(scanner)
	}
	if !found {
		fmt.Fprintln(writer, -1)
		return
	}
	if sum >= 0 {
		fmt.Fprintln(writer, 0)
		return
	}
	mx := 50005
	dp := make([]int, mx)
	for i := 1; i < mx; i++ {
		dp[i] = math.MaxInt32
	}
	for i := 0; i < n; i++ {
		for j := mx - 1; j >= 0; j-- {
			a := -aa[i]
			if a <= 0 {
				continue
			}
			if j-a >= 0 && j-a < mx && dp[j-a] != math.MaxInt32 {
				dp[j] = min(dp[j-a]+bb[i], dp[j])
			}
		}
	}
	var ans int
	ans = math.MaxInt32
	for i := -sum; i < mx; i++ {
		ans = min(ans, dp[i])
	}
	if ans == math.MaxInt32 {
		fmt.Fprintln(writer, -1)
		return
	}
	fmt.Fprintln(writer, ans)
}
func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}