POJ 2418 ,ZOJ 1899 Hardwood Species - from lanshui_Yang
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
Output
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的更多相关文章
- 广搜,深搜,单源最短路径,POJ(1130),ZOJ(1085)
题目链接: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=85 http://poj.org/problem?id=1130 这 ...
- [字典树] poj 2418 Hardwood Species
题目链接: id=2418">http://poj.org/problem?id=2418 Hardwood Species Time Limit: 10000MS Memory ...
- POJ 2418 Hardwood Species(STL在map应用)
职务地址:id=2418">POJ 2418 通过这个题查了大量资料..知道了非常多曾经不知道的东西. . .. 在代码中凝视说明吧. 代码例如以下: #include <ios ...
- [ACM] POJ 2418 Hardwood Species (Trie树或map)
Hardwood Species Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 17986 Accepted: 713 ...
- POJ 2418 Hardwood Species
Hardwood Species Time Limit: 10000MS Memory Limit ...
- Hardwood Species 分类: POJ 树 2015-08-05 16:24 2人阅读 评论(0) 收藏
Hardwood Species Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 20619 Accepted: 8083 De ...
- POJ 2240 Arbitrage / ZOJ 1092 Arbitrage / HDU 1217 Arbitrage / SPOJ Arbitrage(图论,环)
POJ 2240 Arbitrage / ZOJ 1092 Arbitrage / HDU 1217 Arbitrage / SPOJ Arbitrage(图论,环) Description Arbi ...
- POJ 之 Hardwood Species
Hardwood Species Time Limit:10000MS Memory ...
- Hardwood Species(水)
Time Limit:10000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatus Descrip ...
随机推荐
- 从零开始学java(猜数字游戏)
练练手不喜勿喷,看到什么学习什么第一次发博客格式就见见谅..... 2016-07-21 19:55:02 imp ...
- 封装Timer
System.Timers.Timer,System.Timers.Timer在使用的过程中需要: 1.构造函数不同,构造函数可以什么事情也不做,也可以传入响应间隔时间:System.Timers.T ...
- c 连接数据库 mysql
sudo apt-get install mysql-server mysql-client 再装开发包代码:sudo apt-get install libmysqlclient15-dev 安装完 ...
- unix 环境高级编程 读书笔记与习题解答第四篇
第一章 第六节 第一小节 这一章没有程序设计和API方面的深入学习,而是注重介绍了unix操作系统中的原始数据类型和系统原型函数,错误处理方面的知识. ____unistd.h____ 该文件包含了u ...
- bzoj3583: 杰杰的女性朋友 && 4362: Graph
Description 给出一张n个点的有向图G(V,E).对于任意两个点u,v(u可以等于v),u向v的连边数为: ∑OUT(u,i) * IN(v,i),其中1<=i<=K 其中k和数 ...
- 转:PHP之Traits
原文来自于:http://www.cnblogs.com/tekkaman/archive/2012/12/12/2814214.html 1.Traits基础 2.优先级:当前类中的方法会覆盖 Tr ...
- 【译】UI设计基础(UI Design Basics)--导航(Navigation)(六)
[译]UI设计基础(UI Design Basics)--导航(Navigation)(六)
- asp.net web api long running task
http://stackoverflow.com/questions/17577016/long-running-task-in-webapi http://blog.stephencleary.co ...
- Important Programming Concepts (Even on Embedded Systems) Part V: State Machines
Earlier articles in this series: Part I: Idempotence Part II: Immutability Part III: Volatility Part ...
- hdu 5147 Sequence II
http://acm.hdu.edu.cn/showproblem.php?pid=5147 题意:问有多少个这样的四元组(a,b,c,d),满足条件是 1<=a<b<c<d; ...