Submission #74228230

---

Source Code Expand

#include <iostream>
#include <vector>
#include<map>
#include<set>
#include<deque>
#include <queue>
#include <functional>

using namespace std;
#define int long long
const int inf = 1e18;

void solve(){

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

    vector<vector<int>> graph(n + 1);

    for(int i = 1; i <= m; i++){
        int u, v, w; cin >> u >> v >> w;

        if(w >= k){
            graph[u].push_back(v);
            graph[v].push_back(u);
        }
    }

    queue<int> q;
    q.push({1});

    vector<int> dist(n + 1, -1);
    dist[1] = 0;

    while(!q.empty()){
        int u = q.front();
        q.pop();

        for(int &v: graph[u]){
            if(dist[v] != -1) continue;

            dist[v] = dist[u] + 1;
            q.push(v);
        }
    }

    cout << dist[n] << endl;
}


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) solve();
}

Submission Info

Judge Result