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:T417,#include #include #include #include using namespace std; struct tq{ int s; //start int e; //end int c; //cost }; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int TC; cin >> TC; while (TC--){ int n, m, w; cin >> n >> m >>w; vector edge; vector dist(n+1, INT_MAX); for (int i=0; i> a >> b >> c; edge.push_back({a,b,c}); edge.push_back({b,a,c}); } for (int i=0; i> a >> b >> c; edge.push_back({a,b,-c}); } dist[1] = 0; for (int i=0; i dist[edge[j].s] + edge[j].c) dist[edge[j].e] = dist[edge[j].s] + edge[j].c; } } int result = 0; for (int i=0; i dist[edge[i].s] +

제출 #96461

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: