Submission #1194210

#	Time	Username	Problem	Language	Result	Execution time	Memory
1194210		zh_h	Cyberland (APIO23_cyberland)	C++17	0 / 100	16 ms	5444 KiB

cyberland

#include <bits/stdc++.h>
#define pb push_back
#define lint long long int
using namespace std;

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>>> edge(n);
    for (int i = 0; i < m; i ++) {
        edge[x[i]].pb({y[i], c[i]});
    }

    priority_queue<pair<int, int>> pq;
    vector<bool> visited(n, false);
    vector<int> dist(n, 1e9);

    dist[0] = 0;
    pq.push({0, 0});
    while (!pq.empty()) {
        int v = pq.top().second;
        pq.pop();

        if (visited[v]) continue;
        visited[v] = true;

        for (auto [vv, w] : edge[v]) {
            if (dist[vv] > dist[v]+w) {
                dist[vv] = dist[v]+w;
                pq.push({-dist[vv], vv});
            }
        }
    }

    return (double)dist[h];
}

• 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