uoj 387【UNR #3】To Do Tree

http://www.elijahqi.win/archives/3958

看出是一个贪心 大胆猜测结论

按照每个点子树内最深的深度贪心即可 证明看uoj blog有官方题解

http://wuhongxun.blog.uoj.ac/blog/3670

#include<bits/stdc++.h>
#define fi first
#define se second
#define pa pair<int,int>
#define mp(x,y) make_pair(x,y)
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(!isdigit(ch)) {if (ch=='-')f=-1;ch=gc();}
    while(isdigit(ch)) x=x*10+ch-'0',ch=gc();
    return x*f;
}
const int inf=0x3f3f3f3f;
int n,m;
namespace sol1{
    const int N=13;
    int fa[N],dp[1<<13],pre[1<<13];
    inline bool check(int s,int s1){
        for (int i=0;i<n;++i){
            if ((1<<i)&s1){
                if(!((1<<fa[i+1]-1)&s)) return 0;
            }
        }return 1;
    }
    vector<int> ans[12];
    inline void print(int s,int t){
        if (!t) return;
        int s1=pre[s];int tot=0;
        for (int i=0;i<n;++i) if ((1<<i)&s) if (!((1<<i)&s1)) ++tot,ans[t].push_back(i+1);
        ans[t].push_back(tot);reverse(ans[t].begin(),ans[t].end());
        print(s1,t-1);
    }
    inline void gao(){
        for (int i=2;i<=n;++i) fa[i]=read();
        int S=1<<n;--S;memset(dp,0x3f,sizeof(dp));dp[1]=1;
        for (int s=1;s<=S;++s){
            int ss=S^s;if (dp[s]==inf) continue;
            for (int s1=ss;s1;s1=(s1-1)&ss){
                int tot=0;
                for (int i=0;i<n;++i) if ((1<<i)&s1) ++tot;
                if (tot>m) continue;
                if (check(s,s1)){
                    if (dp[s|s1]>dp[s]+1) dp[s|s1]=dp[s]+1,pre[s|s1]=s;
                }
            }
        }
        printf("%d\n",dp[S]);
        print(S,dp[S]);
        for (int i=1;i<=dp[S];++i){
            for (int j=0;j<ans[i].size();++j) printf("%d ",ans[i][j]);puts("");
        }
    }
}
namespace sol3{
    const int N=1e5+10;
    vector<int> eg[N];
    inline void gao(){
        for (int i=2;i<=n;++i) eg[read()].push_back(i);
        printf("%d\n",n);queue<int> q;q.push(1);
        while(!q.empty()){
            int x=q.front();q.pop();printf("1 %d\n",x);
            for (int i=0;i<eg[x].size();++i) q.push(eg[x][i]);
        }
    }
}
namespace sol2{
    const int N=1e5+10;
    vector<int> eg[N],ans[N];int dep[N],now[N],d;
    priority_queue<pa,vector<pa> >q;vector<int> pd;
    inline void dfs(int x){
        for (int i=0;i<eg[x].size();++i){
            int y=eg[x][i];dfs(y);dep[x]=max(dep[x],dep[y]+1);
        }
    }
    inline void gao(){
        for (int i=2,x;i<=n;++i) x=read(),eg[x].push_back(i);dfs(1);
        int tot=0;q.push(mp(dep[1],1));int d=0,left=m;
        while(tot<n){
            pd.clear();++d;int cnt=0;
            while(!q.empty()&&left){
                int x=q.top().se;--left;++tot;ans[d].push_back(x);++cnt;q.pop();
                for (int i=0;i<eg[x].size();++i) pd.push_back(eg[x][i]);
            }ans[d].push_back(cnt);reverse(ans[d].begin(),ans[d].end());
            left=m;
            for (int i=0;i<pd.size();++i) q.push(mp(dep[pd[i]],pd[i]));
        }
        printf("%d\n",d);
        for (int i=1;i<=d;++i){
            for (int j=0;j<ans[i].size();++j) printf("%d ",ans[i][j]);puts("");
        }
    }
}
int main(){
//  freopen("b.in","r",stdin);
    n=read();m=read();
    //if (n<=10) {sol1::gao();return 0;}
    if (m==1) {sol3::gao();return 0;}
    sol2::gao();
    return 0;
}