1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T68c,#include #include #include #include #include #define RoadD std::vector>> struct BufferType{ short X, MC; long long W; bool operator()(const BufferType& a, const BufferType& b) { return a.W > b.W; } }; long long dijkstra(RoadD&, std::vector&); int main(int argc, char* argv[]){ int N, M; scanf("%d %d", &N, &M); std::vector city(N); for(int i = 0; i < N; i++){ scanf("%hd ", &city[i]); } RoadD road(N); for(int i = 0; i < M; i++){ short X, Y, W; scanf("%hd %hd %hd", &X, &Y, &W); X--; Y--; road[X].emplace_back(Y, W); road[Y].emplace_back(X, W); } printf("%lld", dijkstra(road, city)); return 0; } long long dijkstra(RoadD& R, std::vector& C){ int N = C.size(), NMC; long long RM = LONG_MAX; std::vector> weight(N, std::vector(2501, LONG_MAX)); std::priority_queue, BufferType> pq; pq.push({0, 2500, 0}); while(!pq.empty()){ struct BufferType current = pq.top(); pq.pop(); if(RM <= current.W){ continue; } if(weight[current.X][current.MC] <= current.W){ continue; } weight[current.X][current.MC] = current.W; if(current.X == N-1){ RM = std::min(RM, weight[current.X][current.MC]); continue; } NMC =

코드 #5709