Ruudukko

#include <bits/stdc++.h>

using namespace std;

const uint64_t AAAA = 1000000007;

int n;
uint64_t reitit[1000][1000];
uint64_t ruudukko[1000][1000];
pair<int, pair<int, int>> rows[1000][1000];
pair<int, pair<int, int>> cols[1000][1000];
uint64_t reititcols[1000][1000];
uint64_t reititrows[1000][1000];
uint64_t colsij[1000][1000];
uint64_t rowsij[1000][1000];

uint64_t maaralaske_reitit = 0;
uint64_t maaralaske_reitit_nopea = 0;

bool rowcolcmp(pair<int, pair<int, int>> i, pair<int, pair<int, int>> j)
{
    return i.first < j.first;
}

uint64_t laske_reitit(int i, int j)
{
    //cout << "laske_reitit " << i << " " << j << endl;

    int re = reitit[i][j];
    if (re != -1) {
        maaralaske_reitit_nopea++;
        return re;
    }

    maaralaske_reitit++;

    int r = ruudukko[i][j];
    if (r == 1) {
        reitit[i][j] = 0;
        return 0;
    }

    uint64_t nreitit = 0;

    /*if 
    uint64_t edellinen = ;
    for (int k = colsij[i][j] - 1; k >= 0; k++) {
        pair<int, pair<int, int>> a = cols[i][k];

        if (
    }*/

    nreitit %= AAAA;

    reitit[i][j] = nreitit;
    return nreitit;
}

int main()
{
    cin >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int arvo;
            //cin >> ruudukko[i][j];
            cin >> arvo;
            ruudukko[j][i] = arvo;
            rows[i][j] = make_pair(arvo, make_pair(i, j)); // :/
            cols[j][i] = make_pair(arvo, make_pair(i, j)); // ** :/ **

            if (arvo == 1) {
                reitit[i][j] = 0;
            } else {
                reitit[i][j] = -1;
            }
        }
    }

    for (int i = 0; i < n; i++) {
        sort(rows[i], rows[i]+n, rowcolcmp);
        sort(cols[i], cols[i]+n, rowcolcmp);

        for (int j = 0; j < n; j++) {
            pair<int, int> a = cols[i][j].second;
            pair<int, int> b = rows[i][j].second;
            //cout << cols[i][j].first << endl;

            colsij[a.first][a.second] = j;
            rowsij[b.first][b.second] = j;

        }
    }

    //cout << "------------\n";

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            //cout << i << ", " << j << ": " << rowsij[i][j] << endl;
        }
    }

    uint64_t nreitit = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            nreitit += 1 + laske_reitit(i, j);
        }
    }

    cout << nreitit % 1000000007 << endl;
    //cout << "Määrä laske_reitit: " << maaralaske_reitit << endl;
    //cout << "Määrä laske_reitit nopea: " << maaralaske_reitit_nopea << endl;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

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: ACCEPTED

Test 8

Group: 3

Verdict: WRONG ANSWER

Test 9

Group: 3

Verdict: WRONG ANSWER