Task: | Ruudukko |
Sender: | johannes |
Submission time: | 2022-11-06 11:06:49 +0200 |
Language: | Python3 (PyPy3) |
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.04 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.10 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
n = int(input())matrix = []matrix2 = []for i in range(n):l = []l.append(input())l = [int(i) for i in l[0].split()]matrix.append(l)matrix2.extend(l)#n = 3#matrix = [[2, 1, 3], [1, 1, 1], [9, 2, 7]]def possible_moves(matrix=matrix, n=n):coords = {}for pY in range(n):for pX in range(n):coords[f"{pX}:{pY}"] = []pY = 0pX = 0t = 0while pY < n:mY = [i[pX] for i in matrix]mX = [i for i in matrix[pY]]for i in range(n):if mY[i] < matrix[pY][pX] and i != pY:coords[f"{pX}:{pY}"].append(f"{pX}:{i}")#mY[i] = [mY[i], True]#else:# mY[i] = [mY[i], False]if mX[i] < matrix[pY][pX] and i != pX:coords[f"{pX}:{pY}"].append(f"{i}:{pY}")#mX[i] = [mX[i], True]#else:# mX[i] = [mX[i], False]#if mY[i][1] == True:# coords[f"{pX}:{pY}"].append(f"{pX}:{i}")#if mX[i][1] == True:# coords[f"{pX}:{pY}"].append(f"{i}:{pY}")if pX == n - 1:pY += 1t += 1pX += 1if pX == n:pX = 0return coordsdef bfs(coords=possible_moves(), n=n):queue = []cache = {}lens = 0a = 0temp = 0for i in coords.keys():lens += len(coords[i])queue.append(i)while len(queue) > 0:m = queue.pop(0)if m in cache:a += cache[m][0]queue.extend(cache[m][1])continuefor j in coords[m]:temp += 1queue.append(j)cache[m] = [temp, coords[m]]a += temptemp = 0print((a + n ** 2) % (10 ** 9 + 7))if __name__ == "__main__":bfs()
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) |