Lennot

#!/dev/null

k, l = [int(i) for i in raw_input().split()]
y = []
for q in range(l):
    y.append([int(i) for i in raw_input().split()])

class Node:
    def __init__(self, nid):
        self.id = nid
        self.links = []
        self.number = 0
class Link:
    def __init__(self, tid, cost):
        self.targetid = tid
        self.target = graph[tid]
        self.cost = cost
graph = [Node(q) for q in range(k)]
for q in y:
    graph[q[0]-1].links.append(Link(q[1]-1, q[2]))

for v in graph:
    v.dist = float("inf")
    v.prev = None

graph[0].dist = 0
while graph:
    u = graph.pop(min([[n.dist,i] for i,n in enumerate(graph)])[1])
    for v in u.links:
        alt = u.dist + (v.cost)*((u.number+1)%2)
        v = v.target
        if alt < v.dist:
            v.dist = alt
            v.prev = u
            v.number = u.number+1
print u.dist

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: RUNTIME ERROR

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED