Problem:
Score : 700 points

Problem Statement

Tonight, in your favourite cinema they are giving the movie Joker and all seats are occupied. In the cinema there are N rows with N seats each, forming an N\times N square. We denote with 1, 2,\dots, N the viewers in the first row (from left to right); with N+1, \dots, 2N the viewers in the second row (from left to right); and so on until the last row, whose viewers are denoted by N^2-N+1,\dots, N^2.

At the end of the movie, the viewers go out of the cinema in a certain order: the i-th viewer leaving her seat is the one denoted by the number P_i. The viewer P_{i+1} waits until viewer P_i has left the cinema before leaving her seat.
To exit from the cinema, a viewer must move from seat to seat until she exits the square of seats (any side of the square is a valid exit). A viewer can move from a seat to one of its 4 adjacent seats (same row or same column).
While leaving the cinema, it might be that a certain viewer x goes through a seat currently occupied by viewer y; in that case viewer y will hate viewer x forever. Each viewer chooses the way that minimizes the number of viewers that will hate her forever.

Compute the number of pairs of viewers (x, y) such that y will hate x forever.

Constraints

2 \le N \le 500

The sequence P_1, P_2, \dots, P_{N^2} is a permutation of \{1, 2, \dots, N^2\}.

Input

The input is given from Standard Input in the format

N
P_1 P_2 \cdots P_{N^2}

Output

If ans is the number of pairs of viewers described in the statement, you should print on Standard Output

ans

Sample Input 1

3
1 3 7 9 5 4 8 6 2

Sample Output 1

1

Before the end of the movie, the viewers are arranged in the cinema as follows:

1 2 3
4 5 6
7 8 9

The first four viewers leaving the cinema (1, 3, 7, 9) can leave the cinema without going through any seat, so they will not be hated by anybody.

Then, viewer 5 must go through one of the seats where viewers 2, 4, 6, 8 are currently seated while leaving the cinema; hence he will be hated by at least one of those viewers.

Finally the remaining viewers can leave the cinema (in the order 4, 8, 6, 2) without going through any occupied seat (actually, they can leave the cinema without going through any seat at all).

Sample Input 2

4
6 7 1 4 13 16 10 9 5 11 12 14 15 2 3 8

Sample Output 2

3

Sample Input 3

6
11 21 35 22 7 36 27 34 8 20 15 13 16 1 24 3 2 17 26 9 18 32 31 23 19 14 4 25 10 29 28 33 12 6 5 30

Sample Output 3

11

Solution in Rust (1.42.0) (judge verdict: Time Limit Exceeded)

use std::io;
use std::str::FromStr;

fn input<T:FromStr>() -> T {
    let mut line: String = String::new();
    io::stdin().read_line(&mut line);
    line.trim().parse().ok().unwrap()
}

fn input_vec() -> Vec<u64> {
    let mut line: String = String::new();
    io::stdin().read_line(&mut line);
    line.split_whitespace().map(|s| s.parse().unwrap()).collect()
}
use std::cmp::Ordering;
use std::collections::BinaryHeap;
use std::usize;

#[derive(Copy, Clone, Eq, PartialEq)]
struct State {
    cost: usize,
    position: usize,
}

impl Ord for State {
    fn cmp(&self, other: &State) -> Ordering {
        other.cost.cmp(&self.cost)
            .then_with(|| self.position.cmp(&other.position))
    }
}

impl PartialOrd for State {
    fn partial_cmp(&self, other: &State) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

#[derive(Clone)]
struct Edge {
    node: usize,
    cost: usize,
}

// Dijkstra's shortest path algorithm.
fn shortest_path(adj_list: &Vec<Vec<Edge>>, start: usize) -> Vec<usize> {
    // dist[node] = current shortest distance from `start` to `node`
    let mut dist: Vec<_> = (0..adj_list.len()).map(|_| usize::MAX).collect();

    let mut heap = BinaryHeap::new();

    dist[start] = 0;
    heap.push(State { cost: 0, position: start });

    while let Some(State { cost, position }) = heap.pop() {
        if cost > dist[position] { continue; }

        for edge in &adj_list[position] {
            let next = State { cost: cost + edge.cost, position: edge.node };
            if next.cost < dist[next.position] {
                heap.push(next);
                dist[next.position] = next.cost;
            }
        }
    }
    dist
}

fn idx(y: usize, x: usize, w: usize) -> usize {
    y * w + x
}

fn main() {
    let n: usize = input();
    let p_vec = input_vec();
    
    let mut grid: Vec<usize> = Vec::new();
    grid.append(&mut vec![0; n + 2]);
    for i in 0..n {
        grid.push(0);
        grid.append(&mut vec![1; n]);
        grid.push(0);
    }
    grid.append(&mut vec![0; n + 2]);
    // println!("{:?}", grid);

    let mut edges: Vec<Vec<Edge>> = vec![Vec::new(); (n + 2) * (n + 2)];
    for col_i in 1..(n+1) {
        for row_i in 1..(n+1) {
            edges[idx(col_i, row_i, n + 2)].push(Edge {node: idx(col_i, row_i + 1, n + 2), cost: grid[idx(col_i, row_i + 1, n + 2)]});
            edges[idx(col_i, row_i, n + 2)].push(Edge {node: idx(col_i, row_i - 1, n + 2), cost: grid[idx(col_i, row_i - 1, n + 2)]});
            edges[idx(col_i, row_i, n + 2)].push(Edge {node: idx(col_i + 1, row_i, n + 2), cost: grid[idx(col_i + 1, row_i, n + 2)]});
            edges[idx(col_i, row_i, n + 2)].push(Edge {node: idx(col_i - 1, row_i, n + 2), cost: grid[idx(col_i - 1, row_i, n + 2)]});
        }
    }
    // for edge in &edges[idx(1, 1, n+2)] {
    //     println!("{}, {}", edge.node, edge.cost);
    // }
    // for edge in &edges[idx(n, n, n+2)] {
    //     println!("{}, {}", edge.node, edge.cost);
    // }

    let mut sum = 0;
    for p in p_vec {
        let converted_idx = idx((p - 1) as usize / n + 1, (p - 1) as usize % n + 1, n + 2);
        // println!("{} -> {}", p, converted_idx);
        let dists = shortest_path(&edges, converted_idx);
        // println!("{:?}", dists);
        let mut min = 1_000_000_000;
        // println!("{:?}", dists);
        for i in 1..n+1 {
            if dists[idx(0, i, n + 2)] < min {
                min = dists[idx(0, i, n + 2)];
            }
            if dists[idx(i, 0, n + 2)] < min {
                min = dists[idx(i, 0, n + 2)];
            }
            if dists[idx(n+1, i, n + 2)] < min {
                min = dists[idx(n+1, i, n + 2)];
            }
            if dists[idx(i, n+1, n + 2)] < min {
                min = dists[idx(i, n+1, n + 2)];
            }
        }
        // println!("{}, {}", p, min);
        sum += min;
        // edges[converted_idx] = Vec::new();
        edges[converted_idx + 1].push(Edge{node: converted_idx, cost: 0});
        edges[converted_idx - 1].push(Edge{node: converted_idx, cost: 0});
        edges[converted_idx - n - 2].push(Edge{node: converted_idx, cost: 0});
        edges[converted_idx + n + 2].push(Edge{node: converted_idx, cost: 0});
    }
    println!("{}", sum);

}