結果
問題 | No.763 Noelちゃんと木遊び |
ユーザー |
![]() |
提出日時 | 2020-08-18 17:08:30 |
言語 | Go (1.23.4) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 2,105 bytes |
コンパイル時間 | 12,985 ms |
コンパイル使用メモリ | 242,868 KB |
実行使用メモリ | 28,172 KB |
最終ジャッジ日時 | 2024-10-12 02:56:06 |
合計ジャッジ時間 | 15,314 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
package mainimport ("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.Stdinwfp := os.Stdoutextra := 0if 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)g := newGraph(n)for i := 0; i < n-1; i++ {u := getNextInt(scanner) - 1v := getNextInt(scanner) - 1g.appendEdge(u, v, i)g.appendEdge(v, u, i)}g.dfs(0, -1)fmt.Fprintln(writer, max(g.v[0].dp[0], g.v[0].dp[1]))}type vertex struct {dp [2]int}type edge struct {to, id int}type graph struct {v []vertexe [][]edge}func newGraph(n int) graph {return graph{v: make([]vertex, n),e: make([][]edge, n),}}func (g *graph) appendEdge(from, to, id int) {g.e[from] = append(g.e[from], edge{to: to,id: id,})}func (g *graph) dfs(i, p int) {g.v[i].dp[1] = 1for _, e := range g.e[i] {if e.to == p {continue}g.dfs(e.to, i)g.v[i].dp[0] += max(g.v[e.to].dp[0], g.v[e.to].dp[1])g.v[i].dp[1] += max(g.v[e.to].dp[0], g.v[e.to].dp[1]-1)}}func max(a, b int) int {if a < b {return b}return a}