| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 492955 | 1ne | Race (IOI11_race) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "race.h"
#include<bits/stdc++.h>
using namespace std;
vector<set<pair<int64_t,int64_t>>>adj(1e6);
int64_t k=0;
vector<int64_t>sub(1e6,0);
vector<int64_t>ans(1e6,0);
vector<int64_t>aux(1e6,0);
int64_t answer = INT_MAX;
int64_t kk = -1;
int64_t bookmark = 0;
void dfs (int64_t cur,int64_t par,int64_t cost,int64_t len,int64_t fill){
if (cost>k)return;
if (fill){
if (aux[cost]<bookmark){
aux[cost] = bookmark;
ans[cost] = len;
}
else if (len<ans[cost]){
ans[cost] = len;
aux[cost] = bookmark;
}
}
else{
if (aux[kk - cost]==bookmark){
if (len + ans[kk - cost]<answer){
answer = min(answer,len + ans[kk-cost]);
}
if (cost ==kk){
answer = min(answer,len);
}
}
}
for (auto x:adj[cur]){
if (x.first!=par){
dfs(x.first,cur,cost + x.second,len + 1,fill);
}
}
}
void getsub(int64_t u,int64_t par){
sub[u]=1;
k++;
for (auto x:adj[u]){
if (x.first!=par){
getsub(x.first,u);
sub[u]+=sub[x.first];
}
}
}
int64_t getcentroid(int64_t u,int64_t par){
for (auto x:adj[u]){
if (x.first!=par){
if (sub[x.first]>k/2){
return getcentroid(x.first,u);
}
}
}
return u;
}
void decomposition(int64_t u,int64_t par){
k = 0;
getsub(u,u);
int64_t c = getcentroid(u,u);
if (par==-1){
par=c;
}
bookmark++;
for (auto x:adj[c]){
dfs(x.first,c,x.second,1,0);
dfs(x.first,c,x.second,1,1);
}
for (auto x:adj[c]){
adj[x.first].erase({c,x.second});
//adj[c].erase(x);
decomposition(x.first,c);
}
}
void build(){
decomposition(0,-1);
}
int best_path(int N, int K, int H[][2], in L[])
{
kk = K;
for (int64_t i = 0;i<N-1;++i){
adj[H[i][0]].insert({H[i][1],L[i]});
adj[H[i][1]].insert({H[i][0],L[i]});
}
build();
if (answer==INT_MAX){
return -1;
}
return answer;
}