Lennot

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

using namespace std;
typedef long long ll;
typedef pair<int, ll> ill;
typedef vector<ill> vill;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define INF 1e15+5
#define DE 100005

int n, m;
vill g[100005];
ll e[2*100005];
int z[100005];

int main() {
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a, b, h;
        cin >> a >> b >> h;
        g[a].PB(MP(b, h));
    }
    for (int i = 1; i < 100005; ++i) {
        e[i] = INF;
        e[i+DE] = INF;
    }
    priority_queue<pair<ll, int>> q;
    e[1] = 0;
    q.push(MP(0, 1));
    while (!q.empty()) {
        int a = q.top().S;
        q.pop();
        if (z[a]) continue;
        z[a] = 1;
        for (auto b : g[a]) {
            ll d1 = e[a+DE];
            ll d2 = e[a] + b.S;
            if (d1 < e[b.F]) {
                e[b.F] = d1;
                z[a] = 0;
            }
            //e[b.F] = min(e[b.F], d1);
            if (d2 < e[(b.F)+DE]) {
                e[(b.F)+DE] = d2;
                z[a] = 0;
            }
            //e[(b.F)+DE] = min(e[(b.F)+DE], d2);
            q.push(MP(-min(e[b.F], e[(b.F)+DE]), b.F)); 
        }
    }
    cout << min(e[n], e[n+DE]) << "\n";
    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: ACCEPTED

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

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: WRONG ANSWER