Ruudukko

input/code.cpp: In function 'int main()':
input/code.cpp:38:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   38 |     for (auto [val, i, j] : p) {
      |               ^
input/code.cpp:43:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   43 |         for (auto [I, J, add] : curs) {
      |                   ^
input/code.cpp:54:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |     for (auto [I, J, add] : curs) {
      |               ^

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <numeric>
#include <random>
#include <chrono>
#include <ctime>
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
const int INF = 1e18, MOD = 1e9 + 7;


signed main() {
    //freopen("file.in", "r", stdin);
    //freopen("file.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(20);
    cout.setf(ios::fixed);
    int n; cin >> n;
    vector<vector<int>> a(n, vector<int> (n)), dp(n,vector<int> (n, 0));
    vector<tuple<int, int, int>> p;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> a[i][j];
            p.emplace_back(a[i][j], i, j);
        }
    }
    sort(all(p));
    vector<int> x(n, 0), y(n, 0);
    int cur = -1;
    vector<tuple<int, int, int>> curs;
    for (auto [val, i, j] : p) {
        if (val == cur) {
            curs.emplace_back(i, j, (1 + x[i] + y[j]) % MOD);
            continue;
        }
        for (auto [I, J, add] : curs) {
            dp[I][J] = add;
            x[I] += add;
            x[I] %= MOD;
            y[J] += add;
            y[J] %= MOD;
        }
        cur = val;
        curs.clear();
        curs.emplace_back(i, j, (1 + x[i] + y[j]) % MOD);
    }
    for (auto [I, J, add] : curs) {
        dp[I][J] = add;
        x[I] += add;
        x[I] %= MOD;
        y[J] += add;
        y[J] %= MOD;
    }
    int res = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            res += dp[i][j];
            res %= MOD;
        }
    }
    cout << res << endl;
    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