Ruudukko

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL modd = 1e9 + 7;

struct Item
{
    LL val, x, y;
};

bool SoSanh(Item a, Item b)
{
    return a.val > b.val;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    //freopen("test_input.txt", "r", stdin);

    LL n, i, j, m = 0, x, y, ans = 0, k;
    static Item a[1000000];
    //static LL countt[100][100];
    static LL r[1000];
    static LL c[1000];
    cin >> n;
    for(i = 0; i < n; i++)
        for(j = 0; j < n; j++)
        {
            cin >> a[m].val;
            a[m].x = i;
            a[m].y = j;
            m++;
        }
    sort(a, a + m, SoSanh);
    i = j = 0;
    n *= n;
    while(i < n)
    {
        vector <pair<LL, LL>> dr;
        vector <pair<LL, LL>> dc;
        while(a[j].val == a[i].val && j < n)
        {
            x = a[j].x;
            y = a[j].y;
            k = (r[x] + c[y] + 1) % modd;
            dr.push_back({x, k});
            dc.push_back({y, k});
            ans += k;
            ans %= modd;
            //cout << "\n" << x << " " << y << " " << ans;
            j++;
        }
        m = dr.size();
        for(i = 0; i < m; i++)
        {
            r[dr[i].first] += dr[i].second;
            r[dr[i].first] %= modd;
        }
        m = dc.size();
        for(i = 0; i < m; i++)
        {
            c[dc[i].first] += dc[i].second;
            c[dc[i].first] %= modd;
        }
        //cout << " " << r[x] << " " << c[y] << ".";
        i = j;
    }
    /*for(i = 0; i < sqrt(n); i++)
        cout << r[i] << " " << c[i] << "\n\n";*/
    cout << ans;
    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