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:T57e,#include #include #include #define MAX 501 #define INF 1000000000 using namespace std; bool findRoute(vector> v[], int n) { int table[MAX]; for (int i = 1; i <= n; i++) table[i] = INF; int start = 1; table[start] = 0; for (int c = 0; c < n; c++) { for (int i = 1; i <= n; i++) { for (int j = 0; j < v[i].size(); j++) { // i start int end = v[i][j].first; int end_time = v[i][j].second; if (table[i] != INF && table[end] > table[i] + end_time) { table[end] = table[i] + end_time; if (c == n - 1) return true; // negative cycle } } } } return false; } int main() { int testcase, n, m, w; int start, end, time; vector> vertex[MAX]; // end, weight cin >> testcase; while (testca

제출 #124715

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: