PAT (Advanced Level) Practise 1004. Counting Leaves (30)
2017-12-13 09:27
411 查看
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:
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
Sample Output
0 1
题解:
这个题目用树的深度优先搜索较为简单。
代码:
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn=105;
vector<int> G[maxn];
int leaf[maxn]={0};
int maxh=1;
void dfs(int idx,int h){
maxh=max(h,maxh);
if(G[idx].size()==0){
leaf[h]++;
return;
}
for(int i=0;i<G[idx].size();i++) dfs(G[idx][i],h+1);
}
int main(){
int n,m,parent,child,k;
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);
printf("%d",leaf[1]);
for(int i=2;i<=maxh;i++) printf(" %d",leaf[i]);
return 0;
}
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
题解:
这个题目用树的深度优先搜索较为简单。
代码:
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn=105;
vector<int> G[maxn];
int leaf[maxn]={0};
int maxh=1;
void dfs(int idx,int h){
maxh=max(h,maxh);
if(G[idx].size()==0){
leaf[h]++;
return;
}
for(int i=0;i<G[idx].size();i++) dfs(G[idx][i],h+1);
}
int main(){
int n,m,parent,child,k;
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);
printf("%d",leaf[1]);
for(int i=2;i<=maxh;i++) printf(" %d",leaf[i]);
return 0;
}
相关文章推荐
- 1014. Waiting in Line (30)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1014 Waiting in Line (30)
- PAT (Advanced Level) Practise 1049 Counting Ones (30)
- PAT (Advanced Level) Practise 1099 Build A Binary Search Tree (30)
- PAT (Advanced Level) Practise 1076 Forwards on Weibo (30)
- PAT (Advanced Level) Practise 1072 Gas Station (30)
- 1004. Counting Leaves (30)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1034 Head of a Gang (30)
- PAT (Advanced Level) Practise 1111 Online Map (30)
- PAT (Advanced Level) Practise 1053 Path of Equal Weight (30)
- PAT (Advanced Level) Practise 1068 Find More Coins (30)
- PAT (Advanced Level) Practise 1091 Acute Stroke (30)
- PAT (Advanced Level) Practise 1095 Cars on Campus (30)
- 1087. All Roads Lead to Rome (30)【最短路】——PAT (Advanced Level) Practise
- 1030. Travel Plan (30)【最短路+路径记忆】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1014. Waiting in Line (30)
- 1004. Counting Leaves (30)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1038 Recover the Smallest Number (30)
- PAT (Advanced Level) Practise 1127 ZigZagging on a Tree (30)
- PAT (Advanced Level) Practise 1038 Recover the Smallest Number (30)