当前位置: 代码迷 >> 综合 >> poj 2814(字典树Hardwood Species)
  详细解决方案

poj 2814(字典树Hardwood Species)

热度:2   发布时间:2024-01-14 21:51:49.0
Hardwood Species
Time Limit: 10000MS   Memory Limit: 65536K
Total Submissions: 23210   Accepted: 9032

Description

Hardwoods (硬木) are the botanical (植物学的) group of trees that have broad leaves, produce a fruit or nut, and generally go dormant (休眠的) in the winter.
America's temperate (温和的) climates produce forests with hundreds of hardwood species (物种) -- trees that share certain biological (生物的) characteristics (特征). Although oak, maple and cherry (樱桃) all are types of hardwood trees, for example, they are different species. Together, all the hardwood species represent 40 percent of the trees in the United States.

On the other hand, softwoods (软木材), or conifers (针叶树), from the Latin word meaning "cone-bearing," have needles. Widely available US softwoods include cedar (雪松), fir, hemlock (铁杉), pine, redwood (红木树), spruce (云杉) and cypress (柏树). In a home, the softwoods are used primarily as structural (结构的) lumber (木材) such as 2x4s and 2x6s, with some limited decorative (装饰性的) applications.

Using satellite imaging technology, the Department of Natural Resources has compiled (编译) an inventory (存货) of every tree standing on a particular day. You are to compute the total fraction (分数) of the tree population represented by each species.

Input

Input (投入) to your program consists of a list of the species (物种) of every tree observed by the satellite; one tree per line. No species name exceeds (超过) 30 characters. There are no more than 10,000 species and no more than 1,000,000 trees.

Output

Print the name of each species represented in the population, in alphabetical (字母的) order, followed by the percentage of the population it represents, to 4 decimal (小数) places.

Sample Input

Red Alder
Ash
Aspen
Basswood
Ash
Beech
Yellow Birch
Ash
Cherry
Cottonwood
Ash
Cypress
Red Elm
Gum
Hackberry
White Oak
Hickory
Pecan
Hard Maple
White Oak
Soft Maple
Red Oak
Red Oak
White Oak
Poplan
Sassafras
Sycamore
Black Walnut
Willow

Sample Output

Ash 13.7931
Aspen 3.4483
Basswood 3.4483
Beech 3.4483
Black Walnut 3.4483
Cherry 3.4483
Cottonwood 3.4483
Cypress 3.4483
Gum 3.4483
Hackberry 3.4483
Hard Maple 3.4483
Hickory 3.4483
Pecan 3.4483
Poplan 3.4483
Red Alder 3.4483
Red Elm 3.4483
Red Oak 6.8966
Sassafras 3.4483
Soft Maple 3.4483
Sycamore 3.4483
White Oak 10.3448
Willow 3.4483
Yellow Birch 3.4483

Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceeded.

Source

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;struct node
{int x;struct node *next[130];node(){x=0;memset(next,0,sizeof(next));}
};struct node *root = NULL;
int n;void build(char *s)
{struct node *p=root,*tmp;for(int i=0;s[i];i++){if(p->next[s[i]]==NULL){tmp=new node;p->next[s[i]]=tmp;}p=p->next[s[i]];}p->x++;};void dfs(node *root)
{static char word[31];static int pos;int i;if(root->x)   //如果cnt不为0,则肯定找到了一个单词{word[pos]='\0';if(word[0])printf("%s %.4lf\n",word,root->x*100*1.0/n);}for(i=0;i<128;i++){if(root->next[i]){word[pos++]=i;dfs(root->next[i]);pos--;}}
}int main()
{char str[31];n=0;root=new node;while(gets(str)&&str!=""){build(str);n++;}dfs(root);return 0;
}