Submission #1210878

#TimeUsernameProblemLanguageResultExecution timeMemory
1210878Born_To_LaughRace (IOI11_race)C++17
100 / 100
816 ms73124 KiB
// Born_To_Laugh - Hughie Do #include <bits/stdc++.h> #define alle(Lotus) Lotus.begin(), Lotus.end() using namespace std; typedef long long ll; [[maybe_unused]] const ll MOD = 998244353, INF = 1e9 + 7; const int maxn = 2e5 + 5; int n, k; int ans = INF; vector<int> sz(maxn, 1), bigchild(maxn, -1), dep(maxn, 0), dist(maxn, 0); vector<int> adj[maxn]; map<pair<int,int>, int> wei; map<int,int> mp; void pre_dfs(int a, int par){ for(auto &elm: adj[a]){ if(elm == par)continue; dep[elm] = dep[a] + 1; dist[elm] = dist[a] + wei[{a, elm}]; pre_dfs(elm, a); sz[a] += sz[elm]; if(bigchild[a] == -1 || sz[bigchild[a]] < sz[elm])bigchild[a] = elm; } } //dist[1] + dist[2] - 2*dist[lca] = k //dep[1] + dep[2] - 2*dep[lca]; void calc(int a, int par, int distlca, int deplca){ int dist1 = k + 2 * distlca - dist[a]; if(mp.find(dist1) != mp.end()){ ans = min(ans, mp[dist1] + dep[a] - 2*deplca); } for(auto &elm: adj[a]){ if(elm == par)continue; calc(elm, a, distlca, deplca); } } void add(int a, int par, bool godown){ if(mp.find(dist[a]) == mp.end()) mp[dist[a]] = dep[a]; else mp[dist[a]] = min(mp[dist[a]], dep[a]); if(!godown)return; for(auto &elm: adj[a]){ if(elm == par)continue; add(elm, a, 1); } } void dfs(int a, int par){ for(auto &elm: adj[a]){ if(elm == par || elm == bigchild[a])continue; dfs(elm, a); mp.clear(); } if(bigchild[a] != -1) dfs(bigchild[a], a); for(auto &elm: adj[a]){ if(elm == par || elm == bigchild[a])continue; calc(elm, a, dist[a], dep[a]); add(elm, a, 1); } //add root int dist1 = k + dist[a]; if(mp.find(dist1) != mp.end()){ ans = min(ans, mp[dist1] - dep[a]); } add(a, par, 0); } int best_path(int N, int K, int H[][2], int L[]){ n = N; k = K; for(int i=0; i<n-1; ++i){ int x = H[i][0], y = H[i][1]; adj[x].push_back(y); adj[y].push_back(x); int w = L[i]; wei[{x, y}] = w; wei[{y, x}] = w; } pre_dfs(0, -1); dfs(0, -1); return (ans == INF?-1:ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...