Spiraali

import java.util.HashMap;
import java.util.Map.Entry;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) { //remove comments before upload
        Scanner input = new Scanner(System.in);
        
        int size = input.nextInt(); //size
        int tests = input.nextInt(); //tests
        
        for(int y = 1; y < tests+1; y++) {
        for(int x = 1; x < tests+1; x++) {
        	
        	int layer = 0;
        	
        	if(x > y && y <= size/2 && x+y-1<size) {
        		layer = y;
        	} else if(x <= size/2 && size-y >= x){
        		layer = x;
        	} else if (x > y) {
        		layer = x;
        	}else {
        		layer = y;
        	}

        	System.out.println("og layer " + layer);
        	
        	if(layer > size/2) layer = size/2-(layer-size/2)+1;
        	
        	int width = (size-(layer-1)*2);
        	System.out.println("width " + width + " layer " + layer);
        	
        	int result = 0;
        	
        	int tArea = 0;
        	
        	for(int l = 0+1; l < layer; l++) {
        		tArea += (size-(layer-1-l)*2)*4-4;
        	}
        	
        	if(x == layer) { //left d
        		tArea += width;
        		tArea -= width-(y-(layer-1));
        		System.out.println("left");
        	}else if(x == size-layer+1 && x != y) {//right d
            	tArea += width*3-1;
            	tArea -= layer-1;
        		tArea -= y-(layer-1)*2;
        		System.out.println("right");
        	}else if(y == layer) {//top d
        		tArea += width*4-2;
        		tArea -= x-(layer-1)*2;
        		tArea -= layer-1;
        		System.out.println("top");
        	}else if(y == size-layer+1) {//bottom d
        		tArea -= width-(x-(layer-1));
        		tArea += width*2-1;
        		System.out.println("bottom");
        	}
        	
        	//current layer = lower of x or y
        	//layer width = (size-(layer-1)*2)
        	//layer area = (size-(layer-1)*2)*4-4
        	//go through earlier spirals to get total
        	//then remove extra that hasnt been reached yet
        	
        	System.out.println(tArea);
        }
        }
        input.close();
    }
	
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED