Submission #59169332

---

Source Code Expand

use proconio::input;

pub fn main() {
    input! {
        n: usize,
        m: usize,
        abm: [(usize, usize); m]
    }
    let mut visited = std::collections::HashSet::new();
    for ab in abm.clone() {
        visited.insert(ab);
    }
    for (a, b) in abm {
        if a + 2 <= n && b + 1 <= n {
            visited.insert((a + 2, b + 1));
        }
        if a + 2 <= n && b - 1 >= 1 {
            visited.insert((a + 2, b - 1));
        }
        if a.saturating_sub(2) >= 1 && b + 1 <= n {
            visited.insert((a.saturating_sub(2), b + 1));
        }
        if a.saturating_sub(2) >= 1 && b - 1 >= 1 {
            visited.insert((a.saturating_sub(2), b - 1));
        }
        if a + 1 <= n && b + 2 <= n {
            visited.insert((a + 1, b + 2));
        }
        if a + 1 <= n && b.saturating_sub(2) >= 1 {
            visited.insert((a + 1, b.saturating_sub(2)));
        }
        if a - 1 >= 1 && b + 2 <= n {
            visited.insert((a - 1, b + 2));
        }
        if a - 1 >= 1 && b.saturating_sub(2) >= 1 {
            visited.insert((a - 1, b.saturating_sub(2)));
        }
    }
    println!("{}", n * n - visited.len());
}

Submission Info

Judge Result