제출 #1305938

#제출 시각아이디문제언어결과실행 시간메모리
1305938orgiloogii악어의 지하 도시 (IOI11_crocodile)C++20
0 / 100
1 ms572 KiB
#include "crocodile.h" #include <bits/stdc++.h> using namespace std; vector <vector <pair <int, int>>> adj; long long dfs(int u) { int m = INT_MAX, m1 = INT_MAX; for (auto [x, y] : adj[u]) { int u = dfs(x) + y; if (u < m) { m1 = m; m = u; } else if (u < m1) { m1 = u; } } if (m1 == INT_MAX) { return 0; } return m1; } int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) { adj.resize(n); for (int i = 0;i < m;i++) { adj[r[i][0]].push_back({r[i][1], l[i]}); } return dfs(0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...