Submission #758958

#	Time	Username	Problem	Language	Result	Execution time	Memory
758958		Dexva	Voting Cities (NOI22_votingcity)	C++14	0 / 100	7 ms	724 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define lln long long
#define INF 0x3f3f3f3f
using pii = pair<int, int>;

struct edge {
    int v;
    int weight;
};

int main() {
    int n, e; cin >> n >> e;
    vector< vector<edge> > adj(n);
    for (int i=0;i<e;i++) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v,w}); //insert the edge essentially
        adj[v].push_back({u,w}); //if undirected graph only
    }
    int source; cin >> source;

    vector<int> d(n, INF); // or use numeric_limits<int>::max()
    vector<bool> done(n);
    priority_queue<pii, vector<pii>, greater<pii> > pq;

    pq.push({0, source});
    d[source] = 0;

    while(!pq.empty()) {
        pii k = pq.top(); pq.pop();
        int u = k.second;
        if(!done[u]) {
            for (edge& e : adj[u]) {
                if (d[e.v] > d[u] + e.weight) {
                    d[e.v] = d[u] + e.weight;
                    pq.push({d[e.v], e.v});
                }
            }
            done[u] = true;
        }
    }


    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 10
• Subtask 7: 0 / 15
• Subtask 8: 0 / 50