Lennot

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>

using namespace std;

typedef signed long long int ll;

const int N = 10000;

vector<pair<ll, ll> > vertices[2*N];
priority_queue<pair<ll, ll>, vector<pair<ll, ll> >, greater<pair<ll, ll> > > todo;
ll visited[2*N], distances[2*N];

int main() {

    int n, m;
    
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a, b, h;
        cin >> a >> b >> h;
        vertices[a-1].push_back(pair<ll, ll>(b-1+n, h));
        vertices[a-1+n].push_back(pair<ll, ll>(b-1, 0));
    }

    for (int i = 0; i < 2*n; i++) {
        distances[i] = 1000000000;
    }

    distances[0] = 0;
    todo.push(make_pair(0,0));
    while (!todo.empty()) {

        ll dist = todo.top().first;
        ll s = todo.top().second;

        todo.pop();
        if (visited[s]) {
            continue;
        }
        visited[s] = 1;

        for (size_t i = 0; i < vertices[s].size(); i++) {

            ll u = vertices[s][i].first;

            if (dist + vertices[s][i].second < distances[u]) {
                distances[u] = dist + vertices[s][i].second;
                todo.push(make_pair(distances[u], u));
            }
        }
    }

    cout << min(distances[n-1], distances[2*n-1]) << endl;

    return 0;
}

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