hdu2072

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<set>
#include<map>
#include<stack>
#include<cstring>
#include<sstream>
#pragma GCC optimize(2)
#define inf 2147483647
#define ls rt<<1
#define rs rt<<1|1
#define lson ls,nl,mid,l,r
#define rson rs,mid+1,nr,l,r
#define N 1000010
#define For(i,a,b) for(int i=a;i<=b;++i)
#define p(a) putchar(a)
#define g() getchar()

using namespace std;
string c,s;
int t,cnt,ans,num,w;
struct node{
    node *next[26];
    int now;
};
bool b[N];
node *root=new node();
node *p;
void in(int &x){
    int y=1;char c=g();x=0;
    while(c<'0'||c>'9'){if(c=='-')y=-1;c=g();}
    while(c<='9'&&c>='0'){ x=(x<<1)+(x<<3)+c-'0';c=g();}
    x*=y;
}
void o(int x){
    if(x<0){p('-');x=-x;}
    if(x>9)o(x/10);
    p(x%10+'0');
}

void Insert(string c){
    p=root;
    For(i,0,c.size()-1){
        t=c[i]-'a';
        if(p->next[t]==0)
            p->next[t]=new node();    
        p=p->next[t];
    }
    p->now++;
    if(p->now==1)
        ans++;
}

void clear(){
    ans=0;
    num=0;
    root=new node();
}

int main(){
    while(getline(cin,s)){
        if(s=="#")
            return 0;
        clear();        
        istringstream ss(s);
        while(ss>>c)
            Insert(c);
        o(ans);p('\n');
    }
    return 0;
}

 

字典树裸题，字符串的末节点出现次数++，次数为一的贡献了答案。
主要收获是读入的技巧

转载于:https://www.cnblogs.com/war1111/p/11252768.html