제출 #1030802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1030802		amine_aroua	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	58 ms	29500 KiB

cyberland

#include "cyberland.h"

#include <bits/stdc++.h>
using namespace std;
void dfs(int x , vector<bool>&reach , vector<vector<pair<int ,int>>> &adj)
{
    if(reach[x])
        return ;
    reach[x] = 1;
    for(auto [u , cost] : adj[x])
        dfs(u , reach , adj);
}
using Node = tuple<double , int , int>;
priority_queue<Node , vector<Node> , greater<Node>> pq;
void upd(int x , int k , int d , vector<vector<double>> &dist)
{
    if(dist[x][k] > d)
    {
        dist[x][k] = d;
        pq.push({d , x , k});
    }
}
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) 
{
    pq = priority_queue<Node , vector<Node> , greater<Node>> ();
    K = min(K , 70);
    vector<vector<pair<int , int>>> adj(N);
    vector<bool> reach(N);
    vector<double> pwr(K + 1);
    pwr[0] = 1;
    for(int i = 1 ; i <= K ; i++)
    {
        pwr[i] = pwr[i - 1]/2.0;
    } 
    for(int i = 0 ; i < M ; i++)
    {
        adj[x[i]].push_back({y[i] , c[i]});
        adj[y[i]].push_back({x[i] , c[i]});
    }
    vector<vector<double>> dist(N , vector<double>(K + 1 , 1e16));
    arr[0] = 0;
    pq.push({0 , H , 0});
    dist[H][0] = 0;
    dfs(0 , reach ,adj);
    vector<vector<bool>> vis(N , vector<bool>(K + 1));
    while(!pq.empty())
    {
        auto [d , x , k] = pq.top();
        pq.pop();
        if(vis[x][k])
            continue;
        vis[x][k] = true;
        if(arr[x] == 0)
        {
            return d;
        }
        for(auto [u , cost] : adj[x])
        {
            if(!reach[u])
                continue;
            cost*=pwr[k];
            upd(u , k , cost + d , dist);
        }
        if(arr[x] == 2)
        {
            for(int p = k + 1 ; p <= K ; p++)
            {
                for(auto [u , cost] : adj[x])
                {
                    if(!reach[u])
                        continue;
                    cost*=pwr[p];
                    upd(u , p , cost + d , dist);
                }
            }
        }
    }
    return -1;
}

• 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