CPMagical CP Library

Problem solution · Go

Codeforces 1805D — A Wide, Wide Graph

Codeforces 1805D — A Wide, Wide Graph: a Go solution using depth-first search. Learn the idea, check the complexity, and read the full code, with credit to EndlessCheng Codeforces Go.

Technique
Depth-first search
Source
EndlessCheng Codeforces Go
Length
67 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Depth-first search

For Codeforces 1805D — A Wide, Wide Graph, the implementation follows one branch at a time, making it suitable for components, trees, backtracking, or dependency exploration.

  1. Define the state carried into one recursive or stack frame.
  2. Mark or choose the current state before exploring children.
  3. Combine child results or undo the choice when the branch finishes.

Code notes

  • 67 lines of Go from the credited upstream file 1805D.go.
  • The implementation visibly relies on sequence storage.
  • No explicit loop blocks detected, together with recursive traversal.

Complexity

Count unique states for graph traversal; for backtracking, count the branching factor and maximum depth.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from EndlessCheng Codeforces Go by Σndless (EndlessCheng) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCodeforces 1805D — A Wide, Wide Graph · GoGo
Use this to learn the idea, then write your own version.
package main import (	"bufio"	. "fmt"	"io"	"slices") // https://github.com/EndlessChengfunc cf1805D(in io.Reader, _w io.Writer) {	out := bufio.NewWriter(_w)	defer out.Flush()	var n int	Fscan(in, &n)	g := make([][]int, n)	for range n - 1 {		var v, w int		Fscan(in, &v, &w)		v--		w--		g[v] = append(g[v], w)		g[w] = append(g[w], v)	} 	tmp := make([]int, n)	maxD, u := -1, 0	var dfs func(int, int, int)	dfs = func(v, fa, d int) {		tmp[v] = d		if d > maxD {			maxD, u = d, v		}		for _, w := range g[v] {			if w != fa {				dfs(w, v, d+1)			}		}	} 	dfs(0, -1, 0) 	maxD = -1	dfs(u, -1, 0)	d1 := slices.Clone(tmp) 	maxD = -1	dfs(u, -1, 0)	d2 := tmp 	s := make([]int, n+1)	for i, d := range d1 {		if i != u { // u 所在的连通块算在下面的 sum := 1 中			// 当 k > max(d1[i], d2[i]) 时，i 是孤立点			s[max(d, d2[i])+1]++ 		}	} 	sum := 1	for i := 1; i <= n; i++ {		sum += s[i]		Fprint(out, sum, " ")	}} //func main() { cf1805D(bufio.NewReader(os.Stdin), os.Stdout) }

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