Ruudukko

#include <bits/stdc++.h>
#include <cmath>
 
using namespace std;
 
typedef long long ll;
 
ll get_position(pair<int, int> position, vector<vector<ll>>& ruudukko) {
    return ruudukko[position.second][position.first];
}
 
vector<pair<int, int>> get_smaller_positions(vector<pair<int, int>>& positions, ll value, vector<vector<ll>>& ruudukko) {
    vector<pair<int, int>> result;
    for (auto& position : positions) {
        if (get_position(position, ruudukko) < value) {
            result.push_back(position);
        }
    }
    return result;
}
 
vector<pair<int, int>> get_available_positions(pair<int, int> position, vector<vector<ll>>& ruudukko, ll n) {
    vector<pair<int, int>> available_positions;
    for (int i = 0; i < n; i++) {
        available_positions.push_back(make_pair(position.first, i));
        available_positions.push_back(make_pair(i, position.second));
    }
    return get_smaller_positions(available_positions, get_position(position, ruudukko), ruudukko);
}
 
 
void solve_positions(vector<pair<int, int>> positions, ll& answer, vector<vector<ll>>& ruudukko, ll n) {
    vector<pair<int, int>> next_positions;
    if (positions.size() > 0) {
        for (auto& pos : positions) {
            if (get_position(pos, ruudukko) == 1) {
                answer += 1;
            } else {
                answer += 1;
                next_positions.push_back(pos);
            }
        }
    }
    if (next_positions.size() > 0) {
        for (auto& next_pos : next_positions) {
            solve_positions(get_available_positions(next_pos, ruudukko, n), answer, ruudukko, n);
        }
    }
}
 
int main() {
    ll answer=0, modulo, n, current_number;
    modulo = pow(10, 9)+7;
    cin >> n;
    answer = n*n;
    vector<vector<ll>> ruudukko;
    for (int i = 0; i < n; i++) {
        vector<ll> adding_vector;
        for (int j = 0; j < n; j++) {
            cin >> current_number;
            adding_vector.push_back(current_number);
        }
        ruudukko.push_back(adding_vector);
    }
 
    for (int x = 0; x < n; x++) {
        for (int y = 0; y < n; y++) {
            solve_positions(get_available_positions(make_pair(x, y), ruudukko, n),answer,ruudukko, n);
        }
    }
    cout << answer%modulo << "\n";
}

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: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED