Submission #985107

#	Time	Username	Problem	Language	Result	Execution time	Memory
985107		reverberation	Cyberland (APIO23_cyberland)	C++17	0 / 100	25 ms	5704 KiB

cyberland

#include <bits/stdc++.h>
using namespace std;
#define pll pair<int, int>
#define fs first
#define sc second
#define pb push_back
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> v) {
    vector<vector<pll>> g(n);
    for (int i = 0; i < m; i++) {
        int a = x[i], b = y[i], cost = c[i];
        g[a].pb({b, cost});
        g[b].pb({a, cost});
    }
    vector<int> dist(n, 1e9 + 10);
    dist[0] = 0;
    priority_queue<pll, vector<pll>, greater<pll>> q;
    q.push({0, 0});
    while (!q.empty()) {
        auto [curcost, v] = q.top();
        q.pop();
        if (curcost != dist[v]) continue;
        for (auto [to, cost] : g[v]) {
            if (dist[to] > dist[v] + cost) {
                dist[to] = dist[v] + cost;
                q.push({dist[to], to});
            }
        }
    }
    return 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