Lennot

#include <iostream>
#include <list>
#include <queue>
#include <climits>

using namespace std;

int main () {
  int n, m;
  int startnode, endnode, node;
  long long price;
  int midle;
  long long total;

  cin >> n;
  cin >> m;

  list<pair<long long, int>> v[n];
  priority_queue<pair<long long,int>> q;

  bool t[n+1];
  long long e[n+1];

  for (int i = 0; i < m; ++i) {
    cin >> startnode >> endnode >> price;
    if(startnode == n) continue;
    v[startnode].push_back(make_pair(price, endnode));
  }

  for (int i = 1; i <= n; ++i) {
    e[i] = LLONG_MAX;
    t[i] = false;
  }

  e[1] = 0;
  q.push(make_pair(0,1));

  while (!q.empty()) {
    price = -q.top().first;
    node = q.top().second;
    q.pop();
    if (t[node]) continue;
    if (node == n) {
      cout << price << endl;
      return 0;
    }
    t[node] = true;
    for (auto it = v[node].begin() ; it != v[node].end() ; ++it) {
      midle = it->second;
      total = price + it->first;

      if (midle == n) {
        if ( total < e[n]) {
          e[n] = total;
          q.push(make_pair(-total, n));
        }
      } else {
        for (auto it2 = v[midle].begin() ; it2 != v[midle].end() ; ++it2) {
          endnode = it2->second;
          if ( total < e[endnode]) {
            e[endnode] = total;
            q.push(make_pair(-total, endnode));
          }
        }
      }
    }
  }

  cout << "No route" << endl;

  return 1;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED