Submission #809044

#TimeUsernameProblemLanguageResultExecution timeMemory
809044TheSahib악어의 지하 도시 (IOI11_crocodile)C++14
46 / 100
114 ms262144 KiB
#include "crocodile.h" #include <bits/stdc++.h> #define pii pair<int, int> #define ll long long using namespace std; const int MAX = 3e5 + 5; vector<pii> g[MAX]; int dp[MAX]; void dfs(int node, int p){ vector<int> v; for(auto& e:g[node]){ if(e.first == p) continue; dfs(e.first, node); v.push_back(dp[e.first] + e.second); } if(v.size() < 2) return; sort(v.begin(), v.end()); dp[node] = v[1]; } int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) { 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]}); } dfs(0, 0); return dp[0]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...