Ruudukko

#include <bits/stdc++.h>

#define MODE 0

#if MODE == 0
#define debug(x) cout << #x << ": " << x << endl
#define log(x) cout << x << endl
#define test(x) x
#else
#define debug(x)
#define log(x)
#define test(x)
#endif

#define M 1000000007
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second

using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

const int N = 1010;

ll r[N], c[N];

void solve() {
    int n;
    cin >> n;
    
    vector<array<ll, 3>> v(n*n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> v[i*n+j][0];
            v[i*n+j][1] = i;
            v[i*n+j][2] = j;
        }
    }
    
    sort(all(v));
    
    int p = 0;
    vector<array<ll, 3>> que;
    ll ans = 0;
    for (int i = 0; i < n*n; ++i) {
        if (v[i][0] > p) {
            for (auto a: que) {
                r[a[1]] = (r[a[1]] + a[0]) % M;
                c[a[2]] = (c[a[2]] + a[0]) % M;
            }
            
            que.clear();
        }
        
        array<ll, 3> a = v[i];
        a[0] = (r[a[1]] + c[a[2]] + 1) % M;
        
        ans = (ans + a[0]) % M;
        que.emplace_back(a);
        p = v[i][0];
    }
    
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    
    solve();
    
    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: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED