#539626 (Go) No.634 硬貨の枚数1

• 問題: No.634 硬貨の枚数1
• ユーザー: ccppjsrb
• 提出日時: 2020-08-24 12:02:42
• 言語: Go (1.22.1)
• 結果: TLE
• 実行時間: -
• コード長: 1,673 bytes
• コンパイル時間: 13,689 ms
• コンパイル使用メモリ: 233,276 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-24 03:21:51
• 合計ジャッジ時間: 40,453 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 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	AC	1 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	32 ms; 5,376 KB
testcase_15	AC	649 ms; 5,376 KB
testcase_16	AC	447 ms; 5,376 KB
testcase_17	AC	449 ms; 5,376 KB
testcase_18	AC	108 ms; 5,376 KB
testcase_19	AC	3 ms; 5,376 KB
testcase_20	AC	4 ms; 5,376 KB
testcase_21	AC	724 ms; 5,376 KB
testcase_22	AC	1,026 ms; 5,376 KB
testcase_23	AC	97 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 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	2 ms; 5,376 KB
testcase_29	AC	1 ms; 5,376 KB
testcase_30	AC	2 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	85 ms; 5,376 KB
testcase_35	AC	144 ms; 5,376 KB
testcase_36	AC	326 ms; 5,376 KB
testcase_37	AC	209 ms; 5,376 KB
testcase_38	AC	122 ms; 5,376 KB
testcase_39	AC	242 ms; 5,376 KB
testcase_40	AC	287 ms; 5,376 KB
testcase_41	AC	612 ms; 5,376 KB
testcase_42	AC	589 ms; 5,376 KB
testcase_43	AC	169 ms; 5,376 KB
testcase_44	AC	1 ms; 5,376 KB
testcase_45	AC	4 ms; 5,376 KB
testcase_46	AC	4 ms; 5,376 KB
testcase_47	AC	19 ms; 5,376 KB
testcase_48	AC	1 ms; 5,376 KB
testcase_49	AC	1 ms; 5,376 KB
testcase_50	AC	536 ms; 5,376 KB
testcase_51	AC	78 ms; 5,376 KB
testcase_52	AC	1 ms; 5,376 KB
testcase_53	AC	1 ms; 5,376 KB
testcase_54	AC	1 ms; 5,376 KB
testcase_55	AC	1,950 ms; 5,376 KB
testcase_56	AC	1,774 ms; 5,376 KB
testcase_57	AC	1,030 ms; 5,376 KB
testcase_58	AC	1,244 ms; 5,376 KB
testcase_59	AC	524 ms; 5,376 KB
testcase_60	AC	1,380 ms; 5,376 KB
testcase_61	AC	949 ms; 5,376 KB
testcase_62	AC	733 ms; 5,376 KB
testcase_63	AC	1,206 ms; 5,376 KB
testcase_64	TLE	-
testcase_65	AC	276 ms; 5,376 KB
testcase_66	AC	518 ms; 5,376 KB
testcase_67	AC	736 ms; 5,376 KB
testcase_68	AC	1,885 ms; 5,376 KB
testcase_69	AC	744 ms; 5,376 KB
testcase_70	AC	735 ms; 5,376 KB
testcase_71	AC	508 ms; 5,376 KB
testcase_72	AC	508 ms; 5,376 KB
testcase_73	AC	283 ms; 5,376 KB
testcase_74	AC	734 ms; 5,376 KB
testcase_75	AC	1,794 ms; 5,376 KB
testcase_76	AC	2 ms; 5,376 KB
testcase_77	AC	1 ms; 5,376 KB

ソースコード

package main

import (
	"bufio"
	"fmt"
	"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)
	kk := make([]int, 0)
	for i := 1; i*(i+1)/2 < n+1; i++ {
		kk = append(kk, i*(i+1)/2)
	}
	for i := 1; i < 10000; i++ {
		if dfs(i, n, kk) {
			fmt.Fprintln(writer, i)
			return
		}
	}
	fmt.Fprintln(writer, -1)
}
func dfs(c, n int, kk []int) bool {
	if n == 0 {
		return true
	}
	if c == 0 {
		return false
	}
	for i := len(kk) - 1; i >= 0 && n/kk[i] <= c; i-- {
		if dfs(c-1, n-kk[i], kk) {
			return true
		}
	}
	return false
}