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:T6fe,#include using namespace std; #define fastio ios_base::sync_with_stdio(NULL);\ cin.tie(NULL);\ cout.tie(NULL) /* * 2024403072 소프트웨어학부 이대원 * * 사고 과정 * * 최장 거리를 찾는 문제 * DFS로 모든 경로를 확인해야할 것 같다. */ struct GraphNode { int weight; vector dest; }; typedef vector Graph; tuple> getInput() { int N, K; cin >> N >> K; Graph g(N); for (GraphNode& node : g) cin >> node.weight; vector is_dest(N, false); for (int i = 0; i < K; i++) { int src, dest; cin >> src >> dest; g[src - 1].dest.push_back(dest - 1); is_dest[dest - 1] = true; } int W; cin >> W; vector start_nodes; for (int i = 0; i < N; i++) if (!is_dest[i]) start_nodes.push_back(i); return { N, K, W - 1, g , start_nodes}; } int findLongestPath(int src, int dest, Graph& g, bool& found, vector& max_length_to_dest) { if (max_length_to_

제출 #137075

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: