Submission #90 :: njudge

2021-01-10 21:27:36

cpp11

Accepted 50/50

201ms

60056 KiB

#include <bits/stdc++.h>
using namespace std;

int n,m;
int col[200001];
vector<int> g[200001];

int dfs(int x,int depth)
{
    col[x]=depth;
    if(g[x].empty()) return 1;
    int res=n+1;
    for(auto s:g[x]) res=min(res,dfs(s,depth+1)+1);
    return res;
}

int main () {
    cin>>n;
    for(int i=2;i<=n;i++)
    {
        int x;
        cin>>x;
        g[x].push_back(i);
    }
    int min_depth=dfs(1,1);
    cout<<min_depth<<endl;
    for(int i=1;i<=n;i++) cout<<((col[i]<=min_depth) ? col[i] : 1)<<" ";
    cout<<endl;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	6ms	11104 KiB
		2	Accepted	0/0	10ms	11784 KiB
		3	Accepted	1/1	6ms	11244 KiB
		4	Accepted	4/4	6ms	11220 KiB
		5	Accepted	5/5	126ms	45388 KiB
		6	Accepted	2/2	173ms	23448 KiB
		7	Accepted	3/3	180ms	24728 KiB
		8	Accepted	2/2	162ms	25444 KiB
		9	Accepted	2/2	150ms	25708 KiB
		10	Accepted	2/2	153ms	27644 KiB
		11	Accepted	2/2	187ms	31212 KiB
		12	Accepted	2/2	188ms	33936 KiB
		13	Accepted	2/2	174ms	35764 KiB
		14	Accepted	2/2	175ms	37332 KiB
		15	Accepted	2/2	184ms	38900 KiB
		16	Accepted	2/2	177ms	40232 KiB
		17	Accepted	2/2	201ms	41740 KiB
		18	Accepted	2/2	168ms	43064 KiB
		19	Accepted	2/2	177ms	44388 KiB
		20	Accepted	2/2	175ms	45760 KiB
		21	Accepted	2/2	178ms	47332 KiB
		22	Accepted	2/2	167ms	49080 KiB
		23	Accepted	2/2	168ms	54096 KiB
		24	Accepted	3/3	168ms	60056 KiB