Submission #984816

#	Time	Username	Problem	Language	Result	Execution time	Memory
984816		rshohruh	Cyberland (APIO23_cyberland)	C++17	15 / 100	64 ms	4436 KiB

cyberland

#include "cyberland.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using node = pair<int, ll>;
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    for(int x: arr) assert(x == 1);
    vector<vector<node>> g(N);
    vector<ll> h(N, 1e18);
    for(int i = 0; i < M; ++i){
        g[x[i]].emplace_back(y[i], c[i]);
        g[y[i]].emplace_back(x[i], c[i]);
    }
    
    priority_queue<node, vector<node>, greater<node>> b; 
    b.emplace(0, 0);
    while(!b.empty()){
        auto [u, cur] = b.top();
        b.pop();
        if(h[u] < cur) continue;
        h[u] = cur;
        for(auto [v, w]: g[u])
            b.emplace(v, cur+w);
    }
    return (h[H] == 1e18 ? -1 : h[H]);
}

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