Spiraali

use std::cmp::min;
use std::io::{BufRead, BufReader};

fn left(s: i64, _nc: i64, l: i64, x2: i64, y2: i64) -> i64 {
    let x1 = l + 1;
    let y1 = x1;
    return (s) + ((x2 - x1) + (y2 - y1));
}

fn right(s: i64, nc: i64, l: i64, x2: i64, y2: i64) -> i64 {
    let x1 = l + 1;
    let y1 = x1;
    return (s + nc) - ((x2 - x1) + (y2 - y1));
}

fn get_start(n: i64, l: i64) -> i64 {
    let mut total = 0;
    for i in 0..l {
        total += 4 * (n - (1 + i * 2))
    }
    return total;
}

fn main() {
    let mut stdin = BufReader::new(std::io::stdin());
    let mut line = String::with_capacity(32);
    stdin.read_line(&mut line).unwrap();
    let mut split = line.split_whitespace();
    let n: i64 = split.next().unwrap().parse().unwrap();
    let t: i64 = split.next().unwrap().parse().unwrap();
    for _i in 0..t {
        let mut line = String::with_capacity(128);
        stdin.read_line(&mut line).unwrap();
        let mut split = line.split_whitespace();
        let y: i64 = split.next().unwrap().parse().unwrap();
        let x: i64 = split.next().unwrap().parse().unwrap();

        let l = min(min(y - 1, x - 1), min(n - 1 - (y - 1), n - 1 - (x - 1)));
        let l_size = n - l * 2;
        let nc = 4 * (n - (1 + l * 2));
        let s = get_start(n, l);
        let is_right = x - l == l_size || (y == l + 1 && x != l + 1);

        let res = if is_right {
            right(s, nc, l, x, y)
        } else {
            left(s, nc, l, x, y)
        };
		println!("{}", res + 1);
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED