Spiraali

import java.util.Scanner;

public class Kolmas {

    public static int n;
    public static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {
        String input = sc.nextLine();
        n = Integer.parseInt(input.split(" ")[0]);
        int t = Integer.parseInt(input.split(" ")[1]);

        int[][] tries = new int[t][2];
        for (int i = 0; i < t; i++) {
            String in = sc.nextLine();
            tries[i][1] = Integer.parseInt(in.split(" ")[0]);
            tries[i][0] = Integer.parseInt(in.split(" ")[1]);
        }

        for (int[] xy : tries) {
            System.out.println(func(xy[0], xy[1]));
        }
    }

    public static int func(int x, int y) {
        int num = 0;
        int spiralsIn = Math.min(Math.min(x, y), Math.min(n-x+1, n-y+1));
        int spiralsOut=spiralsIn-1;
        for (int i = 0; i < spiralsOut; i++) {
            num+=4*(n-1-2*i);
        }
        if (x == spiralsIn) {
            num+=y-spiralsOut;
        } else if (y == n-spiralsOut) {
            num+=(n-1) - 2*spiralsOut + (x-spiralsOut);
        } else if (x == n-spiralsOut) {
            num+=2*((n-1) - 2*spiralsOut) + (n - (y-1) - spiralsOut);
        } else {
            num+=3*((n-1) - 2*spiralsOut) + (n - (x-1) - spiralsOut);
        }
        return num;
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED