Ruudukko

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD=1000000007;
ll ans;
ll n;
ll g[1010][1010];
ll f[1010][1010];
ll dfs(ll x,ll y,ll sum,ll fasum){
	if(f[x][y])return f[x][y];
	for(ll i=1;i<=n;i++){
		if(g[x][i]<g[x][y]){
			sum+=dfs(x,i,sum+1,sum);
			sum%=MOD;
		}
		if(g[i][y]<g[x][y]){
			sum+=dfs(i,y,sum+1,sum);
			sum%=MOD;
		}
	}
	f[x][y]=(sum-fasum+MOD)%MOD;
	return f[x][y];
}
int main(){
	cin>>n;
	for(ll i=1;i<=n;i++){
		for(ll j=1;j<=n;j++){
			cin>>g[i][j];
		}
	}
	for(ll i=1;i<=n;i++){
		for(ll j=1;j<=n;j++){
			ans+=dfs(i,j,1,0);
			ans%=MOD;
		}
	}
	cout<<ans<<endl;
	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: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED