#487707 (Go) No.872 All Tree Path

• 問題: No.872 All Tree Path
• ユーザー: ccppjsrb
• 提出日時: 2020-05-28 16:06:12
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 215 ms / 3,000 ms
• コード長: 2,181 bytes
• コンパイル時間: 12,045 ms
• コンパイル使用メモリ: 230,680 KB
• 実行使用メモリ: 53,248 KB
• 最終ジャッジ日時: 2024-04-21 05:41:28
• 合計ジャッジ時間: 14,783 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	215 ms; 22,144 KB
testcase_01	AC	210 ms; 22,144 KB
testcase_02	AC	213 ms; 22,144 KB
testcase_03	AC	164 ms; 53,248 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	206 ms; 22,144 KB
testcase_06	AC	209 ms; 22,272 KB
testcase_07	AC	210 ms; 22,144 KB
testcase_08	AC	14 ms; 5,376 KB
testcase_09	AC	13 ms; 5,376 KB
testcase_10	AC	14 ms; 5,376 KB
testcase_11	AC	13 ms; 5,376 KB
testcase_12	AC	14 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

ソースコード

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}
func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	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 getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(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 := 0
	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 1
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}
	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	solve(scanner, writer)
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	g := newGraph(n)
	for i := 0; i < n-1; i++ {
		u := getNextInt(scanner) - 1
		v := getNextInt(scanner) - 1
		w := getNextInt(scanner)
		g.appendEdge(u, v, i, w)
		g.appendEdge(v, u, i, w)
	}
	g.dfs(0, -1)
	fmt.Fprintln(writer, g.ans*2)
}

type graph struct {
	v   []*vertex
	e   [][]*edge
	ans int64
}

func newGraph(n int) *graph {
	return &graph{
		v: make([]*vertex, n),
		e: make([][]*edge, n),
	}
}
func (g *graph) dfs(c, p int) int {
	cnt := 1
	for _, e := range g.e[c] {
		if e.to == p {
			continue
		}
		ch := g.dfs(e.to, c)
		cnt += ch
		g.ans += int64(ch) * int64(len(g.v)-ch) * int64(e.w)
	}
	return cnt
}
func (g *graph) appendEdge(from, to, id, w int) {
	g.e[from] = append(g.e[from], &edge{
		to: to,
		id: id,
		w:  w,
	})
}

type vertex struct {
}
type edge struct {
	to, id, w int
}