DMOJ · dmopc16c4p5

DMOPC '16 Contest 4 P5 - Migrant Mascot

This C++ solution uses dijkstra's algorithm for DMOJ dmopc16c4p5 DMOPC '16 Contest 4 P5 - Migrant Mascot. Read the reasoning, inspect the code, or try your own test case below.

dmopc16c4p5Graphs & treesDijkstra's algorithmC++34 lines
Solution142of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Dijkstra's algorithm

Migrant Mascot asks for widest-path values from node 1; the maximin Dijkstra matches.

Graphs & trees

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

P_5_Migrant_Mascot.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n, m; cin >> n >> m;
        vector<vector<pair<int, int>>> adj(n + 1);
        for (int i = 0; i < m; i++) {
            int u, v, w; cin >> u >> v >> w;
            adj[u].emplace_back(w, v);
            adj[v].emplace_back(w, u);
        }
        vector<int> dist(n + 1, 0);
        dist[1] = inf;
        priority_queue<pair<int, int>> pq;
        pq.push({inf, 1});
        while (!pq.empty()) {
            auto[w, cur] = pq.top(); pq.pop();
            if (w < dist[cur]) continue;
            for (auto[wt, v] : adj[cur]) {
                if (min(w, wt) > dist[v]) {
                    dist[v] = min(w, wt);
                    pq.push({min(w, wt), v});
                }
            }
        }
        cout << 0 << '\n';
        for (int i = 2; i <= n; i++) {
            cout << dist[i] << '\n';
        }
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.