Submission #1987859

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = 1e17 - 10;
const double PI = acos(-1);
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, LL> Vec2;
typedef tuple<LL, LL, LL> Tll;
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,n) for(LL i=n-1;i>=0;i--)
struct Edge { LL to, cost; };
vector<Edge>vec[1100000];
LL h[1100000], w, n, m, s, t, sum, ans = 0, d[1100000], mn;
void DIUX(LL s) {
	for (int i = 0; i < 1100000; i++)
		d[i] = INF;
	d[s] = 0;
	priority_queue<Ppll, vector<Ppll>, greater<Ppll>> pq;
	pq.push(make_pair(d[s], Pll(s, 0))); // (cost,頂点番号) 
	while (!pq.empty()) {
		Ppll pp;
		pp = pq.top();
		LL cos = pp.first, vv = pp.second.first, nn = pp.second.second;
		pq.pop();
		if (d[vv] < pp.first)continue;
		rep(i, vec[vv].size()) {
			if (nn == vec[vv][i].cost&&d[vv] < d[vec[vv][i].to]) {
				d[vec[vv][i].to] = d[vv];
				pq.push(make_pair(d[vec[vv][i].to], Pll(vec[vv][i].to, vec[vv][i].cost)));
			}
			if (d[vv] + 1 < d[vec[vv][i].to]) {
				d[vec[vv][i].to] = d[vv] + 1;
				pq.push(make_pair(d[vec[vv][i].to], Pll(vec[vv][i].to, 0)));
			}
		}
	}
}

int main() {
	cin >> n >> m;
	rep(i, m) {
		cin >> s >> t >> w;
		vec[s].push_back(Edge{ t,w });
		vec[t].push_back(Edge{ s,w });
	}
	DIUX(n);
	mn = d[1];
	DIUX(1);
	mn = min(mn, d[n]);
	cout << (mn == INF ? -1 : mn) << endl;
	return 0;
}

Submission Info

Judge Result