Task: | Ruudukko |
Sender: | hoodarm |
Submission time: | 2022-11-08 17:26:37 +0200 |
Language: | Python3 (CPython3) |
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.02 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
#4 | TIME LIMIT EXCEEDED | -- | 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
# Python 3 program to count all paths# from a source to a destination.# A directed graph using adjacency# list representationclass Graph:def __init__(self, V):self.V = Vself.adj = [[] for i in range(V)]def addEdge(self, u, v):# Add v to u’s list.self.adj[u].append(v)# Returns count of paths from 's' to 'd'def countPaths(self, s, d):# Mark all the vertices# as not visitedvisited = [False] * self.V# Call the recursive helper# function to print all pathspathCount = [0]self.countPathsUtil(s, d, visited, pathCount)return pathCount[0]# A recursive function to print all paths# from 'u' to 'd'. visited[] keeps track# of vertices in current path. path[]# stores actual vertices and path_index# is current index in path[]def countPathsUtil(self, u, d,visited, pathCount):visited[u] = True# If current vertex is same as# destination, then increment countif (u == d):pathCount[0] += 1# If current vertex is not destinationelse:# Recur for all the vertices# adjacent to current vertexi = 0while i < len(self.adj[u]):if (not visited[self.adj[u][i]]):self.countPathsUtil(self.adj[u][i], d,visited, pathCount)i += 1visited[u] = FalsenoOfVertices = int(input())counter = 1index = 0Grid={}while (counter<=noOfVertices):rowNo = counternumbers = list(map(int, input().split()))coloumnNo = 1for coloumnNo in range(1,noOfVertices+1):Grid[index] = [numbers[coloumnNo-1],(rowNo,coloumnNo)]index=index+1counter=counter+1g = Graph(noOfVertices*noOfVertices)for index,value in Grid.items():for index2,otherValue in Grid.items():if ((value[1][0]==otherValue[1][0] or value[1][1]==otherValue[1][1]) and otherValue[0]<value[0]):g.addEdge(index,index2)noOfPaths = 0for coordinate,value in Grid.items():for otherCoordinate,otherValue in Grid.items():noOfPaths = noOfPaths + g.countPaths(coordinate,otherCoordinate)print (noOfPaths%(1000000007))
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: TIME LIMIT EXCEEDED
input |
---|
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
10000 |
user output |
---|
(empty) |
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) |