Osajono

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

using namespace std;

bool mySort(pair<long long, int> a, pair<long long, int> b) {
  return a.first < b.first;
}

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

  cin >> n;
  cin >> m;

  vector<pair<long long, int>> v[n+1];
  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[endnode].push_back(make_pair(price, startnode));
  }

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

  }

  //for (int i = 1; i < n; ++i) {
  //  sort(begin(v[i]), end(v[i]), mySort);
  //}

  e[n] = 0;
  q.push(make_pair(0,n));
  for (size_t i = 0; i < v[n].size(); ++i) {
    q.push(make_pair(-v[n][i].first, v[n][i].second));
  }

  while (!q.empty()) {
    price = -q.top().first;
    node = q.top().second;
    q.pop();
    if (t[node]) continue;
    if (node == 1) {
      cout << price << endl;
      return 0;
    }
    t[node] = true;
    for (size_t i = 0; i < v[node].size(); ++i) {
      total = price + v[node][i].first;
      if (total > e[1] - 2) continue;
      midle = v[node][i].second;
      for (size_t j = 0; j < v[midle].size() ; ++j) {
        endnode = v[midle][j].second;
        if ( total < e[endnode]) {
          e[endnode] = total;
          q.push(make_pair(-total, endnode));
        }
      }
    }
  }

  cout << "No route" << endl;

  return 1;
}

Test 1

Subtask: 1

Verdict: RUNTIME ERROR

Test 2

Subtask: 1

Verdict: RUNTIME ERROR

Test 3

Subtask: 1

Verdict: RUNTIME ERROR

Test 4

Subtask: 1

Verdict: RUNTIME ERROR

Test 5

Subtask: 1

Verdict: RUNTIME ERROR

Test 6

Subtask: 2

Verdict: RUNTIME ERROR

Test 7

Subtask: 2

Verdict: RUNTIME ERROR

Test 8

Subtask: 2

Verdict: RUNTIME ERROR

Test 9

Subtask: 2

Verdict: RUNTIME ERROR

Test 10

Subtask: 2

Verdict: RUNTIME ERROR

Test 11

Subtask: 3

Verdict: RUNTIME ERROR

Test 12

Subtask: 3

Verdict: RUNTIME ERROR

Test 13

Subtask: 3

Verdict: RUNTIME ERROR

Test 14

Subtask: 3

Verdict: RUNTIME ERROR

Test 15

Subtask: 3

Verdict: RUNTIME ERROR