Ruudukko

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

typedef long int li;
const ll M = 1e9+7;
int main(){
    // freopen("input.txt", "r", stdin);
    li n;

    cin >> n;

    ll dx[n] = {0};
    ll dy[n] = {0};

    pair<ll, pair<li, li>> d[n*n]= {};

    for (li i = 0; i < n*n; i++)
    {
        ll a;
        cin >> a;
        d[i].first = a;
        d[i].second = {(i%n), li(i/n)};
    }
    sort(d, d+(n*n));

    ll last = 0;

    ll dx2[n] = {0};
    ll dy2[n] = {0};
    ll c = 0;
    for (li i = 0; i < n*n; i++)
    {
        if(last < d[i].first){
            copy(dx2, dx2+n, dx);
            copy(dy2, dy2+n, dy);
        }
        ll x = dx[d[i].second.first];
        ll y = dy[d[i].second.second];
        ll sum = (1 + x + y);
        c = (c + sum%M)%M;
        
        dx2[d[i].second.first] += sum%M;
        dy2[d[i].second.second]+= sum%M;

        last = d[i].first;
    }
    cout << c;
    

}

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