Ruudukko

input/code.cpp: In function 'int calculateChains(int, int)':
input/code.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int k = 0; k < links[i][j].size(); k++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>

using namespace std;

int d = 0;
int m = 1000000007;

int vals[1000][1000];
vector<pair<int, int>> links[1000][1000];
int chains[1000][1000];
int totalChains = 0;

int calculateChains(int i, int j) {
    
    if (chains[i][j] != 0) return chains[i][j];
    if (links[i][j].size() == 0) return chains[i][j] = 1;
    
    int chainsFromThis = 1;
    for (int k = 0; k < links[i][j].size(); k++) {
        chainsFromThis = (chainsFromThis + calculateChains(links[i][j][k].first, links[i][j][k].second)) % m;
    }
    
    return chains[i][j] = chainsFromThis;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    
    cin >> d;
    
    for (int i = 0; i < d; i++) {
        for (int j = 0; j < d; j++) {
            cin >> vals[i][j];
            chains[i][j] = 0;
        }
    }
    
    for (int i = 0; i < d; i++) {
        for (int j = 0; j < d; j++) {
            if (vals[i][j] == 1) {
                chains[i][j] = 1;
                for (int i_2 = i + 1; i_2 < d; i_2++) {
                    links[i_2][j].push_back({i, j});
                }
                for (int j_2 = j + 1; j_2 < d; j_2++) {
                    links[i][j_2].push_back({i, j});
                }
            } else {
                for (int i_2 = i + 1; i_2 < d; i_2++) {
                    if (vals[i_2][j] < vals[i][j]) links[i][j].push_back({i_2, j});
                    else if (vals[i_2][j] > vals[i][j]) links[i_2][j].push_back({i, j});
                }
                for (int j_2 = j + 1; j_2 < d; j_2++) {
                    if (vals[i][j_2] < vals[i][j]) links[i][j].push_back({i, j_2});
                    else if (vals[i][j_2] > vals[i][j]) links[i][j_2].push_back({i, j});
                }
            }
        }
    }
    
    for (int i = 0; i < d; i++) {
        for (int j = 0; j < d; j++) {
            totalChains = (totalChains + calculateChains(i, j)) % m;
        }
    }
    cout << totalChains;
}

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

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED