結果
問題 | No.872 All Tree Path |
ユーザー |
![]() |
提出日時 | 2020-05-28 15:18:55 |
言語 | Go (1.23.4) |
結果 |
AC
|
実行時間 | 145 ms / 3,000 ms |
コード長 | 2,119 bytes |
コンパイル時間 | 12,017 ms |
コンパイル使用メモリ | 237,872 KB |
実行使用メモリ | 79,892 KB |
最終ジャッジ日時 | 2024-10-13 04:11:50 |
合計ジャッジ時間 | 13,535 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
package mainimport ("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.Stdinwfp := os.Stdoutcnt := 0if 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)ee := make([][]edge, n)for i := 0; i < n-1; i++ {u := getNextInt(scanner) - 1v := getNextInt(scanner) - 1w := getNextInt(scanner)appendEdge(u, v, i, w, ee)appendEdge(v, u, i, w, ee)}vv := make([]int, n)var ans int64dfs(0, -1, vv, ee, &ans)fmt.Fprintln(writer, ans*2)}func dfs(c, p int, vv []int, ee [][]edge, ans *int64) int {cnt := 1for _, e := range ee[c] {if e.to == p {continue}children := dfs(e.to, c, vv, ee, ans)*ans += int64(children) * int64(len(vv)-children) * int64(e.w)cnt += children}vv[c] = cntreturn cnt}func appendEdge(from, to, id, w int, ee [][]edge) {ee[from] = append(ee[from], edge{to: to,id: id,w: w,})}type edge struct {to, id, w int}