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:T590,#include #include #include using namespace std; #define INF 100000000 int V, E, K; vector> graph; vector d; vector visited; void input(); void dijkstra(int start); int getSmallIndex(); int main(){ ios::sync_with_stdio(0); cin.tie(NULL); input(); dijkstra(K); for(int i = 1; i <= V; i++){ if(d[i] >= INF) cout << "INF\n"; else cout << d[i] << '\n'; } return 0; } void input(){ cin >> V >> E >> K; graph = vector>(V + 1, vector(V + 1, INF)); d = vector(V + 1, INF); visited = vector(V + 1, false); for(int i = 0; i < E; i++){ int u, v, w; cin >> u >> v >> w; graph[u][v] = w; } for(int i = 1; i <= V; i++) graph[i][i] = 0; } void dijkstra(int start){ for(int i = 1; i <= V; i++){ d[i] = graph[start][i]; } visited[start] = true; for(int i = 0; i < V - 2; i++)

제출 #112954

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: