Ruudukko

#include <iostream>
#include <vector>
#include <unordered_set>
#include <set>
using namespace std;
 
const int DIVISOR = 1000000007;
 
vector<int> line_row(1000);
vector<int> line_row_last(1000);
vector<int> line_col(1000);
vector<int> line_col_last(1000);
vector<int> line_row_added(1000);
vector<int> line_col_added(1000);
int total = 0;
 
int get_line_row(int y, int v)
{
    if (v == line_row_last[y])
    {
        return line_row[y];
    }
    line_row_last[y] = v;
    int s;
    s = (line_row[y] + line_row_added[y]) % DIVISOR;
    line_row_added[y] = 0;
    line_row[y] = s;
 
    return s;
}
int get_line_col(int x, int v)
{
    if (v == line_col_last[x])
    {
        return line_col[x];
    }
    line_col_last[x] = v;
    int s;
    s = (line_col[x] + line_col_added[x]) % DIVISOR;
    line_col_added[x] = 0;
    line_col[x] = s;
 
    return s;
}
 
int calculate_routes(int y, int x, int number)
{
    int value;
    if (number == 1)
    {
        value = 1;
    }
    else
    {
        value = (get_line_col(x, number) + get_line_row(y, number) + 1) % DIVISOR;
    }
    total += value;
    total %= DIVISOR;
    line_row_added[y] += value;
    line_row_added[y] %= DIVISOR;
    line_col_added[x] += value;
    line_col_added[x] %= DIVISOR;
    return value;
}
 
int main()
{
    int n;
    cin >> n;
    vector<vector<int>> grid;
    // grid.reserve(n * n);
    for (int i = 0; i < n; i++)
    {
        vector<int> b;
        for (int j = 0; j < n; j++)
        {
            int a;
            cin >> a;
            b.push_back(a);
        }
        grid.push_back(b);
    }
 
    vector<int> line_row(n, 0);
    vector<int> line_row_last(n, 1);
    vector<int> line_col(n, 0);
    vector<int> line_col_last(n, 1);
    vector<int> line_row_added(n, 0);
    vector<int> line_col_added(n, 0);
 
    vector<unordered_set<int>> exists_row;
    set<int> exists_all;
    for (int y = 0; y < n; y++)
    {
        unordered_set<int> s;
        for (int x = 0; x < n; x++)
        {
            s.insert(grid[y][x]);
            exists_all.insert(grid[y][x]);
        }
        exists_row.push_back(s);
    }
 
    for (auto &a : exists_all)
    {
        for (int y = 0; y < n; y++)
        {
            if (exists_row[y].find(a) != exists_row[y].end())
            {
                for (int x = 0; x < n; x++)
                {
                    if (grid[y][x] == a)
                    {
                        calculate_routes(y, x, a);
                    }
                }
            }
        }
    }
    cout << total << "\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