Submission #985105

#	Time	Username	Problem	Language	Result	Execution time	Memory
985105		SabyrAl	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	29 ms	5724 KiB

cyberland

#include <bits/stdc++.h>

using namespace std;

double djicstra(int n, int m, int k, int h, vector<vector<pair<int, int> > >& g, vector<int>& arr) {
    vector<int> dist(n, 1e9);
    dist[0] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q;
    q.push({0, 0});
    while(!q.empty()) {
        auto [d, v] = q.top();
        q.pop();
        if (d != dist[v]) continue;
        for (auto [to, c] : g[v]) {
            q.push({c + d, to});
            dist[to] = min(c + d, dist[to]);
        }
    }
    return dist[h];
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    vector<vector<pair<int, int> > > g(N);
    for (int i = 0; i < M; i++) {
        g[x[i]].push_back({y[i], c[i]});
        g[y[i]].push_back({x[i], c[i]});
    }
    return djicstra(N, M, K, H, g, arr);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3