CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Ratsun reitit
Sender:	tassu
Submission time:	2020-09-28 09:02:39 +0300
Language:	CPython3
Status:	READY
Result:	27

Feedback
group	verdict	score
#1	ACCEPTED	27
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2, 3	details
#2	ACCEPTED	0.03 s	1, 2, 3	details
#3	ACCEPTED	0.03 s	1, 2, 3	details
#4	ACCEPTED	0.04 s	1, 2, 3	details
#5	ACCEPTED	0.07 s	1, 2, 3	details
#6	ACCEPTED	0.14 s	1, 2, 3	details
#7	ACCEPTED	0.27 s	1, 2, 3	details
#8	TIME LIMIT EXCEEDED	--	2, 3	details
#9	RUNTIME ERROR	0.03 s	2, 3	details
#10	RUNTIME ERROR	0.03 s	2, 3	details
#11	RUNTIME ERROR	0.03 s	3	details
#12	RUNTIME ERROR	0.03 s	3	details
#13	RUNTIME ERROR	0.03 s	3	details

Code

size = int(input())
matrix = [[999999]*size for i in range(size)]
matrix[0][0] = 0

def get_possibilities_for_point(x, y):
    global size
    points = filter(lambda point: not (point[0] < 0 or point[0] >= size or point[1] < 0 or point[1] >= size), [
        [x-2, y-1],
        [x-2, y+1],
        [x+2, y-1],
        [x+2, y+1],
        [x-1, y-2],
        [x-1, y+2],
        [x+1, y-2],
        [x+1, y+2],
    ])

    return list(points)

def kay_lapi(x, y, count=1):
    for point in get_possibilities_for_point(x, y):
        if matrix[point[0]][point[1]] < count:
            continue
        matrix[point[0]][point[1]] = count
        kay_lapi(point[0], point[1], count+1)


kay_lapi(0, 0)

for row in matrix:
    print(' '.join(str(x) for x in row))

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4` view save

correct output
`0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2` view save

user output
`0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`5` view save

correct output
`0 3 2 3 2 3 4 1 2 3 2 1 4 3 2 3 2 3 2 3 2 3 2 3 4` view save

user output
`0 3 2 3 2 3 4 1 2 3 2 1 4 3 2 3 2 3 2 3 2 3 2 3 4` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`6` view save

correct output
`0 3 2 3 2 3 3 4 1 2 3 4 2 1 4 3 2 3 3 2 3 2 3 4 2 3 2 3 4 3 ...` view save

user output
`0 3 2 3 2 3 3 4 1 2 3 4 2 1 4 3 2 3 3 2 3 2 3 4 2 3 2 3 4 3 ...` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`7` view save

correct output
`0 3 2 3 2 3 4 3 4 1 2 3 4 3 2 1 4 3 2 3 4 3 2 3 2 3 4 3 2 3 2 3 4 3 4 ...` view save

user output
`0 3 2 3 2 3 4 3 4 1 2 3 4 3 2 1 4 3 2 3 4 3 2 3 2 3 4 3 2 3 2 3 4 3 4 ...` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`8` view save

correct output
`0 3 2 3 2 3 4 5 3 4 1 2 3 4 3 4 2 1 4 3 2 3 4 5 3 2 3 2 3 4 3 4 2 3 2 3 4 3 4 5 ...` view save

user output
`0 3 2 3 2 3 4 5 3 4 1 2 3 4 3 4 2 1 4 3 2 3 4 5 3 2 3 2 3 4 3 4 2 3 2 3 4 3 4 5 ...` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`9` view save

correct output
`0 3 2 3 2 3 4 5 4 3 4 1 2 3 4 3 4 5 2 1 4 3 2 3 4 5 4 3 2 3 2 3 4 3 4 5 2 3 2 3 4 3 4 5 4 ...` view save

