19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T638,#include #include #include #include using namespace std; int N, E; vector>> graph; int GetShortestDist(int start, int end) { vector dist(N + 1, INT_MAX); vector isVisited(N + 1, false); dist[start] = 0; priority_queue> pq; // dist, node pq.push({ 0, start }); while (!pq.empty()) { int curDist = pq.top().first; int node = pq.top().second; pq.pop(); if (isVisited[node]) { continue; } isVisited[node] = true; for (auto& p : graph[node]) { int next = p.first; int weight = p.second; // 지금 노드를 거쳐서 다음 노드로 가는 것이 더 짧다면 갱신 if (curDist + weight < dist[next]) { dist[next] = curDist + weight; pq.push({ dist[next], next }); } } } return dist[end]; } int main() { cin >> N >>

제출 #34158

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: