Ruudukko

#include <bits/stdc++.h>

using namespace std;
 
 
void init_code() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
#ifndef ONLINE_JUDGE
 
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
} 
 
const int mod = 1e9+ 7;
 
void solve() {
  int n;
  cin >> n;
  vector<vector<int>> a(n, vector<int> (n));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      cin >> a[i][j];
    }
  }
  
  map<int, vector<pair<int, int>> > mp;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      mp[a[i][j]].push_back({i, j});
    }
  }
 
  long long res = 0;
  
  map<int, int> isums;
  map<int, int> jsums;
 
  for (auto x : mp) {
    map<int, int> iadds, jadds;
    for (auto k : x.second) {
      int i = k.first; int j = k.second;
      int val = (isums[i] + jsums[j] + 1) % mod;
      res = (res + val) % mod;
      iadds[i] = (iadds[i] + val) % mod;
      jadds[j] = (jadds[j] + val) % mod;
    }
    for (auto i: iadds) {
      isums[i.first] = (isums[i.first] + i.second) % mod;
    }
 
    for (auto j: jadds) {
      jsums[j.first] = (jsums[j.first] + j.second) % mod;
    }
  }
  cout << res << '\n';
}
 
signed main() {
  init_code();
  int t = 1;
  while (t--) {
    solve();  
  }
  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: ACCEPTED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED