Lennot

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

using namespace std;

int main () {
  int n, m;
  int startnode, endnode, node;
  long long price;
  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];
  long long prices[n+1][n+1];

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

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

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

  while (!q.empty()) {
    price = -q.top().first;
    node = q.top().second;
    //cerr << node  << " - " << price << endl;
    q.pop();
    if (t[node]) continue;
    if (node == n) {
      cout << price << endl;
      return 0;
    }
    t[node] = true;

    if(prices[node][n] < LLONG_MAX && price + prices[node][n] < e[n]) {
      e[n] = price + prices[node][n];
      //cerr << "p1 " << n << " - " << e[n] << endl;
      q.push(make_pair(-e[n], n));
    }
    for (int i = 1; i < n ; ++i) {
      if (prices[node][i] == LLONG_MAX) continue;
      total = price + prices[node][i];
      for (int j = n; j > 1; --j) {
        if (prices[i][j] < LLONG_MAX && total < e[j]) {
          e[j] = total;
          //cerr << "p2 " << j << " - " << total << endl;
          q.push(make_pair(-total, j));
        }
      }
    }
  }

  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: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR

Test 16

Group: 3

Verdict: RUNTIME ERROR

Test 17

Group: 3

Verdict: RUNTIME ERROR