96Z8Pm - Online C++0x Compiler & Debugging Tool

#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;

tuple<vector<int>, vector<int>, vector<long long>>
bfsShortestMaxFiveCount(int n, const vector<vector<int>>& g, const vector<int>& val) {
    vector<int> dist(n+1, -1), max5(n+1, -1);
    vector<long long> ways(n+1, 0);
    queue<int> q;

    dist[1] = 0;
    max5[1] = (val[1] == 5 ? 1 : 0);
    ways[1] = 1;
    q.push(1);

    while (!q.empty()) {
        int v = q.front(); q.pop();
        for (int u : g[v]) {
            int add = (val[u] == 5 ? 1 : 0);
            if (dist[u] == -1) {                 // first time: shortest
                dist[u] = dist[v] + 1;
                max5[u] = max5[v] + add;
                ways[u] = ways[v];
                q.push(u);
            } else if (dist[u] == dist[v] + 1) { // another shortest path
                int cand5 = max5[v] + add;
                if (cand5 > max5[u]) {           // better 5-count replaces
                    max5[u] = cand5;
                    ways[u] = ways[v];
                } else if (cand5 == max5[u]) {   // tie: add ways
                    ways[u] += ways[v];
                }

            }

        }
    }
    return {dist, max5, ways};
}

int main() {
    int n, m;
    cin >> n >> m;

    vector<int> val(n+1);
    for (int i = 1; i <= n; ++i) cin >> val[i];

    vector<vector<int>> g(n+1);
    for (int i = 0; i < m; ++i) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    auto [dist, max5, ways] = bfsShortestMaxFiveCount(n, g, val);


    for (int i = 1; i <= n; ++i) {
        cout << dist[i] << " " << max5[i] << " " << ways[i] << "\n";
    }
    return 0;
}