1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","9362","static/chunks/9362-e9f488fde79ed646.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","9992","static/chunks/9992-c6b29c96d53cc0fe.js","9211","static/chunks/9211-a8d692fd39a95daf.js","9791","static/chunks/app/submission/%5Bid%5D/page-47099a350c9e7e40.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","9362","static/chunks/9362-e9f488fde79ed646.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","9992","static/chunks/9992-c6b29c96d53cc0fe.js","9211","static/chunks/9211-a8d692fd39a95daf.js","9791","static/chunks/app/submission/%5Bid%5D/page-47099a350c9e7e40.js"],"TestCaseDisplay"] 1b:T419,#include #include #include #include #include #include using namespace std; struct comp { bool operator()(pair a, pair b) { return a.first > b.first; } }; int main() { int v, e, k; cin >> v >> e >> k; vector>> arr(v+1); vector visited(v+1); vector ans(v+1,INT_MAX); for (int i = 0; i < e; i++) { int t1, t2, t3; cin >> t1 >> t2 >> t3; arr[t1].push_back({ t2,t3 }); } priority_queue,vector>, comp> que; que.push({ 0,k }); ans[k] = 0; while (!que.empty()) { int n = que.top().second; visited[n] = 2; que.pop(); for (pair p : arr[n]) { if (visited[p.first] < 2) { ans[p.first] = min(ans[p.first], ans[n] + p.second); if (visited[p.first] == 0) { que.push({ ans[p.first],p.fir

제출 #83889

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: