Ruudukko

#include<iostream>
using namespace std;
 
typedef long long ll;
 
 
const ll dismo = 1000000007;
 
ll n = 0;
 
ll** multimatrix;
ll** saved;
 
 
ll A(ll index_x, ll index_y)
{
	ll squareval = multimatrix[index_x][index_y];
	if(squareval == 1)
		return 0;
 
	ll save = saved[index_x][index_y];
	if (save != -1)
		return save;
 
 
	ll count = 0;
 
	for (ll i = 0; i < n; ++i)
	{
		if(i == index_x) continue;
		ll ne = multimatrix[i][index_y];
		if(ne == 1)
		{
			count++;
			continue;
		}
		if(ne >= squareval) continue;
		ll coconut = saved[i][index_y];
		if (coconut == -1)
		{
			count += A(i, index_y) + 1;
		}
		else
		{
			count += coconut + 1;
		}
 
		count %= dismo;
	}
 
	for (ll i = 0; i < n; ++i)
	{
		if(i == index_y) continue;
		ll ne = multimatrix[index_x][i];
		if(ne == 1)
		{
			count++;
			continue;
		}
		if(ne >= squareval) continue;
		ll coconut = saved[index_x][i];
		if (coconut == -1)
		{
			count = (count + A(index_x, i) + 1) % dismo;
		}
		else
		{
			count = (count + coconut + 1) % dismo;
		}
	}
 
	saved[index_x][index_y] = count;
	return count;
}
 
 
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
 
	ll countLIBERAL = 0;
 
	cin >> n;
 
	multimatrix = new ll* [n];
	saved = new ll* [n];
	for (ll i = 0; i < n; ++i)
	{
		multimatrix[i] = new ll[n];
		saved[i] = new ll[n];
		for (ll i7 = 0; i7 < n; ++i7)
		{
			saved[i][i7] = -1;
			cin >> multimatrix[i][i7];
		}
	}
 
	for (ll lx = 0; lx < n; ++lx)
		for (ll ny = 0; ny < n; ++ny)
		{
			countLIBERAL += A(lx, ny);
		}
 
 
	cout << (countLIBERAL + (n * n)) % dismo;
 
 
 
 
	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: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED