| Task: | Ruudukko | 
| Sender: | Kemm1706 | 
| Submission time: | 2022-11-10 17:36:52 +0200 | 
| Language: | C++ (C++11) | 
| Status: | READY | 
| Result: | 61 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 28 | 
| #2 | ACCEPTED | 33 | 
| #3 | TIME LIMIT EXCEEDED | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #3 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #4 | ACCEPTED | 0.01 s | 2, 3 | details | 
| #5 | ACCEPTED | 0.02 s | 2, 3 | details | 
| #6 | ACCEPTED | 0.02 s | 2, 3 | details | 
| #7 | ACCEPTED | 0.20 s | 3 | details | 
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Compiler report
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;
      |                  ^Code
#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 details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 1 1 1 1 1 1 1 1 1  | 
| correct output | 
|---|
| 9 | 
| user output | 
|---|
| 9 | 
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 1 2 3 6 5 4 7 8 9  | 
| correct output | 
|---|
| 135 | 
| user output | 
|---|
| 135 | 
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 7 8 1 4 5 4 3 9 6  | 
| correct output | 
|---|
| 57 | 
| user output | 
|---|
| 57 | 
Test 4
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 10000 | 
| user output | 
|---|
| 10000 | 
Test 5
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 187458477 | 
| user output | 
|---|
| 187458477 | 
Test 6
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| 964692694 | 
Test 7
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 1000000 | 
| user output | 
|---|
| 1000000 | 
Test 8
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 229147081 | 
| user output | 
|---|
| (empty) | 
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 520283 805991 492643 75254 527...  | 
| correct output | 
|---|
| 951147313 | 
| user output | 
|---|
| (empty) | 
