Ruudukko

#include<iostream>
using namespace std;


const int dismo = 1000000007;

int n = 0;

int A(int squareval, int index_x, int index_y, int** multimatrix)
{
	int count = 0;

	if(index_x != 0)
	{
		for (int i = 0; i < index_x; ++i)
		{
			int boo = (squareval - multimatrix[i][index_y] > 0);
			if(!boo) continue;
			count += boo;
			count += A(multimatrix[i][index_y], i, index_y, multimatrix);
		}
	}

	if(index_x != n - 1)
	{
		for (int i = index_x + 1; i < n; ++i)
		{
			int boo = (squareval - multimatrix[i][index_y] > 0);
			if(!boo) continue;
			count += boo;
			count += A(multimatrix[i][index_y], i, index_y, multimatrix);
		}
	}

	if(index_y != 0)
	{
		for (int i = 0; i < index_y; ++i)
		{
			int boo = (squareval - multimatrix[index_x][i] > 0);
			if(!boo) continue;
			count += boo;
			count += A(multimatrix[index_x][i], index_x, i, multimatrix);
		}
	}
	
	if(index_y != n - 1)
	{
		for (int i = index_y + 1; i < n; ++i)
		{ 
			int boo = (squareval - multimatrix[index_x][i] > 0);
			if(!boo) continue;
			count += boo;
			count += A(multimatrix[index_x][i], index_x, i, multimatrix);
		}
	}

	return count;
}


int main()
{
	int countLIBERAL = 0;

	cin >> n;

	int** multimatrix = new int*[n];
	for (int ihh = 0; ihh < n; ++ihh)
	{
		multimatrix[ihh] = new int[n];
	}

	for (int ix = 0; ix < n; ++ix)
	{
		for (int iy = 0; iy < n; ++iy)
		{
			cin >> multimatrix[ix][iy];
		}
	}
	
	for (int lx = 0; lx < n; ++lx)
	{
		for (int ny = 0; ny < n; ++ny)
		{
			countLIBERAL += A(multimatrix[lx][ny], lx, ny, multimatrix);
		}
	}

	cout << (countLIBERAL % dismo) + (n * n);




	return 0;
}

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

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED