Ruudukko

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(decltype(n) i=0;i<(n);++i)
#define FORI(i, s, n) for(decltype(n) i=(s);i<(n);++i)
#define BE(t) t.begin(), t.end()
#define RBE(t) t.rbegin(), t.rend()
#define evn(n) (!((n) & 1))
#define PB push_back
#define MP(f, s) make_pair((f), (s))
#define F first
#define S second
#define pmod(a, m) ((a)%(m)+(m))%(m)
typedef unsigned long long ull;
typedef long long ll;
#define MOD ((int)1e9+7)
#define CEILDIV(a, b) (((a)-1)/(b)+1)
 
int n;
ull yht = 0;
vector<vector<int>> ruu;
vector<vector<int>> rei;
vector<int> pysty, vaaka, up, uv;
set<int> luvut;
 
void print_rei(){
	cout << '\n';
	cout << "pysty: ";
	for(int i : pysty)
		cout << i << ' ';
	cout << '\n';
	cout << "vaaka: ";
	for(int i : vaaka)
		cout << i << ' ';
	cout << '\n';
	for(auto &rivi : rei){
		for(int i : rivi){
			cout << i << ' ';
		}
		cout << '\n';
	}
}
 
int main(){
	cin >> n;
 
	ruu.resize(n, vector<int>(n));
	rei.resize(n, vector<int>(n));
	pysty.resize(n);
	vaaka.resize(n);
	up.resize(n);
	uv.resize(n);
 
	FOR(i, n){
		FOR(j, n){
			int l;
			cin >> l;
			ruu[i][j] = l;
			rei[i][j] = l == 1;
			luvut.insert(l);
		}
	}

	FOR(y, n){
		FOR(x, n){
			vaaka[y] += rei[y][x];
			pysty[x] += rei[y][x];
		}
	}
 
	luvut.erase(1);
 
	for(int l : luvut){
		//print_rei();
		FOR(y, n){
			FOR(x, n){
				if(ruu[y][x] == l){
					int av = (pysty[x] + vaaka[y] + 1) % MOD;
					rei[y][x] = av;
				}
				uv[y] += rei[y][x];
				uv[y] %= MOD;
				up[x] += rei[y][x];
				up[x] %= MOD;
			}
		}
		pysty = up;
		vaaka = uv;
		fill(BE(up), 0);
		fill(BE(uv), 0);
	}

	FOR(y, n){
		FOR(x, n){
			yht += rei[y][x];
			yht %= MOD;
		}
	}
 
	cout << yht << '\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