Lennot

#include <iostream>
#include <vector>
#include <queue>
#define INF 999999999

using namespace std;

priority_queue<pair<long long, long long>> q;
int t[200000 + 2];
long long e[200000 + 2];
vector<pair<int, long long>> v[200000 + 2];

int main()
{

	int n, m;
	cin >> n >> m;

	for (int i = 0; i < m; i++)
	{
		int alku;
		int kohde;
		long long hinta;
		cin >> alku >> kohde >> hinta;
		v[alku].push_back(make_pair(kohde + n, hinta));
		v[alku + n].push_back(make_pair(kohde, 0));
	}

	for (int i = 1; i <= 2*n; i++) e[i] = INF;
	e[1] = 0;
	q.push(make_pair(0, 1));
	while (!q.empty()) {
		long long x = -q.top().first;
		long long s = q.top().second;
		q.pop();
		if (t[s]) continue;
		t[s] = 1;
		for (unsigned int i = 0; i < v[s].size(); i++) {
			int u = v[s][i].first;
			if (x + v[s][i].second < e[u]) {
				e[u] = x + v[s][i].second;
				q.push(make_pair(-e[u], u));
			}
		}
	}
	cout << min(e[n], e[2 * n]);
	cin.get();
	cin.get();
}

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