CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:Finnduino
Submission time:2022-11-01 14:39:36 +0200
Language:Python3 (PyPy3)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.04 s1, 2, 3details
#20.04 s1, 2, 3details
#30.04 s1, 2, 3details
#40.06 s2, 3details
#5--2, 3details
#6--2, 3details
#70.35 s3details
#8--3details
#9--3details

Code

GridSize = int(input())
Grid = []
NextMovement = []
paths = 0
for p in range(0, GridSize, 1):
GridRow = input().split()
for x in range(0, len(GridRow)):
Grid.append(GridRow[x])
counter = 0
def CheckDirections(x,y,NextMovement, multiplier):
global Grid
global paths
global GridSize
position = y*GridSize+x
#Check up
if y > 0:
if(Grid[position-GridSize] < Grid[position]):
NextMovement.append([x,y-1])
paths +=multiplier
#Check down
if y < GridSize-1:
if(Grid[position+GridSize] < Grid[position]):
NextMovement.append([x,y+1])
paths += multiplier
#Check left
if x > 0:
if(Grid[position-1]< Grid[position]):
NextMovement.append([x-1,y])
paths += multiplier
#Check right
if x < GridSize-1:
if(Grid[position+1]< Grid[position]):
NextMovement.append([x+1,y])
paths += multiplier
#--------------------Checking for second route--------------
if y-1 > 0:
if(Grid[position-GridSize*2] < Grid[position]):
NextMovement.append([x,y-2])
paths += multiplier
#Check down
if y+1 < GridSize-1:
if(Grid[position+GridSize*2] < Grid[position]):
NextMovement.append([x,y+2])
paths += multiplier
#Check left
if x-1 > 0:
if(Grid[position-2]< Grid[position]):
NextMovement.append([x-2,y])
paths += multiplier
#Check right
if x+1 < GridSize-1:
if(Grid[position+2]< Grid[position]):
NextMovement.append([x+2,y])
paths += multiplier
for y in range(0, GridSize):
for x in range(0, GridSize):
CheckDirections(x,y, NextMovement, 1)
multiplier = 1
while(len(NextMovement) > 0):
MovementArray=[]
for i in range(0, len(NextMovement)):
CheckDirections(NextMovement[i][0],NextMovement[i][1], MovementArray, multiplier)
NextMovement = MovementArray
multiplier += 1
result = paths%(10**9+7)
print(paths)

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
3
1 1 1
1 1 1
1 1 1

correct output
9

user output
0

Test 2

Group: 1, 2, 3

Verdict:

input
3
1 2 3
6 5 4
7 8 9

correct output
135

user output
329

Test 3

Group: 1, 2, 3

Verdict:

input
3
7 8 1
4 5 4
3 9 6

correct output
57

user output
65

Test 4

Group: 2, 3

Verdict:

input
100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
10000

user output
0

Test 5

Group: 2, 3

Verdict:

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:

input
100
2995 8734 1018 2513 7971 5063 ...

correct output
964692694

user output
(empty)

Test 7

Group: 3

Verdict:

input
1000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
1000000

user output
0

Test 8

Group: 3

Verdict:

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:

input
1000
520283 805991 492643 75254 527...

correct output
951147313

user output
(empty)