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:T4ba,#include #include #include #include using namespace std; int main() { int tc; cin >> tc; for (int ti = 0; ti < tc; ti++) { int n, m, w; int t1, t2, t3; cin >> n >> m >> w; vector> arr(n + 1, vector(n + 1, INT_MAX)); vector mem(n + 1, INT_MAX); for (int i = 0; i < m; i++) { cin >> t1 >> t2 >> t3; arr[t1][t2] = min(arr[t1][t2],t3); } for (int i = 0; i < w; i++) { cin >> t1 >> t2 >> t3; arr[t1][t2] = min(arr[t1][t2], -1 * t3); } for (int i = 0; i < n - 1; i++) { vector visited(n + 1); mem[1] = 0; for (int j = 1; j <= n; j++) { visited[j] = true; for (int k = 1; k <= n; k++) { if (!visited[k] && mem[j]!=INT_MAX && arr[j][k]!=INT_MAX) { mem[k] = min(mem[k], mem[j] + arr[j][k]); } } } } bool ans = false; vector visited(n + 1); for (int j = 1; j <= n; j++) { visited[j] = true; for (int k = 1;

제출 #87095

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: