Task: | Ruudukko |
Sender: | eetumaenpaa |
Submission time: | 2022-11-08 22:49:19 +0200 |
Language: | Python3 (CPython3) |
Status: | READY |
Result: | 28 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.03 s | 2, 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
import random # n = 50 # rows = [] # for i2 in range(n): # rows.append(random.sample(range(1, n*n+1), n*n)) # n = 3 # rows = [ # [2,1,3], # [1,1,1], # [9,2,7] # ] # for row in rows: # for element in row: # print(element, end=" ") # print() n = int(input()) rows = [] for i in range(n): rows.append([int(x) for x in input().split(" ")]) unique_numbers = [] for i2 in range(n): for j1 in range(n): if(rows[i2][j1] not in unique_numbers): unique_numbers.append(rows[i2][j1]) unique_numbers = sorted(unique_numbers) def count_global(lambda_function): c = 0 for i in range(n): for j in range(n): if lambda_function(rows[i][j]): c += 1 return c def get_numbers_on_row_and_column(x, y, include_self): numbers = [] for i in range(n): if include_self: numbers.append(rows[y][i]) else: if i != x: numbers.append(rows[y][i]) for i in range(n): if i != y: numbers.append(rows[i][x]) return numbers def get_coordinates_of(lambda_function): coords = [] for i in range(n): for j in range(n): if lambda_function(rows[i][j]): coords.append((i, j)) return coords def count_elements_on_same_row_and_column(x, y, lambda_function): c = 0 for i in range(n): if lambda_function(rows[y][i]): c += 1 if lambda_function(rows[i][x]): c += 1 return c cache = {} for num in unique_numbers: coords = get_coordinates_of(lambda x: x == num) if num == unique_numbers[0]: for c in coords: cache[c] = 1 else: for c in coords: lines = [] i1 = c[0] for j1 in range(n): if rows[i1][j1] < num: lines.append((i1, j1)) j2 = c[1] for i2 in range(n): if rows[i2][j2] < num: lines.append((i2, j2)) cache[c] = sum([cache[x] for x in lines]) + 1 print(sum(cache.values()) % (10**9 + 7))
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 1 1 1 1 1 1 1 1 1 |
correct output |
---|
9 |
user output |
---|
9 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 1 2 3 6 5 4 7 8 9 |
correct output |
---|
135 |
user output |
---|
135 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
57 |
Test 4
Group: 2, 3
Verdict: ACCEPTED
input |
---|
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
10000 |
user output |
---|
10000 |
Test 5
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
(empty) |
Test 6
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
(empty) |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000000 |
user output |
---|
(empty) |
Test 8
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
229147081 |
user output |
---|
(empty) |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
(empty) |