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<ull>> rei;
set<int> luvut;

int reitit(int y, int x){
	int r = 1;
	FOR(i, n){
		r += rei[y][i];
	}

	FOR(i, n){
		r += rei[i][x];
	}

	r %= MOD;

	yht += r;
	yht %= MOD;
	return r;
}

void print_rei(){
	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<ull>(n, 0));

	FOR(i, n){
		FOR(j, n){
			int l;
			cin >> l;
			ruu[i][j] = l;
			rei[i][j] = l == 1;
			yht += l == 1;
			luvut.insert(l);
		}
	}

	luvut.erase(1);

	//print_rei();

	for(int l : luvut){
		FOR(y, n){
			FOR(x, n){
				if(ruu[y][x] == l){
					rei[y][x] = reitit(y, x);
				}
			}
		}
		//print_rei();
	}

	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: WRONG ANSWER

Test 4

Group: 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED