Submission #1030701

#	Time	Username	Problem	Language	Result	Execution time	Memory
1030701		amine_aroua	Cyberland (APIO23_cyberland)	C++17	0 / 100	1331 ms	2097152 KiB

cyberland

#include "cyberland.h"

#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
vector<bool> reach;
void dfs(int x , vector<vector<pair<long long ,long long>>> &adj)
{
    if(reach[x])
        return ;
    for(auto u : adj[x])
        dfs(u.first , adj);
}
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)
{
    reach.assign(N , 0);
    vector<vector<pair<long long ,long long>>> adj(N);
    for(long long i = 0 ; i < M ; i++)
    {
        adj[x[i]].push_back({y[i] , c[i]});
        adj[y[i]].push_back({x[i] , c[i]});
    }
    priority_queue<pair<double , long long> , vector<pair<double , long long>> , greater<pair<double , long long>>> pq;
    vector<double> dist(N , 1e16);
    vector<bool> vis(N , 0);
    dist[0] = 0;
    dfs(0 , adj);
    pq.push({0 , 0});
    for(int i = 0 ; i < N ; i++)
    {
        if(arr[i] == 0 && reach[i])
            pq.push({0 , i});
    }
    while(!pq.empty())
    {
        auto tp = pq.top();
        pq.pop();
        double d = tp.first ;
        long long node = tp.second;
        if(vis[node])
            continue;
        vis[node] = 1;
        for(auto [u , cost] : adj[node])
        {
            double nd = d + (double)cost;
            if(nd < eps + dist[u])
            {
                dist[u] = nd;
                pq.push({nd , u});
            }
        }
    }
    double mn = dist[H];
    return (mn + eps >= 1e16 ? -1 : mn);
}

• 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