For problem statement at 1000-1999/1000-1099/1060-1069/1062/problemE.txt this is a correct solution, but verifier at 1000-1999/1000-1099/1060-1069/1062/verifierE.go ends with case 1 failed
expected: 1 1
 got: 1 0
input:
1 1

1 1
exit status 1 can you fix the verifier? package main

import (
	"io"
	"os"
	"strconv"
)

var (
	n, q       int
	K          int
	tin        []int
	depth      []int
	lg         []int
	up         [][]int
	mn, mx, lc [][]int
)

func lca(a, b int) int {
	if depth[a] < depth[b] {
		a, b = b, a
	}
	diff := depth[a] - depth[b]
	bit := 0
	for diff > 0 {
		if diff&1 == 1 {
			a = up[bit][a]
		}
		diff >>= 1
		bit++
	}
	if a == b {
		return a
	}
	for k := K - 1; k >= 0; k-- {
		if up[k][a] != up[k][b] {
			a = up[k][a]
			b = up[k][b]
		}
	}
	return up[0][a]
}

func mergeLCA(a, b int) int {
	if a == 0 {
		return b
	}
	if b == 0 {
		return a
	}
	return lca(a, b)
}

func rangeMin(l, r int) int {
	k := lg[r-l+1]
	a := mn[k][l]
	b := mn[k][r-(1<<k)+1]
	if tin[a] < tin[b] {
		return a
	}
	return b
}

func rangeMax(l, r int) int {
	k := lg[r-l+1]
	a := mx[k][l]
	b := mx[k][r-(1<<k)+1]
	if tin[a] > tin[b] {
		return a
	}
	return b
}

func rangeLCA(l, r int) int {
	if l > r {
		return 0
	}
	k := lg[r-l+1]
	return lca(lc[k][l], lc[k][r-(1<<k)+1])
}

func main() {
	data, _ := io.ReadAll(os.Stdin)
	idx := 0
	nextInt := func() int {
		for idx < len(data) && (data[idx] < '0' || data[idx] > '9') {
			idx++
		}
		val := 0
		for idx < len(data) && data[idx] >= '0' && data[idx] <= '9' {
			val = val*10 + int(data[idx]-'0')
			idx++
		}
		return val
	}

	n = nextInt()
	q = nextInt()

	parent := make([]int, n+1)
	childCount := make([]int, n+1)
	for i := 2; i <= n; i++ {
		p := nextInt()
		parent[i] = p
		childCount[p]++
	}

	children := make([][]int, n+1)
	for i := 1; i <= n; i++ {
		if childCount[i] > 0 {
			children[i] = make([]int, 0, childCount[i])
		}
	}
	for i := 2; i <= n; i++ {
		p := parent[i]
		children[p] = append(children[p], i)
	}

	K = 0
	for (1 << K) <= n {
		K++
	}

	tin = make([]int, n+1)
	depth = make([]int, n+1)
	up = make([][]int, K)
	for k := 0; k < K; k++ {
		up[k] = make([]int, n+1)
		up[k][1] = 1
	}

	timer := 1
	tin[1] = 1
	stack := make([]int, 1, n)
	stack[0] = 1
	ptr := make([]int, n+1)

	for len(stack) > 0 {
		u := stack[len(stack)-1]
		if ptr[u] < len(children[u]) {
			v := children[u][ptr[u]]
			ptr[u]++
			depth[v] = depth[u] + 1
			up[0][v] = u
			for k := 1; k < K; k++ {
				up[k][v] = up[k-1][up[k-1][v]]
			}
			timer++
			tin[v] = timer
			stack = append(stack, v)
		} else {
			stack = stack[:len(stack)-1]
		}
	}

	lg = make([]int, n+1)
	for i := 2; i <= n; i++ {
		lg[i] = lg[i>>1] + 1
	}

	mn = make([][]int, K)
	mx = make([][]int, K)
	lc = make([][]int, K)
	for k := 0; k < K; k++ {
		mn[k] = make([]int, n+1)
		mx[k] = make([]int, n+1)
		lc[k] = make([]int, n+1)
	}

	for i := 1; i <= n; i++ {
		mn[0][i] = i
		mx[0][i] = i
		lc[0][i] = i
	}

	for k := 1; k < K; k++ {
		half := 1 << (k - 1)
		span := 1 << k
		limit := n - span + 1
		prevMn := mn[k-1]
		prevMx := mx[k-1]
		prevLc := lc[k-1]
		curMn := mn[k]
		curMx := mx[k]
		curLc := lc[k]
		for i := 1; i <= limit; i++ {
			a := prevMn[i]
			b := prevMn[i+half]
			if tin[a] < tin[b] {
				curMn[i] = a
			} else {
				curMn[i] = b
			}
			a = prevMx[i]
			b = prevMx[i+half]
			if tin[a] > tin[b] {
				curMx[i] = a
			} else {
				curMx[i] = b
			}
			curLc[i] = lca(prevLc[i], prevLc[i+half])
		}
	}

	out := make([]byte, 0, q*16)

	for ; q > 0; q-- {
		l := nextInt()
		r := nextInt()

		x := rangeMin(l, r)
		y := rangeMax(l, r)

		l1 := mergeLCA(rangeLCA(l, x-1), rangeLCA(x+1, r))
		d1 := depth[l1]

		l2 := mergeLCA(rangeLCA(l, y-1), rangeLCA(y+1, r))
		d2 := depth[l2]

		if d1 >= d2 {
			out = strconv.AppendInt(out, int64(x), 10)
			out = append(out, ' ')
			out = strconv.AppendInt(out, int64(d1), 10)
			out = append(out, '\n')
		} else {
			out = strconv.AppendInt(out, int64(y), 10)
			out = append(out, ' ')
			out = strconv.AppendInt(out, int64(d2), 10)
			out = append(out, '\n')
		}
	}

	os.Stdout.Write(out)
}