Ruudukko

input/code.cpp: In function 'int main()':
input/code.cpp:44:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |             auto [r, c] = y;
      |                  ^

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
 
int main()
{
    int n;
    cin >> n;
    int a[n][n];
    LL cnt[n][n] = {0};
 
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cnt[i][j] = 1;
 
    map <int, vector <pair <int, int>>, greater <int>> m;
    int ma = 0;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
        {
            cin >> a[i][j];
            m[a[i][j]].push_back({i,j});
            ma = max(ma, a[i][j]);
        }
 
    // In kiem tra
    /*
    for (auto x : m)
    {
        if (x.first == ma) continue;
        cout << x.first << ": ";
        for (auto y : x.second)
            cout << "(" << y.first << ", " << y.second << ") ";
        cout << "\n";
    }
    */
 
    for (auto x : m)
    {
        if (x.first == ma) continue;
        for (auto y : x.second)
        {
            auto [r, c] = y;
            for (int j = 0; j < n; j++)
            {
                if (a[r][j] > a[r][c])
                    cnt[r][c] = (cnt[r][c] + cnt[r][j]) % MOD;
            }
            for (int i = 0; i < n; i++)
            {
                if (a[i][c] > a[r][c])
                    cnt[r][c] = (cnt[r][c] + cnt[i][c]) % MOD;
            }
        }
    }
 
 
 
    // In kiem tra
    /*
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
            cout << cnt[i][j] << " ";
        cout << "\n";
    }
    */
 
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
            ans = (ans + cnt[i][j]) % MOD;
    }
    cout << ans << "\n";
    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