Ruudukko

input/code.cpp: In function 'int main()':
input/code.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
input/code.cpp:19:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |                 scanf("%d", &t);
      |                 ~~~~~^~~~~~~~~~

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){
	int n, i = 0, t;
	
	scanf("%d", &n);

	int l = n*n;
	
	vector<int> a(l);
	vector<ll> b(l, 1ll);
	vector<pair<int,int>> c(l);
	
	while(i<l){
		scanf("%d", &t);
		a[i]=t;
		c[i]={t, i};
		i++;
	}
	
	sort(c.begin(), c.end());
	
	int x,y,m;
	i=0;
	while(c[i].first == 1)i++;
	while(i<l){
		m = c[i].first;
		t = c[i].second;
		x = 0;
		y = 0;
		while(x<n){
			if(a[((int)(t/n))*n+x]<m) b[t] = (b[t] + b[((int)(t/n))*n+x])%1000000007ll;
			if(a[t%n+y*n]<m) b[t] = (b[t] + b[t%n+y*n])%1000000007ll;
			x++;
			y++;
		}
		i++;
	}	
	ll r=0;
	i=0;
	while(i<l){
		r=(r+b[i])%1000000007ll;
		i++;
	} 
	printf("%lld", r);
}

// brute force every path
	// or store for each square what they're connected to
	// then brute force?
	// or 
	// make eaqually large array filled with 1
	// for each 2 in input check possible 1s, for each a[i]+=1
	// for each 3 in input check possible n<3s, for each a[i]+=a[j] (j == pos of n)

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