Lennot

input/code.cpp: In function 'int main()':
input/code.cpp:40:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (plusgoodlong i = 0; i < v[s].size(); i++) {
                              ^

#include <iostream>
#include <queue>

using namespace std;

#define fromto(var, from, to) for (plusgoodlong var = from; var < to; var++)
#define times(k) for (plusgoodlong __xxxx__ = 0; __xxxx__ < k; __xxxx__++)
#define INF 99999999999999

typedef long long plusgoodlong;

int main() {
	cin.sync_with_stdio(false);
	plusgoodlong n, m;
	cin >> n >> m;
	
	vector<pair<plusgoodlong,plusgoodlong> > v[1+2*n];
	
	times(m) {
		plusgoodlong a, b, h;
		cin >> a >> b >> h;
		v[a].push_back(make_pair(n+b, h));
		v[n+a].push_back(make_pair(b, 0));
	}
	
	priority_queue<pair<plusgoodlong,plusgoodlong> > q;
	plusgoodlong t[1+2*n], e[1+2*n];
	
	fromto(i, 1, 1+2*n) t[i] = 0;
	
	for (plusgoodlong i = 1; i <= n*2; i++) e[i] = INF;
	e[1] = 0;
	q.push(make_pair(0,1));
	while (!q.empty()) {
		plusgoodlong x = -q.top().first;
		plusgoodlong s = q.top().second;
		q.pop();
		if (t[s]) continue;
		t[s] = 1;
		for (plusgoodlong i = 0; i < v[s].size(); i++) {
			plusgoodlong 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]) << 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: 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: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED