Pagini recente » Cod sursa (job #1900350) | Cod sursa (job #311828) | Cod sursa (job #1689129) | Sandbox (cutiuţa cu năsip) | Cod sursa (job #2390774)
#include<fstream>
#include<vector>
#define DIM 1010
using namespace std;
ifstream fin("salvare.in");
ofstream fout("salvare.out");
int viz[DIM],d[DIM],f[DIM],ff[DIM];
vector<int> v[DIM];
int n,k,a,b,i,st,dr,l,mid,aux;
void dfs(int nod, int val)
{
int ok=1;
viz[nod]=1;d[nod]=1000000000;
for(auto vecin:v[nod])
if(viz[vecin]==0){ok=0;dfs(vecin,val);d[nod]=min(d[nod],d[vecin]);}
d[nod]--;if(d[nod]<0) d[nod]=0;
if(ok==1) d[nod]=val;
if(d[nod]==0){l++,d[nod]=2*val+1;f[nod]=1;}
}
void reset(int o,int val)
{
for(int i=1;i<=n;i++) viz[i]=0,d[i]=0,f[i]=0;
l=0;dfs(o,val);
if(aux>l)
{
aux=l;
for(i=1;i<=n;i++) ff[i]=f[i];
}
}
int main()
{
fin>>n>>k;
for(i=1;i<n;i++)
{
fin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
st=0;dr=n*2;
while(st<=dr)
{
mid=(st+dr)/2;aux=1000000000;
for(i=1;i<=n;i++) reset(i,mid);
if(aux<=k) dr=mid-1;
else st=mid+1;
}
fout<<st<<"\n";aux=1000000000;
for(i=1;i<=n;i++) reset(i,st);
aux=k-aux;
for(i=1;i<=n;i++)
if(ff[i]==1) fout<<i<<" ";
else
if(ff[i]==0&&aux){fout<<i<<" ";aux--;}
return 0;
}