user output
`0 3 2 3 2 3 4 5 4 3 4 1 2 3 4 3 4 5 2 1 4 3 2 3 4 5 4 3 2 3 2 3 4 3 4 5 2 3 2 3 4 3 4 5 4 ...` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10` view save

correct output
`0 3 2 3 2 3 4 5 4 5 3 4 1 2 3 4 3 4 5 6 2 1 4 3 2 3 4 5 4 5 3 2 3 2 3 4 3 4 5 6 2 3 2 3 4 3 4 5 4 5 ...` view save

user output
`0 3 2 3 2 3 4 5 4 5 3 4 1 2 3 4 3 4 5 6 2 1 4 3 2 3 4 5 4 5 3 2 3 2 3 4 3 4 5 6 2 3 2 3 4 3 4 5 4 5 ...` view save

Test 8

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`25` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
(empty)

Test 9

Group: 2, 3

Verdict: RUNTIME ERROR

input
`49` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 28, in <module>
    kay_lapi(0, 0)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  [Previous line repeated 991 more times]
  File "input/code.py", line 21, in kay_lapi
    for point in get_possibilities_for_point(x, y):
  File "input/code.py", line 18, in get_possibilities_for_point
    return list(points)
  File "input/code.py", line 7, in <lambda>
    points = filter(lambda point: not (point[0] < 0 or point[0] >= size or point[1] < 0 or point[1] >= size), [
RecursionError: maximum recursion depth exceeded in comparison

Test 10

Group: 2, 3

Verdict: RUNTIME ERROR

input
`50` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 28, in <module>
    kay_lapi(0, 0)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  [Previous line repeated 991 more times]
  File "input/code.py", line 21, in kay_lapi
    for point in get_possibilities_for_point(x, y):
  File "input/code.py", line 18, in get_possibilities_for_point
    return list(points)
  File "input/code.py", line 7, in <lambda>
    points = filter(lambda point: not (point[0] < 0 or point[0] >= size or point[1] < 0 or point[1] >= size), [
RecursionError: maximum recursion depth exceeded in comparison

Test 11

Group: 3

Verdict: RUNTIME ERROR

input
`75` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 28, in <module>
    kay_lapi(0, 0)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  [Previous line repeated 991 more times]
  File "input/code.py", line 21, in kay_lapi
    for point in get_possibilities_for_point(x, y):
  File "input/code.py", line 18, in get_possibilities_for_point
    return list(points)
  File "input/code.py", line 7, in <lambda>
    points = filter(lambda point: not (point[0] < 0 or point[0] >= size or point[1] < 0 or point[1] >= size), [
RecursionError: maximum recursion depth exceeded in comparison

Test 12

Group: 3

Verdict: RUNTIME ERROR

input
`99` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 28, in <module>
    kay_lapi(0, 0)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  [Previous line repeated 991 more times]
  File "input/code.py", line 21, in kay_lapi
    for point in get_possibilities_for_point(x, y):
  File "input/code.py", line 18, in get_possibilities_for_point
    return list(points)
  File "input/code.py", line 7, in <lambda>
    points = filter(lambda point: not (point[0] < 0 or point[0] >= size or point[1] < 0 or point[1] >= size), [
RecursionError: maximum recursion depth exceeded in comparison

Test 13

Group: 3

Verdict: RUNTIME ERROR

input
`100` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 28, in <module>
    kay_lapi(0, 0)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  File "input/code.py", line 25, in kay_lapi
    kay_lapi(point[0], point[1], count+1)
  [Previous line repeated 991 more times]
  File "input/code.py", line 21, in kay_lapi
    for point in get_possibilities_for_point(x, y):
  File "input/code.py", line 18, in get_possibilities_for_point
    return list(points)
  File "input/code.py", line 7, in <lambda>
    points = filter(lambda point: not (point[0] < 0 or point[0] >= size or point[1] < 0 or point[1] >= size), [
RecursionError: maximum recursion depth exceeded in comparison

Datatähti 2021 alku

Ratsun reitit

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Tasks

Submissions (tassu)