pat 1004(有一坑没过)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#include <iostream>
#include <vector>
#include <queue>
#define MAX 200
using namespace std;
struct node
{
vector<int> child;
}Node[MAX];
void layerOrder(int root)
{
queue<int> q;
int front = 0 ,last = 1, rear = 0;
int layer = 0 , sum = 0;
bool isFirst = true;
q.push(root);
++rear;
while(!q.empty())
{
int now = q.front();
q.pop();
++front;
if(Node[now].child.size() == 0)
{
++sum;
}
for(int i = 0 ; i < Node[now].child.size() ; ++i)
{
q.push(Node[now].child[i]);
++rear;
}
if(front == last)
{
if(isFirst)
{
cout<<sum;
isFirst = false;
}
else
{
cout<<" "<<sum;
}
sum = 0;
layer++;
last = rear;
}
}
}
/*
int maxDepth = 0 , num =0;
void DFS(int root , int depth)
{
if(Node[root].child.size() == 0)
{
if(maxDepth< depth)
{
maxDepth = depth;
cout<<num<<" ";
num = 0;
}
else if(maxDepth == depth)
{
++num;
}
return;
}
for(int i = 0 ; i < Node[root].child.size(); ++i)
{
DFS(Node[root].child[i] , depth+1);
}
}
*/
int max(int a , int b)
{
return a>b? a:b;
}
int max_h = 1;
int leaf[MAX] = {0};
void DFS(int index , int h)
{
max_h = max(h , max_h);
if(Node[index].child.size() == 0)
{
leaf[h]++;//因为每个节点的层数固定
return;
}
for(int i = 0 ; i < Node[index].child.size() ; ++i)
{
DFS(Node[index].child[i] , h+1);
}
}
int main()
{
int N,M;
cin>>N>>M;
if(M != 0)
{
int i,j;
bool flag = true;
int root = 1;
for(i = 0 ; i < M ; ++i)
{
int ID,num;
cin>>ID>>num;
if(flag)
{
root = ID;
flag = false;
}
int mem;
for(j = 0 ; j < num ; ++j)
{
cin>>mem;
Node[ID].child.push_back(mem);
}
}
layerOrder(root);
}
else
{
if(N)
cout<<"1";
else
cout<<"0";
}
// DFS(root , 1);
/* bool isF = true;
for(i = 1; i <=max_h; ++i)
{
if(isF)
{
cout<<leaf[i];
isF = false;
}
else
cout<<" "<<leaf[i];
}*/
return 0;
}

热评文章