1a: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","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T652,#include #include #include #include using namespace std; int shortestNode(vector& distance, vector& visited) { int min = 20; int index = -1; for (int i = 0; i < distance.size(); i++) { if (distance[i] < min && visited[i] == false) { min = distance[i]; index = i + 1; } } return index; } void Dijkstra(vector>& data, vector& distance, int startNode) { vector visited(distance.size(), false); for(int i = 0; i < distance.size() - 1; i++) { int shortest = shortestNode(distance, visited); if (shortest < 0) break; visited[shortest - 1] = true; // 방문한적 없으면 해당 노드로 이동 for (int j = 0; j < data.size(); j++) { if ((distance[j] > (distance[shortest - 1] + data[shortest - 1][j]))) { distance[j] = (distance[shortest - 1] + data[shortest - 1][j]); } } } } int main() { int nodes = 0; int lines = 0; int startNode =

제출 #82392

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: