Submission #752414

#	Time	Username	Problem	Language	Result	Execution time	Memory
752414		bachhoangxuan	사이버랜드 (APIO23_cyberland)	C++17	20 / 100	1051 ms	21284 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pdi pair<double,pii>
#define fi first
#define se second

double solve(int N, int M, int K, int T, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    K=min(K,100);
    vector<vector<double>> dist(N,vector<double>(K+1,1e14));
    vector<vector<pii>> edge(N);
    for(int i=0;i<M;i++){
        edge[x[i]].push_back({y[i],c[i]});
        edge[y[i]].push_back({x[i],c[i]});
    }
    priority_queue<pdi,vector<pdi>,greater<pdi>> pq;
    dist[0][0]=0;pq.push({0,{0,0}});
    while(!pq.empty()){
        auto [d,x]=pq.top();pq.pop();
        int u=x.fi,k=x.se;
        if(u==T) return d;
        for(auto [v,w]:edge[u]){
            double nd0=dist[u][k]+w;
            double nd1=(dist[u][k]+w)*(arr[v]?1.0/arr[v]:0);
            if(k<K && dist[v][k+1]>nd1){
                dist[v][k+1]=nd1;
                pq.push({nd1,{v,k+1}});
            }
            if(dist[v][k]>nd0){
                dist[v][k]=nd0;
                pq.push({nd0,{v,k}});
            }
        }
    }
    return -1;
}

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