POJ 2418 Hardwood Species （字典树+dfs）

题意：

给若干个串，求每一个串出现的频率。
按字典序输出：串 频率*100
例如：Ash 13.7931

ps:
频率为该串出现的次数除以总串数

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

思路：

map好慢好慢好慢…

字典树存串，维护串的出现次数。

输入完之后从小到大按字典序dfs输出就行了。

ps:
题目给的字符好像不一定只有字母，我用s[i]-'a’会wa，s[i]-空格 就过了，贼坑

code:

//#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<map>
using namespace std;
const int maxm=1e6+5;
const int dif=1e4+5;
const int cha=100;
int sum;
struct Trie{
    int a[dif*cha][cha],tot;
    int num[dif*cha];
    map<int,string>name;
    void add(char s[]){
        int len=strlen(s);
        int node=0;
        for(int i=0;i<len;i++){
            int v=s[i]-' ';
            if(!a[node][v]){
                a[node][v]=++tot;
            }
            node=a[node][v];
        }
        num[node]++;
        name[node]=s;
    }
    void dfs(int node){
        if(num[node]){
            printf("%s %.4f\n",name[node].c_str(),num[node]*100.0/sum);
        }
        for(int i=0;i<cha;i++){
            if(a[node][i]){
                dfs(a[node][i]);
            }
        }
    }
}t;
signed main(){
    char s[35];
    while(gets(s)){
        sum++;
        t.add(s);
    }
    t.dfs(0);
    return 0;
}