Lennot

#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
from sys import stdin
import gc

maxint = sys.maxint

def readline():
    return stdin.readline().strip()

line1 = readline().split(' ')
# Kaupunkeja
n = int(line1[0])
# Lentoja
m = int(line1[1])

# Tuple indexes
fl_from = 0
fl_to = 1
fl_price = 2

ct_total_price_even = 0
ct_even_price_set = 1
ct_total_price_odd = 2
ct_odd_price_set = 3
ct_total_price = 4
ct_calculated = 5
ct_con_to = 6
ct_in_uncalc = 7
ct_aid = 8

def minimum(a, b):
    if a < b:
        return a
    else:
        return b


def run():
    # Generate all cities
    def gen(i):
        return [maxint, False, maxint, False, maxint, False, [], False, i]
    cities = map(gen, xrange(n))
    
    # Generate all flights for the cities
    gc.disable()
    for f in xrange(m):
        row = readline().split()
        flight = (int(row[0])-1, int(row[1])-1, int(row[2]))
        cities[flight[fl_from]][ct_con_to].append(flight)
    gc.enable()
    
    # Determine start, end, and current cities
    start = cities[0]
    end = cities[-1]
    current = start
    
    # GC - kinda not needed anymore?
    gc.collect()
    
    # Define initial uncalculated-array
    uncalculated = [current]
    # Make variables for uncalculated's commonly used functions
    append_to_uncalculated = uncalculated.append
    remove_from_uncalculated = uncalculated.remove

    # Set initial data to current-node
    current[ct_total_price_even] = 0
    current[ct_even_price_set] = True
    
    
    # (This while is broken via a brake-statement)
    while True:
        if current[ct_aid] == end[ct_aid]:
            # Finished!
            print(end[ct_total_price])
            break
        
        # Store commonly used values from current
        even_set = current[ct_even_price_set]
        even_cur = current[ct_total_price_even]
        odd_set = current[ct_odd_price_set]
        odd_cur = current[ct_total_price_odd]
        # Calculate distances from current to next nodes
        for flight in current[ct_con_to]:
            city = cities[flight[fl_to]]
            price_changed = False
            # Calculate next node's odd value
            if even_set:
                new_odd_price = even_cur + flight[fl_price]
                if new_odd_price < city[ct_total_price_odd]:
                    city[ct_total_price_odd] = new_odd_price
                    city[ct_odd_price_set] = True
                    price_changed = True
            
            # Calculate next node's even value
            if odd_set:
                new_even_price = odd_cur
                if new_even_price < city[ct_total_price_even]:
                    city[ct_total_price_even] = new_even_price
                    city[ct_even_price_set] = True
                    price_changed = True
            # If price of target city was changed...
            if price_changed:
                # Calculate new minimum distance to node
                city[ct_total_price] = minimum(city[ct_total_price_even], city[ct_total_price_odd])
                # Add node to the uncalculated list, to be calculated from
                if city[ct_calculated]:
                    city[ct_calculated] = False
                    append_to_uncalculated(city)
                    city[ct_in_uncalc] = True
                elif not city[ct_in_uncalc]:
                    append_to_uncalculated(city)
                    city[ct_in_uncalc] = True
        
        # Remove current node from the uncalculated-list -- it is now calculated
        remove_from_uncalculated(current)
        current[ct_calculated] = True
        
        # Find next city to set as current
        smallest_price = maxint
        for city in uncalculated:
            cityprice = city[ct_total_price]
            if cityprice < smallest_price:
                smallest = city
                smallest_price = cityprice
        
        current = smallest
        
import profile # debug
profile.run('run()')
# run()

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: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED