package main import ( "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.Stdin wfp := os.Stdout extra := 0 if 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) aa := makeGrid(n, n) bb := make([][][2]int, n) var ans int for i := 0; i < n; i++ { for j := 0; j < n; j++ { aa[i][j] = getNextInt(scanner) - 1 bb[aa[i][j]] = append(bb[aa[i][j]], [2]int{i, j}) ans += j } } for i := 0; i < n; i++ { ll := make([]int, n) rr := make([]int, n) for j := 0; j < n; j++ { if bb[i][j][0]+bb[i][j][1]+1 >= n { continue } ll[bb[i][j][0]+bb[i][j][1]+1]++ } for j := 0; j < n; j++ { if bb[i][j][0]-bb[i][j][1]-1 < 0 { continue } rr[bb[i][j][0]-bb[i][j][1]-1]++ } for k := 0; k < 2; k++ { for j := 1; j < n; j++ { ll[j] += ll[j-1] } for j := n - 2; j >= 0; j-- { rr[j] += rr[j+1] } } mn := ll[0] + rr[0] for j := 1; j < n; j++ { if mn > ll[j]+rr[j] { mn = ll[j] + rr[j] } } ans += mn } fmt.Fprintln(writer, ans) } func makeGrid(h, w int) [][]int { index := make([][]int, h, h) data := make([]int, h*w, h*w) for i := 0; i < h; i++ { index[i] = data[i*w : (i+1)*w] } return index } func max(a, b int) int { if a < b { return b } return a }