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

题目大意:给你一些字符串,让你统计每个字符串出现的概率。

解题思路:此题我是用Trie树来写的,用map可能会TLE。输出字符串的时候要求按字典序,于是我就用了dfs。

Ps:这道题在POJ上是单组数据,但在ZOJ上是多组数据,请大家注意!另外,此题中的字符串中可能会包含除字母外的其他字符,大家小心!

请看代码:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define mem(a , b) memset(a , b , sizeof(a) )
using namespace std ;
const int MAXN = 3e5 + 5 ;
char A[50] ;
int vis[MAXN] ; // 建立标记数组,用于最后输出字符串
int cnt ; // 给Trie树中每个结点设定编号
int sum ; // 统计字符串的个数
struct Tnode
{
int count ; // 统计该结点出现的单词个数
char f ; // 记录Trie树中结点所存的字符
int xu ; // 记录Trie树中结点的序号
Tnode * next[256] ; // 数组开大一些,因为可能会包含除字母外的其他字符。
Tnode()
{
count = 0 ;
f = 0 ;
xu = 0 ;
mem(next , 0) ;
}
} ;
char s[50] ;
void inse(char * str , Tnode * root)
{
Tnode * p = root ;
int id ;
while (*str)
{
id = *str - '\0' ;
if(p -> next[id] == 0)
{
p -> next[id] = new Tnode ;
p -> next[id] -> xu = ++ cnt ;
p -> next[id] -> f = *str ;
}
p = p -> next[id] ;
++ str ;
}
p -> count ++ ;
}
double ans ;
void print(int deep , Tnode * p) // dfs 按字典序输出字符串 , deep为递归的深度
{
int i ;
for(i = 0 ; i < 256; i ++ )
{
if(p -> next[i] != NULL)
{
int tmp = p -> next[i] -> xu ;
A[deep] = p -> next[i] -> f ;
if(p -> next[i] -> count > 0 && !vis[tmp])
{
vis[tmp] = 1 ;
ans = p -> next[i] -> count * 100.0 / sum * 1,0;
int j ;
for(j = 0 ; j <= deep ; j ++)
{
printf("%c" , A[j]) ;
}
printf(" %.4f\n" ,ans) ;
}
print(deep + 1 , p -> next[i]) ;
}
}
}
int main()
{
bool flag = false ;
while (gets(s))
{
if(flag) // 相邻两组数据间输出一个空行
printf("\n") ;
else
flag = true ;
cnt = 0 ;
sum = 0 ;
Tnode * root = new Tnode ;
memset(vis , 0 , sizeof(vis)) ;
inse(s , root) ;
sum ++ ;
while (gets(s) && strlen(s))
{
inse(s , root) ;
sum ++ ;
}
print(0 , root) ;
}
return 0 ;
}

POJ 2418 ,ZOJ 1899 Hardwood Species - from lanshui_Yang的更多相关文章

  1. 广搜,深搜,单源最短路径,POJ(1130),ZOJ(1085)

    题目链接: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=85 http://poj.org/problem?id=1130 这 ...

  2. [字典树] poj 2418 Hardwood Species

    题目链接: id=2418">http://poj.org/problem?id=2418 Hardwood Species Time Limit: 10000MS   Memory ...

  3. POJ 2418 Hardwood Species(STL在map应用)

    职务地址:id=2418">POJ 2418 通过这个题查了大量资料..知道了非常多曾经不知道的东西. . .. 在代码中凝视说明吧. 代码例如以下: #include <ios ...

  4. [ACM] POJ 2418 Hardwood Species (Trie树或map)

    Hardwood Species Time Limit: 10000MS   Memory Limit: 65536K Total Submissions: 17986   Accepted: 713 ...

  5. POJ 2418 Hardwood Species

                                                     Hardwood Species Time Limit: 10000MS   Memory Limit ...

  6. Hardwood Species 分类: POJ 树 2015-08-05 16:24 2人阅读 评论(0) 收藏

    Hardwood Species Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 20619 Accepted: 8083 De ...

  7. POJ 2240 Arbitrage / ZOJ 1092 Arbitrage / HDU 1217 Arbitrage / SPOJ Arbitrage(图论,环)

    POJ 2240 Arbitrage / ZOJ 1092 Arbitrage / HDU 1217 Arbitrage / SPOJ Arbitrage(图论,环) Description Arbi ...

  8. POJ 之 Hardwood Species

                                                         Hardwood Species Time Limit:10000MS     Memory ...

  9. Hardwood Species(水)

    Time Limit:10000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u SubmitStatus Descrip ...

随机推荐

  1. sqlserver-事务处理

    事务的概念:简单说就访问并可能更新数据库中各种数据项的一个程序执行单元,一旦开启事务,所有对数据的操作要么全部执行,要么全部都不执行.单条sql语句本身就是一个事务. 事务的属性: 事务是作为单个逻辑 ...

  2. 数据挖掘经典书籍[ZZ]

    数据挖掘就是在数据库中查找所需数据的过程,它是随着数据库产生的一门学科.近几年,数据库的发展还是非常迅速的,数据挖掘也成为热门技术,学习的人络绎不绝.下面给大家介绍的就是数据挖掘经典书籍及数据挖掘书籍 ...

  3. SGU 199 Beautiful People(DP+二分)

    时间限制:0.25s 空间限制:4M 题意: 有n个人,每个人有两个能力值,只有一个人的两个能力都小于另一个的能力值,这两个人才能共存,求能同时共存的最大人数. Solution: 显然这是一个两个关 ...

  4. One-day-学习笔记-商品成交时发送短信

    个人学习笔记(one) 根据需求:商品成交时发送短信 html代码省略..... Model代码省略..... /* * --------------------------------------- ...

  5. 去除VS2010中中文注释下的红色波浪线

    1,中文注释以分号结尾 2,Assist X 菜单栏->Assist X Option->Underline 选择“min”.

  6. 学习opencv 第六章 习题十三

    用傅里叶变换加速卷积,直接上代码,Mat版是Copy他人的. CvMat版 #include "stdafx.h" #include "cv.h" #inclu ...

  7. 优秀开源项目的svn地址

    很多优秀的开源项目已经提供SVN源码签出了,无论是解疑还是学习,都是一大幸福之事啊! Apache的SVN库,强烈推荐! http://svn.apache.org/repos/asf/ 里面不但有S ...

  8. windows 下安装nodejs及其配置环境

    第一步:下载安装文件下载nodejs,官网:http://nodejs.org/download/,我这里下载的是node-v0.10.28-x86.msi,如下图: 第二步:安装nodejs下载完成 ...

  9. Unity3d项目合作 场景的合并和还原

    Unity3d项目合作  场景的合并和还原 特别声明:转载自Unity3D研究院 如何侵犯版权,请通知我删除! 摘要: 导出Unity场景的所有游戏对象信息,一种是XML一种是JSON.本篇文章我们把 ...

  10. hdu 5113 Black And White

    http://acm.hdu.edu.cn/showproblem.php?pid=5113 题意:给你n*m的格子,然后在每个格子内涂色,相邻格子不能同色,然后给你每个颜色涂的格子的固定个数,然后可 ...