Task: | Ruudukko |
Sender: | Parodontax |
Submission time: | 2022-11-02 23:01:22 +0200 |
Language: | Python3 (PyPy3) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
#2 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
#3 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
#4 | WRONG ANSWER | 0.05 s | 2, 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#7 | WRONG ANSWER | 0.14 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
import time import sys sys.setrecursionlimit(100000) n = int(input()) ruudukko = [] points = {} for i in range(n): row = [] a = input() x = a.split(" ") for i in x: row.append(int(i)) ruudukko.append(row) def getPoints(startPoint): nextPoints = [] i = startPoint[0] j = startPoint[1] i2 = 0 j2 = 0 # Horizontal while i2 < n: if ruudukko[i2][j] < ruudukko[i][j] and i2 != i: nextPoints.append((i2, j)) i2 += 1 # Vertical while j2 < n: if ruudukko[i][j2] < ruudukko[i][j] and j2 != j: nextPoints.append((i, j2)) j2 += 1 return nextPoints def getPaths(currentPoint, oldPath): nextPoints = getPoints(currentPoint) for z in nextPoints: tempPath = oldPath[:] tempPath.append(z) earlierPoints = oldPath[:len(oldPath) - 1] for k in range(len(earlierPoints)): earlierPath = earlierPoints[1:] for v in tempPath: earlierPath.append(v) if earlierPoints[k] not in points.keys(): points[earlierPoints[k]] = [] if earlierPath not in points[earlierPoints[k]]: points[earlierPoints[k]].append(earlierPath) getPaths(z, tempPath) if currentPoint not in points.keys(): points[currentPoint] = [] if tempPath not in points[currentPoint]: points[currentPoint].append(tempPath) def findStartPoint(): startPoint = None largestNum = 0 for i in range(n): for j in range(n): if ruudukko[i][j] > largestNum and (i, j) not in points.keys(): largestNum = ruudukko[i][j] startPoint = (i, j) return startPoint startPoint = findStartPoint() points[startPoint] = [] getPaths(startPoint, oldPath=[startPoint]) for i, j in points.items(): if i not in points[i]: points[i].append(i) ans = 0 print(points) for i in points.values(): ans += len(i) print(ans)
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 1 1 1 1 1 1 1 1 1 |
correct output |
---|
9 |
user output |
---|
{(0, 0): [(0, 0)]} 1 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 1 2 3 6 5 4 7 8 9 |
correct output |
---|
135 |
user output |
---|
{(2, 2): [[(2, 2), (0, 2), (0,... Truncated |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
{(2, 1): [[(2, 1), (0, 1), (1,... Truncated |
Test 4
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
10000 |
user output |
---|
{(0, 0): [(0, 0)]} 1 |
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: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000000 |
user output |
---|
{(0, 0): [(0, 0)]} 1 |
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) |