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:T4cb,#include #include using namespace std; vector>>map; vector>dp; int n, m, w; void floyed() { for (int i = 1; i <= n; i++) { // i 에서 for (int j = 1; j <= n; j++) { // j 로 가는길 for (int k = 1; k <= n; k++) { // k 경유 if (j == k||i==k) continue; if (dp[i][j] > dp[i][k] + dp[k][j]) { dp[i][j] = dp[i][k] + dp[k][j]; if (i == j && dp[i][j] < 0) { cout << "YES\n"; return; } } } } } cout << "NO\n"; return; } int main() { ios::sync_with_stdio(0); int tc; cin >> tc; for (int i = 0; i < tc; i++) { cin >> n >> m >> w; map.clear(); dp.clear(); map.resize(n + 1, vector>(n + 1, { 100000, 100 })); dp.resize(n + 1, vector(n + 1, 1e9)); for (int j = 1; j <= n; j++) { dp[j][j] = 0; } for (int j = 0; j < m; j++) { int s, e, t; cin >> s >> e >> t; if (map[s][e].first > t) { map[s]

제출 #85980

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: