Ruudukko

#include<iostream>
#include<vector>
#include<algorithm>
 
using namespace std;
 
struct ruutu {
	unsigned long long first;
	long long second;
	unsigned long long x;
	unsigned long long y;
 
	ruutu(unsigned long long first_, long long second_, unsigned long long x_, unsigned long long y_) {
		first = first_;
		second = second_;
		x = x_;
		y = y_;
	}
	bool operator<(const ruutu &p) {
		if (first != p.first) return first < p.first;
		else if (y != p.y) return y < p.y;
		else return x < p.x;
	}
};
 
long long haku(ruutu i, vector<ruutu> v, vector<vector<ruutu>> k, unsigned long long n) {
	long long s = 0;
	for (unsigned long long a = 0; a < n; a++) {
		if (i.first > k[i.y][a].first) {
			s += k[i.y][a].second;
		}
		if (i.first > k[a][i.x].first) {
			s += k[a][i.x].second;
		}
	}
	return s;
}
 
int main() {
	unsigned long long n;
	cin >> n;
 
	long long s = 0;
 
	vector<ruutu> v;
	vector<vector<ruutu>> k(n);
 
	for (unsigned long long i = 0; i < n; i++) { // y
		for (unsigned long long j = 0; j < n; j++) { // x
			unsigned long long x;
			cin >> x;
			ruutu z(x, 1, j, i);
 
			k[i].push_back(z);
			v.push_back(z);
		}
	}
	sort(v.begin(), v.end());
 
	for (auto i : v) {
		long long c = 0;
		if (i.first != 1) { 
			c += haku(i, v, k, n);
		}
 
		k[i.y][i.x].second += c;
		i.second += c;
		s += i.second;
	}
 
	unsigned long long mod = 1000000007;
	cout << s % mod;
}

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

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED