← Home
For problem statement at 1000-1999/1900-1999/1970-1979/1970/problemB1.txt this is a correct solution, but verifier at 1000-1999/1900-1999/1970-1979/1970/verifierB1.go ends with case 1 failed: expected:
YES
1 1
2 2
3 3
4 4
1 1 1 3
got:
YES
1 1
2 2
3 3
4 4
1 3 1 3
input:
4
0 2 4 2
exit status 1 can you fix the verifier? package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Split(bufio.ScanWords)
	writer := bufio.NewWriter(os.Stdout)
	defer writer.Flush()

	if !scanner.Scan() {
		return
	}
	n, _ := strconv.Atoi(scanner.Text())

	a := make([]int, n)
	for i := 0; i < n; i++ {
		scanner.Scan()
		a[i], _ = strconv.Atoi(scanner.Text())
	}

	writer.WriteString("YES\n")
	for i := 1; i <= n; i++ {
		s := strconv.Itoa(i)
		writer.WriteString(s + " " + s + "\n")
	}

	for i := 0; i < n; i++ {
		d := a[i] / 2
		target := (i + 1) + d
		if target > n {
			target = (i + 1) - d
		}
		if i > 0 {
			writer.WriteByte(' ')
		}
		writer.WriteString(strconv.Itoa(target))
	}
	writer.WriteByte('\n')
}