CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:Parodontax
Submission time:2022-11-02 23:22:16 +0200
Language:PyPy3
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.06 s1, 2, 3details
#20.06 s1, 2, 3details
#30.07 s1, 2, 3details
#40.07 s1, 2, 3details
#50.06 s1, 2, 3details
#60.07 s1, 2, 3details
#70.06 s2, 3details
#80.07 s2, 3details
#90.06 s2, 3details
#100.07 s2, 3details
#110.07 s3details
#120.06 s3details
#130.07 s3details
#140.07 s3details
#150.07 s3details
#160.07 s3details

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() and (i, j) not in c:
                largestNum = ruudukko[i][j]
                startPoint = (i, j)
    return startPoint

c = []
while True:
    startPoint = findStartPoint()
    if not startPoint:
        break
    if len(getPoints(startPoint)) == 0:
        c.append(startPoint)
        continue
    points[startPoint] = []
    getPaths(startPoint, oldPath=[startPoint])

for i, j in points.items():
    if i not in points[i]:
        points[i].append(i)

ans = 0

for i in points.values():
    ans += len(i)

print(ans)

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
0 0 1 0 0 0 0 0 0 0

correct output
2

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 2

Group: 1, 2, 3

Verdict:

input
0 0 0 0 0 0 1 0 0 0

correct output
3

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 3

Group: 1, 2, 3

Verdict:

input
0 0 1 0 1 0 0 0 0 0

correct output
4

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 4

Group: 1, 2, 3

Verdict:

input
2 0 1 1 0 0 1 0 2 0

correct output
10

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 5

Group: 1, 2, 3

Verdict:

input
9 3 1 1 2 2 3 1 6 1

correct output
27

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 6

Group: 1, 2, 3

Verdict:

input
10 4 3 4 3 2 2 4 3 7

correct output
36

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 7

Group: 2, 3

Verdict:

input
71 53 36 30 25 29 42 24 34 29

correct output
199

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 8

Group: 2, 3

Verdict:

input
71 33 46 38 27 45 36 21 35 35

correct output
205

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 9

Group: 2, 3

Verdict:

input
93 38 35 26 43 54 38 25 41 34

correct output
222

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 10

Group: 2, 3

Verdict:

input
100 33 33 45 36 43 38 54 56 36

correct output
242

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 11

Group: 3

Verdict:

input
3419 1797 1845 1849 1879 1791 ...

correct output
5959

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 12

Group: 3

Verdict:

input
4776 2695 2709 2781 2616 2753 ...

correct output
8391

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 13

Group: 3

Verdict:

input
20097 12282 12229 12214 12406 ...

correct output
32001

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 14

Group: 3

Verdict:

input
47934 29918 29878 29713 29984 ...

correct output
71718

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 15

Group: 3

Verdict:

input
84691 54156 54277 54533 54296 ...

correct output
123123

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...

Test 16

Group: 3

Verdict:

input
99098 63339 63878 64182 63904 ...

correct output
142663

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 6, in <module>
    n = int...