Ruudukko

a = int(input())
a2 = 0
b = 1
c = []
r = a * a

def d(e):
	return e[0]

while a2 < a:
	for n in input().split():
		c.append([int(n), 1, a2])
		c[-1].append(c.index(c[-1]) % a)
		c[-1].append(c.index(c[-1]))
	a2 += 1
f = c
f.sort(key = d)

for n in f:
	while n[3] - b > -1:
		if n[0] > c[n[4] - b][0]:
			n[1] += c[n[4] - b][1]
		b += 1
	b = 1
	while n[3] + b < a:
		if n[0] > c[n[4] + b][0]:
			n[1] += c[n[4] + b][1]
		b += 1
	b = 1
	while n[2] - b > -1:
		if n[0] > c[n[4] - b * a][0]:
			n[1] += c[n[4] - b * a][1]
		b += 1
	b = 1
	while n[2] + b < a:
		if n[0] > c[n[4] + b * a][0]:
			n[1] += c[n[4] + b * a][1]
		b += 1
	r += n[1] - 1

print(r % (10 ** 9 + 7))

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED