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:T57d,#include #include #include #include std::vector > node[20005]; std::priority_queue, std::vector >, std::greater > >pq; int value[20005]; const int INF = std::numeric_limits::max(); int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); int V, E, K; int u, v, w; std::cin >> V >> E >> K; for (int i = 0; i < E; i++) { std::cin >> u >> v >> w; node[u].push_back({ v,w }); } for (int i = 1; i <= V; i++) value[i] = INF; value[K] = 0; pq.push({ 0,K }); while (!pq.empty()) { int selectedWeight = pq.top().first; int selectedNode = pq.top().second; pq.pop(); for (int i = 0; i < node[selectedNode].size(); i++) { int currentNode = node[selectedNode][i].first; int currentWeight = nod

제출 #136929

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: