Ruudukko

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

    ll n, k, m, s;
    vector<vector<ll>> v, w, z;
    vector<ll> u;

void haku (ll e, ll f){
    z[e][f] = 1;
    if (v[e][f] != 1) {
        for (int i = 0; i < n; i++){
            if (v[e][f] > v[e][i]){
                if (z[e][i] == 0) haku(e,i);
                w[e][f] += w[e][i];
            }
        }
        for (int i = 0; i < n; i++){
            if (v[e][f] > v[i][f]){
                if (z[i][f] == 0) haku(i,f);
                w[e][f] += w[i][f];
            }
        }

    }
}

int main()
{
    s = 0;
    cin >> n;
    v.assign(n, vector<ll> (n, 0));
    w.assign(n, vector<ll> (n, 1));
    z.assign(n, vector<ll> (n, 0));

    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            cin >> k;
            v[i][j] = k;
            u.push_back(k);
        }
    }

    auto it = max_element(u.begin(), u.end());
    m = distance(u.begin(), it);

    haku(m/n,m%n);

    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            if (z[i][j] == 0) haku(i, j);
        }
    }

    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            s = (s + w[i][j]) % 1000000007;
        }
    }

    cout << s;

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