Sadonkorjuu

#import math
#import numpy
import math
CityCount = int(input())
CityStates = input().split()
RoadList = []

#Build a nested array of roads
for n in range(0,CityCount-1):
    temp = input().split()
    RoadList.append(temp)

#Convert to numpy array
#RoadMatrix = numpy.array(RoadList)

RoadDict = {}

#Cycle through roads to find ones that connect to a given node, then build a dictionary which indexes each connected road
for a in range(0,CityCount):
    tempList = []
    #Roads
    for b in range(0, CityCount-1):
        if(int(RoadList[b][0]) == a+1):
           tempList.append([RoadList[b][1],RoadList[b][2]])
        elif(int(RoadList[b][1]) == a+1):
           tempList.append([RoadList[b][0],RoadList[b][2]])
    RoadDict[a] = tempList

#Actually find something
currentNode = 0
nodeDistances = [0]+[math.inf]*(CityCount-1)
totalDistances = 0

for i in range(0, CityCount):
    #Checking if is a producer node, not a port node
    totalDistance = 0
    if(CityStates[i] == "1"):
        visitingNode = i
    #Loop stays true until port is found
        portfound = False
        visitedNodes = [False]*(CityCount)
        while(not portfound):
            nodeIO = RoadDict[visitingNode]
            portfound = False
            smallestWeight = math.inf
            smallestWeightNode = 0
            #Cycles through connections
            for connection in range(0, len(nodeIO)):
                #Checks if viewed node is port node
                if(CityStates[int(nodeIO[connection][0])-1] == "0"):
                    #Found port!
                    totalDistance += int(nodeIO[connection][1])
                    portfound = True
                #attempt to counteract double measuring when pathfinding UNSUCCESSFUL 
                #Build a framework which captures all moves, and adds nodes to a list. Then cycle through said list and sum the weights 
                #elif(visitedNodes[connection]):
                 #   totalDistance -= int(nodeIO[connection][1])
                #if not a port, which near node is the closest, and set that as the destination
                elif(int(nodeIO[connection][1])<smallestWeight and not visitedNodes[connection] and not connection == i):
                    smallestWeight = int(nodeIO[connection][1])
                    smallestWeightNode = int(nodeIO[connection][0])-1 
                    visitedNodes[connection] = True
            #if port wasnt found, iterate through
            if(not portfound):
                totalDistance += int(nodeIO[connection][1])
                visitingNode = smallestWeightNode              
    totalDistances += totalDistance
print(totalDistances)

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 1, 2

Verdict: WRONG ANSWER

Test 17

Group: 1, 2

Verdict: WRONG ANSWER

Test 18

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 1, 2

Verdict: WRONG ANSWER

Test 20

Group: 1, 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 30

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED