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];
    }
  } 
 
  int res = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int x = 0; x < n; ++x) {
        if (a[x][j] < a[i][j]) {
            //g[i * n + j][x * n + j]++;
            res += 1;
          }     
      }
 
      for (int y = 0; y < n;  ++y) {
        if (a[i][y] < a[i][j]) {
          //g[i * n + j][i * n + y]++;
          res += 1;
        }
      } 
    }
  }
  res += n * n;
  res *= 2;
  res %= mod;
  cout << res << '\n';
 
}
 
signed main() {
  init_code();
  int t = 1;
  //cin >> t;
  while (t--) {
    solve();  
  }
  return 0;
}
 
/*
 
 
int dfs (int v, int n, vector<int>& used, vector<int>& p, vector<int> g[], vector<int>& f) {
  int res = 0;
  if (used[v]) {
    return p[v] % mod;
  }
  used[v] = 1;
  for (int i = 0; i < g[v].size(); ++i) {
    p[g[v][i]] = f[g[v][i]] + dfs(g[v][i], n, used, p, g, f);
  }
  return p[v] % mod;
}
 
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];
    }
  } 
 
  vector<int> g[n * n];
  vector<int> f(n * n, 1), p(n * n), used(n * n);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int x = 0; x < n; ++x) {
        if (a[x][j] < a[i][j]) {
          //g[i * n + j].push_back(x * n + j);
          f[x * n + j]++;
          //g[x * n + j].push_back(i * n + j);
        }     
      }
 
      for (int y = 0; y < n;  ++y) {
        if (a[i][y] < a[i][j]) {
          //g[i * n + j].push_back(i * n + y);
          f[i * n + y]++;
          //g[i * n + y].push_back(i * n + j);
        }
      } 
    }
  }
 
  int res = 0;
  for (int i = 0; i < n * n; ++i) {
    if (!used[i]) {
      dfs(i, n, used, p, g, f);
    }
  }
  for (int i = 0; i < n * n; ++i) {
    res += p[i] % mod;
  }
 
  res += n * n;
  res %= mod;
  cout << res << '\n';
}
 
*/

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED