Submission #746047

#	Time	Username	Problem	Language	Result	Execution time	Memory
746047		vjudge1	Cities (BOI16_cities)	C++17	0 / 100	1 ms	212 KiB

cities

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


vector<vector<pair<int, int>>> g;
vector<int>dijkstra(int n, int node){
    vector<int> d(n, INT_MAX);
    priority_queue<pair<int, int>> pq;
    pq.push({0, node});
        d[node] = 0;
    while(!pq.empty()){
        int v = pq.top().second, d_v = -1 * pq.top().first;
        pq.pop();
        if(d[v] != d_v){
            continue;
        }
        for(auto edge : g[v]){
            if(d[edge.first] > d[v] + edge.second){
                d[edge.first] = d[v] + edge.second;
                pq.push({-1 * d[edge.first], edge.first});
            }
        }
    }
    return d;
}


int main() {
    return 0;
}

• Subtask 1: 0 / 22
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 26