Cod sursa(job #2390680)

Utilizator RaduXD1Nicolae Radu RaduXD1 Data 28 martie 2019 11:29:17
Problema Salvare Scor 35
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.12 kb
#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];
vector<int> v[DIM];
int n,k,a,b,i,st,dr,l,mid,p;
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;f[nod]=1;}
}

int main()
{
    fin>>n>>k;
    for(i=1;i<n;i++)
    {
        fin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for(i=1;i<=n;i++) if(v[i].size()!=1) p=i;
    st=0;dr=n*2;
    while(st<=dr)
    {
        for(i=1;i<=n;i++) viz[i]=0,d[i]=0;
        mid=(st+dr)/2;l=0;dfs(p,mid);
        if(l<=k)
            dr=mid-1;
        else
            st=mid+1;
    }
    fout<<st<<"\n";l=0;
    for(i=1;i<=n;i++) viz[i]=0,d[i]=0,f[i]=0;
    dfs(p,st);l=k-l;
    for(i=1;i<=n;i++)
        if(f[i]==1) fout<<i<<" ";
    else
        if(f[i]==0&&l){fout<<i<<" ";l--;}
    return 0;
}