제출 #1003261

#제출 시각아이디문제언어결과실행 시간메모리
1003261coolboy19521Crocodile's Underground City (IOI11_crocodile)C++17
0 / 100
4 ms604 KiB
#include "bits/stdc++.h" #include "crocodile.h" using namespace std; const int sz = 1e3 + 3; vector<vector<int>> aj[sz]; int d[sz]; int dfs(int v, int p = -1, int l = 0) { d[v] = l; for (auto& u : aj[v]) { int to = u[0]; int we = u[1]; if (to != p) { dfs(to, v, l + we); } } } int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) { for (int i = 0; i < M; i ++) { int a = R[i][0]; int b = R[i][1]; aj[a].push_back({b, L[i]}); aj[b].push_back({a, L[i]}); } dfs(0); int mx = 0; for (int i = 0; i < K; i ++) { mx = max(mx, d[P[i]]); } return mx; }

컴파일 시 표준 에러 (stderr) 메시지

crocodile.cpp: In function 'int dfs(int, int, int)':
crocodile.cpp:20:1: warning: no return statement in function returning non-void [-Wreturn-type]
   20 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...