# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963232 | 2024-04-14T19:04:11 Z | SuPythony | Crocodile's Underground City (IOI11_crocodile) | C++17 | 6 ms | 8796 KB |
#include "crocodile.h" #include <bits/stdc++.h> using namespace std; vector<vector<pair<int,int>>> al(1000, vector<pair<int,int>>()); vector<int> is_exit(1000, 0); vector<int> dp(1000,0); void dfs(int u, int p) { if (is_exit[u]) return; int mn=INT_MAX; int mn2=0; for (auto v: al[u]) { if (v.first==p) continue; dfs(v.first,u); if (dp[v.first]+v.second<=mn) { mn2=mn; mn=min(mn,dp[v.first]+v.second); } } dp[u]=mn2; } int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) { for (int i=0; i<M; i++) { int u=R[i][0], v=R[i][1]; al[u].push_back({v, L[i]}); al[v].push_back({u, L[i]}); } for (int i=0; i<K; i++) { is_exit[P[i]]=1; } if (is_exit[0]) return 0; dfs(0,-1); cout<<dp[0]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 6 ms | 8796 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 6 ms | 8796 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 6 ms | 8796 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |