Submission #599542

#TimeUsernameProblemLanguageResultExecution timeMemory
599542shezittCrocodile's Underground City (IOI11_crocodile)C++14
46 / 100
133 ms262144 KiB
#include "crocodile.h" #include <bits/stdc++.h> #define dbg(x) cout << #x << ": " << x << endl; #define raya cout << "===========================" << endl; using namespace std; const int N = 1e5+5; int n, m; bool ext[N]; vector<pair<int,int>> g[N]; int f(int i, int p=-1){ if((int) g[i].size() == 1){ if(ext[i]){ return 0; } return 1e9; } priority_queue<int> st; for(auto v : g[i]){ if(v.first != p){ st.push(-(f(v.first, i)+v.second)); } } st.pop(); return -st.top(); } int travel_plan(int nn, int mm, int R[][2], int L[], int K, int P[]){ n = nn; m = mm; for(int i=0; i<K; ++i){ ext[P[i]] = 1; } for(int i=0; i<m; ++i){ g[R[i][0]].push_back({R[i][1], L[i]}); g[R[i][1]].push_back({R[i][0], L[i]}); } return f(0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...