Ruudukko

// First Java program, although I've coded in C# so should be fast to pick up.
import java.util.Scanner;

public class App {

    static int[][] map = new int[1001][1001];
    static int[][] gps = new int[1001][1001];
    // This would be sooooo much easier if the array could just be made public, or if I could pass a pointer to the array...
    static int route(int n, int x, int y){
        int routes = 1;
        if (map[x][y]==1)
            return 1;
        if (gps[x][y]!=0)
            return gps[x][y];
        for (int i=0;i<n;i++){
            if (map[x][i]<map[x][y])
                routes += route(n,x,i);
            if (map[i][y]<map[x][y])
                routes += route(n,i,y);
        }
        gps[x][y] = routes;
        return routes;
    }
    // The idea to reduce computation time (pre-optimizing), is store the number of routes from a particular square. Trading memory for speed. 
    public static void main(String[] args) throws Exception {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        input.nextLine();
        for (int i=0;i<n;i++){
            String line = input.nextLine();
            String[] arrline = line.split(" ",n);
            for (int j=0;j<n;j++){
                map[i][j] = Integer.parseInt(arrline[j]);
            }
        }
        int uwu = 0;
        for (int i=0;i<n;i++){
            for (int j=0;j<n;j++){
                uwu += route(n,i,j);
            }
        }
        System.out.println(uwu);
        // First tryyy OWO~~~!!!
    }
}

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: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED