Hypyt

import java.util.*;

public class hypyt {


	public static void main(String[] args) {

		Scanner input = new Scanner(System.in);

		int t = Integer.parseInt(input.nextLine());
		
		int[] n = new int[t];  // korkeus
		int[] m = new int[t];  //leveys
		
		String[] numerot = new String[t]; // numerot
		
		for (int i = 0; i < t; i++) {
			
			numerot[i] =  input.nextLine();
			
			String[] numberParts = numerot[i].split("\\s+");
			n[i] = Integer.parseInt(numberParts[0]);
			m[i] = Integer.parseInt(numberParts[1]);
		}

		input.close(); 
		
		// Program here


		for (int i = 0; i < t; i++) {	 // tapaus t
		
		int kor = n[i];
		int lev = m[i];
		
		if ((kor == 1) && (lev == 1)) {
			
			continue;
		} 

		if ((kor == 1) && (lev == 2)) {
			
			System.out.println("0 1");
			
			continue;
		} 

		if ((kor == 2) && (lev == 1)) {
			
			System.out.println("-1 0");
			
			continue;
		} 

		if ((kor == 2) && (lev == 2)) {
			
			System.out.println("0 1");
			System.out.println("1 0");
			System.out.println("0 -1");
			
			continue;
		} 
		
		
		// korkeus & leveys > 2
		
		int kpl = kor * lev;
		
		int[] y = new int[(kpl + 1)];
		int[] x = new int[(kpl + 1)];
		
		y[1] = 1;
		x[1] = 1;
		
		y[2] = kor;
		x[2] = lev;
		
		
		int kor1 = kor / 2;
		
		for (int i1 = 0; i1 < kor1; i1++) {
		
			for (int i2 = 0; i2 < lev; i2++) {
		
				int number = (i1 * lev * 2) + (2 * i2) + 1;

				y[number] = i1 + 1;
				x[number] = i2 + 1;
		
			} // i2
		} // i1
		
		int kor2 = kor1 + (kor % 2) + 1;
		
		
		for (int i1 = kor; i1 > (kor2 - 1); i1--) {
		
			for (int i2 = lev; i2 > 0; i2--) {
		
				int number = (2 * i2) + ((kor-i1) * lev * 2);

				y[number] = i1;
				x[number] = lev - i2 + 1;
		
			} // i2
		} // i1
		
		
		if ((kor % 2) == 1) {
			
			int num1 = kpl - lev +1;
			int num2 = num1 + lev -1;
			int num3 = 0;
			int pos3 = 0;
			
			if ((lev % 2) == 1) {
				pos3 = (lev + 1) / 2;
				y[kpl] = (kor+1)/2;
				x[kpl] = pos3;
				}
			
			int lev1 = lev / 2;
			
			for (int i2 = 0; i2 < lev1; i2++) {
				int number = num1 + (2 * i2);
				y[number] = (kor+1)/2;
				x[number] = i2 + 1;
			}
			
			int lev2 = lev1 + (lev % 2) + 1;
			
			for (int i2 = lev; i2 > (lev2 - 1); i2--) {
				int number = num1 + 1 - (2* i2) + (2*lev);
				y[number] = (kor+1)/2;
				x[number] = i2;
			}
			
			
			
			
		} // kor % 2
		
		
		// tulostus
		
		int dy = 0;
		int dx = 0;
		
		for (int i5 = 2; i5 < (kpl+1); i5++) {
			
			dy = y[i5] - y[(i5-1)];
			dx = x[i5] - x[(i5-1)];
			
			System.out.println(dy + " " + dx);

		}
		
	/*	
		System.out.println("y: ");
		for (int i6 = 0; i6 < kor; i6++) {
		
		for (int i7 = 1; i7 < (lev+1); i7++) {
		
		  System.out.print(y[(i6*lev )+ i7] + " ");
		
		}
		System.out.println("");
		
		}
		

		System.out.println("x: ");
		for (int i6 = 0; i6 < kor; i6++) {
		
		for (int i7 = 1; i7 < (lev+1); i7++) {
		
		  System.out.print(x[i7 + (i6*lev)] + " ");
		
		}
		System.out.println("");

		
		}	
		*/
		
		
		}   // tapaus t

    }
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2

Verdict: TIME LIMIT EXCEEDED