Ruudukko

input/code.cpp: In function 'void equalize(std::queue<std::pair<long long int, long long int> >&, vl&)':
input/code.cpp:25:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   25 |         auto [p, v] = cc.front(); cc.pop();
      |              ^

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vl;
typedef vector <vl> vvl;
typedef pair <ll, ll> pl;
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;
}

void equalize(queue <pl> &cc, vl &c)
{
    while(!cc.empty())
    {
        auto [p, v] = cc.front(); cc.pop();
        c[p] = (c[p] + v) % modd;
    }
}


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

    ll n, i, j, cur = -1, k = 0, s;
    cin >> n;
    vi a(n * n);
    queue <pl> cc, rr;
    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);
    vl r(n), c(n);
    for(i = 0; i < k; i++)
    {
        if(a[i].v != cur)
        {
            equalize(cc, c); equalize(rr, r);
            cur = a[i].v;
        }
        s = (r[a[i].x] + c[a[i].y] + 1) % modd;
        rr.push({a[i].x, s}); cc.push({a[i].y, s});
    }

    equalize(cc, c); equalize(rr, r);

    k = 0;
    for(i = 0; i < n; i++)
            k = (k + c[i] + r[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: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED