Ruudukko

#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
 
using ll = long long;
 
ll mod = 10e9 + 7;
 
class NxNArray {
public:
    NxNArray(ll n_): n(n_) { array.resize(n * n, 0); }
 
    ll& operator()(ll row, ll col) { return array[row * n + col]; }
    ll& operator[](ll i) { return array[i]; }
 
    ll size() const { return n; }
 
    static ll do_mod(ll x) {
        if (x >= mod) x %= mod;
        return x;
    }
 
    ll sum_at(ll row, ll col) {
        ll sum = 0;
        for (ll r = 0; r < n; ++r) {
            sum += (*this)(r, col);
            sum = do_mod(sum);
        }
        for (ll c = 0; c < n; ++c) {
            sum += (*this)(row, c);
            sum = do_mod(sum);
        }
 
        // Reitti voi myös loppua tähän
        sum += 1;
        return sum;
    }
    ll sum_at(ll i) { return sum_at(i / n, i % n); }
 
    ll n;
    std::vector<ll> array;
};
 
NxNArray read_input() {
    ll n;
    std::cin >> n;
    NxNArray array{ n };
 
    for (ll i = 0; i < n * n; ++i) {
        ll v;
        std::cin >> v;
        array[i] = v;
    }
    return array;
}
 
int main() {
    std::cin.sync_with_stdio(false);
 
    auto array = read_input();
 
    NxNArray sums(array.size());
 
    const ll n2 = array.size() * array.size();
    for (ll cur = 0; cur <= n2; ++cur) {
        // Lasketaan summa kohdissa, joissa on pienin tähän laskematon luku
        // Tehdään summien listasta kopio, jottei yhtä suuria lukuja lasketa mukaan
        auto tmp_sums = sums;
        for (ll i = 0; i < n2; ++i) {
            if (array[i] == cur + 1) { tmp_sums[i] = sums.sum_at(i) % mod; }
        }
        sums = std::move(tmp_sums);
    }
    // Lopussa lasketaan kaikki yhteen
    ll res = std::reduce(sums.array.begin(), sums.array.end());
    std::cout << res % mod;
}

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: WRONG ANSWER

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED