Submission #1030678

#	Time	Username	Problem	Language	Result	Execution time	Memory
1030678		amine_aroua	Cyberland (APIO23_cyberland)	C++17	15 / 100	708 ms	2097152 KiB

cyberland

#include "cyberland.h"

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

• 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