1004 Counting Leaves (30)

 

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input

Each input file contains one test case. Each case starts with a line containing 0 < N < 100, the number of nodes in a tree, and M (< N), the number of non-leaf nodes. Then M lines follow, each in the format:

ID K ID[1] ID[2] ... ID[K]

where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID's of its children. For the sake of simplicity, let us fix the root ID to be 01.

Output

For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.

The sample case represents a tree with only 2 nodes, where 01 is the root and 02 is its only child. Hence on the root 01 level, there is 0 leaf node; and on the next level, there is 1 leaf node. Then we should output "0 1" in a line.

Sample Input

2 1
01 1 02

Sample Output

0 1

DFS

#include<cstdio>
#include<vector>
#include<fstream>
#include<algorithm>
using namespace std;

const int N=110;
vector<int> g[N];
int leaf[N]={0};
int max_h=1;

void DFS(int index, int h){
	max_h=max(h, max_h);
	if(g[index].size()==0){
		leaf[h]++;
		return;
	}
	for(int i=0; i<g[index].size(); i++){
		DFS(g[index][i], h+1);
	}
}

int main(){
	int n, m, child, parent, k;
//	freopen("d://in.txt","r",stdin);
	scanf("%d%d", &n, &m);
	for(int i=0; i<m; i++){
		scanf("%d%d", &parent, &k);
		for(int j=0; j<k; j++){
			scanf("%d", &child);
			g[parent].push_back(child); 
		}
	}
	DFS(1, 1);
	for(int i=1; i<=max_h; i++){
		printf("%d", leaf[i]);
		if(i!=max_h) printf(" ");
	}
	return 0;
}

BFS 

#include<cstdio>
#include<vector>
#include<fstream>
#include<queue>
#include<algorithm>
using namespace std;
const int N=110;

vector<int> g[N];
int h[N]={0};
int leaf[N]={0};
int max_h=0;

void BFS(){
	queue<int> Q;
	Q.push(1);
	while(!Q.empty()){
		int id=Q.front();
		Q.pop();
		max_h=max(max_h, h[id]);
		if(g[id].size()==0){
			leaf[h[id]]++;
		}
		for(int i=0; i<g[id].size(); i++){
			h[g[id][i]]=h[id]+1;
			Q.push(g[id][i]);
		}
	} 
}

int main(){
	int n, m, child, parent, k;
//	freopen("d://in.txt","r",stdin);
	scanf("%d%d", &n, &m);
	for(int i=0; i<m; i++){
		scanf("%d%d", &parent, &k);
		for(int j=0; j<k; j++){
			scanf("%d", &child);
			g[parent].push_back(child); 
		}
	}
	h[1]=1;
	BFS();
	for(int i=1; i<=max_h; i++){
		printf("%d", leaf[i]);
		if(i!=max_h) printf(" ");
	}
	return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值