Ruudukko

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

struct item
{
    ll v, x, y;
};

typedef vector <item> vi;

bool ss(item a, item b)
{
    return a.v < b.v;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    ll n, i, j, t = 0, cur = -1, k = 0, s;
    cin >> n;
    vi a(n * n);
    for(i = 0; i < n; i++)
        for(j = 0; j < n; j++)
        {
            cin >> a[k].v;
            a[k].x = i; a[k].y = j;
            k++;
        }
    sort(a.begin(), a.end(), ss);
    vvl r(2, vl(n, 0)), c(2, vl(n, 0));
    for(i = 0; i < k; i++)
    {
        if(a[i].v != cur)
        {
            t = 1 - t;
            cur = a[i].v;
            for(s = 0; s < n; s++)
            {
                r[t][s] = r[1 - t][s];
                c[t][s] = c[1 - t][s];
            }
        }
        s = (r[1 - t][a[i].x] + c[1 - t][a[i].y] + 1) % modd;
        r[t][a[i].x] = (r[t][a[i].x] + s) % modd;
        c[t][a[i].y] = (c[t][a[i].y] + s) % modd;
    }
    k = 0;
    for(i = 0; i < n; i++)
            k = (k + c[t][i] + r[t][i]) % modd;
    k = (modd + 1) / 2 * k % modd;
    cout << k;

    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: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED