Ruudukko

#include "bits/stdc++.h"
#define int long long
 
using namespace std;
 
map<int, int> mp;
 
const int mod = 1e9+ 7;
 
 
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, i, j, m, val, x, res;
 
  cin >> n;
 
    unordered_map<int, int> isums;
	unordered_map<int, int> jsums;
	unordered_map<int, int> iadds;
	unordered_map<int, int> jadds;
   unordered_map<int, vector<int*>> cells;
	unordered_map<int, int>::iterator ii;
 
  vector<vector<int>> g(n, vector<int> (n));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      cin >> x;
      int *ij = (int*)malloc(2 * sizeof(int));
      ij[0] = i;
      ij[1] = j;
      cells[x].push_back(ij);
    }
  }
 
std::vector<int> keys;
std::vector<int>::iterator ik;
 
keys.reserve (cells.size());
for (auto& it : cells) {
    keys.push_back(it.first);
}
std::sort (keys.begin(), keys.end());
res = 0;
for (int key : keys)
{
  	iadds.clear();
  	jadds.clear();
  	for(int* pi : cells[key])
  	{
  		i = pi[0];
  		j = pi[1];
        val = (1 + isums[i] + jsums[j]) % mod;
		res = (res + val) % mod;
		iadds[i] = (iadds[i] + val) % mod;
		jadds[j] = (jadds[j] + val) % mod;
  	}
 
	  for (ii = iadds.begin(); ii != iadds.end(); ii++){
		m = ii->first;
		val = ii->second;
		isums[m] += val;
		isums[m] %= mod;
	  }
 
	  for (ii = jadds.begin(); ii != jadds.end(); ii++){
		m = ii->first;
		val = ii->second;
		jsums[m] += val;
		jsums[m] %= mod;
	  }
  }
  cout << res << "\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: ACCEPTED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED