Ruudukko

#ifdef LOCAL
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <cmath>
#include <deque>
#include <random>
#include <bitset>
#include <map>
#include <cassert>
#include <complex>
#include <cmath>
#include <time.h>
#else
#include "bits/stdc++.h"
#endif
 
using namespace std;
using cd = complex<double>;
 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
 
#define ll int64_t
#define ld long double
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define x first
#define y second
 
#define int ll
#define double ld
#define endl '\n'
 
const int inf = 1e9;
const ll INF = 1e18;
 
const int mod = 1e9 + 7;
 
void solve() {
    int n;
    cin >> n;
    vector<pair<int, pair<int, int>>> arr;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            int x;
            cin >> x;
            arr.push_back({x, {i, j}});
        }
    }
 
    sort(all(arr));
 
    vector<int> a(n + 1), b(n + 1);
 
    vector<int> kek(n * n);
 
    for (int i = 0; i < n * n;) {
        int j = i;
        while (j < n * n && arr[j].x == arr[i].x) {
            ++j;
        }
 
        for (int x = i; x < j; ++x) {
            kek[x] = a[arr[x].y.x] + b[arr[x].y.y] + 1;
        }
 
        for (int x = i; x < j; ++x) {
            a[arr[x].y.x] = (a[arr[x].y.x] + kek[x]) % mod;
            b[arr[x].y.y] = (b[arr[x].y.y] + kek[x]) % mod;
        }
 
        i = j;
    }
 
    int ans = 0;
    for (int i = 0; i < n * n; ++i)
        ans = (ans + kek[i]) % mod;
 
    cout << ans << endl;
}
 
signed main() {
#ifndef LOCAL
    cin.tie(NULL);
    cout.tie(NULL);
    ios_base::sync_with_stdio(false);
#endif
 
 
    cout.precision(16);
    cout << fixed;
 
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

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