Ruudukko

#include<iostream>
#include<vector>
#include<algorithm>
 
using namespace std;
 
struct ruutu {
	unsigned long long first;
	unsigned long long second;
	unsigned long long x;
	unsigned long long y;
 
	ruutu(unsigned long long first_, unsigned 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;
	}
};
 
struct rivi {
	unsigned long long summa, valiaika, edellinen;
	rivi() {
		summa = 0;
		valiaika = 0;
		edellinen = 0;
	}
};
 
int main() {
	unsigned long long n;
	cin >> n;
	unsigned long long mod = 1000000007;
	unsigned long long s = 0;
 
	vector<ruutu> v;
	vector<rivi> r_x(n);
	vector<rivi> r_y(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;
			v.push_back(ruutu(x, 1, j, i));
		}
	}
	sort(v.begin(), v.end());
 
	for (ruutu i : v) {
		if (i.first > r_x[i.x].edellinen) {
			r_x[i.x].summa += r_x[i.x].valiaika % mod;
			r_x[i.x].valiaika = 0;
		}
		if (i.first > r_y[i.y].edellinen) {
			r_y[i.y].summa += r_y[i.y].valiaika % mod;
			r_y[i.y].valiaika = 0;
		}
 
		i.second += r_x[i.x].summa % mod;
		i.second += r_y[i.y].summa % mod;
 
		r_x[i.x].edellinen = i.first % mod;
		r_y[i.y].edellinen = i.first % mod;
 
		s += i.second;
 
		r_x[i.x].valiaika += i.second % mod;
		r_y[i.y].valiaika += i.second % mod;
	}
 
	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: 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: ACCEPTED