제출 #806691

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
806691		TheSahib	사이버랜드 (APIO23_cyberland)	C++17	15 / 100	3072 ms	21496 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>

#define ll long long
using namespace std;

const ll oo = 1e18;
const int MAX = 1e5 + 5;

struct edge{
    int u, c;
};

int n, k, f;
int A[MAX];
vector<edge> g[MAX];
bool visited[MAX];

vector<int> starts;
void dfs(int node){
    visited[node] = 1;
    for(auto& e:g[node]){
        if(visited[e.u]) continue;
        dfs(e.u);
    }
}

double dist[MAX][32];
bool comp(int a, int b){
    return dist[a % n][a / n] < dist[b % n][b / n];
}

void dijkstra(){
    set<int, decltype(&comp)> st(&comp);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j <= k; j++)
        {
            dist[i][j] = oo;
        }
    }
    
    for(int a:starts){
        dist[a][k] = 0;
        st.insert(a + k * n);
    }
    while(!st.empty()){
        int idx = *st.begin();
        st.erase(st.begin());
        
        int node = idx % n;
        int l = idx / n;
        double d = dist[node][l];


        for(auto& e:g[node]){
            double b = d + e.c;
            
            if(b < dist[e.u][l]){
                idx = e.u + l * n;
                st.erase(idx);
                dist[e.u][l] = b;
                st.insert(idx);
            }
            if(l == 0 || A[e.u] != 2) continue;
            if(b / 2 < dist[e.u][l - 1]){
                idx = e.u + (l - 1) * n;
                st.erase(idx);
                dist[e.u][l - 1] = b / 2;
                st.insert(idx);
            }
        }
    }
}


double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    n = N;
    k = K;
    f = H;
    starts.clear();
    for (int i = 0; i < n; i++)
    {
        A[i] = arr[i];
        g[i].clear();
        visited[i] = 0;
    }
    
    for (int i = 0; i < M; i++)
    {
        g[x[i]].push_back({y[i], c[i]});
        g[y[i]].push_back({x[i], c[i]});
    }
    g[f].clear();
    dfs(0);
    starts.push_back(0);
    for (int i = 0; i < n; i++)
    {
        if(visited[i] && A[i] == 0){
            starts.push_back(i);
        }
    }
    dijkstra();
    double ans = oo;
    for(int i = 0; i <= k; ++i){
        ans = min(ans, dist[f][i]);
    }
    if(ans == oo){
        return -1;
    }
    else{
        return ans;
    }
}

• 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