Ruudukko

import java.util.Scanner;
import java.math.BigInteger;

public class Ruudukko {

    static int n = 0;
    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        n = scan.nextInt();

        int[][] arr = new int[n][n];
        int[][] arr2 = new int[n][n];
        int[] arr3 = new int[n*n];

        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                arr[i][j] = scan.nextInt();
                arr2[i][j] = 1;
            }
        }

        int m = -1;
        int i2 = 0;
        int m2 = 0;

        for(int i = 0; i < n*n; i++) {
            arr3[i] = -1;
        }

        while(i2 < n*n) {
            if(i2%n == 0) {
                m++;
            }
            if(checkArr(arr3, arr[m][i2%n])) {
                arr3[m2] = arr[m][i2%n];
                m2++;
            }
            
            i2++;
        }

        int[] arr4 = new int[m2];

        for(int i = 0; i < arr4.length; i++) {
            arr4[i] = arr3[i];
        }

        m2 = 0;

        for(int i = 0; i < arr4.length; i++) {
            for(int j = 1; j < arr4.length-i; j++) {
                if(arr4[j-1] > arr4[j]) {
                    m2 = arr4[j-1];  
                    arr4[j-1] = arr4[j];  
                    arr4[j] = m2;
                }
            }
        }

        m2 = 0;
        m = arr4.length;

        for(int i = 1; i <= n*n; i++) {
            if(arr4[m2] == i) {
                if(m2 < m-1) {
                    m2++;
                }
                for(int j = 0; j < n; j++) {
                    for(int k = 0; k < n; k++) {
                        if(arr[j][k] == i) {
                            for(int l = 0; l < n; l++) {
                                if(arr[j][l] < i) {
                                    arr2[j][k] = (arr2[j][k] + arr2[j][l])%1000000007;
                                }
                            }
                            for(int l = 0; l < n; l++) {
                                if(arr[l][k] < i) {
                                    arr2[j][k] = (arr2[j][k] + arr2[l][k])%1000000007;
                                }
                            }
                        }
                    }
                }
            }
        }

        int sum = 0;

        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                sum = (sum + arr2[i][j])%1000000007;
            }
        }
        System.out.print(sum);
    }

    public static boolean checkArr(int[] arr3, int key) {

        for(int i = 0; i < n*n; i++) {
            if(arr3[i] == key) {
                return false;
            }
        }
        return true;
    }

}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED