Submission #1265105

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265105		lunarecho	Cyberland (APIO23_cyberland)	C++20	8 / 100	3107 ms	525804 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;

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) {
    vector<tuple<int,ll,int>> adj[N];
    for(int i=0;i<M;++i)
    {
        adj[x[i]].push_back({y[i], c[i] * 1LL, arr[i]});
        adj[y[i]].push_back({x[i], c[i] * 1LL, arr[i]});
    }
    vector<ll> dist(N, INF);
    dist[0] = 0;
    priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<>> pq;
    pq.push({dist[0], 0});
    while(!pq.empty())
    {
        auto [w, u] = pq.top();
        pq.pop();
        if(w > dist[u])
            continue;
        for(auto [v, we, ext] : adj[u])
        {
            if(dist[v] > w + we || ext == 0)
            {
                dist[v] = w + we;
                if(ext == 0)
                    dist[v] = 0;
                pq.push({dist[v], v});
            }
        }
    }
    if(dist[H] == INF)
        return (double)-1;
    else
        return (double)dist[H];
}

• Subtask 1: 0 / 5
• Subtask 2: 8 / 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