wenbao与字典树（二）

http://acm.hdu.edu.cn/showproblem.php?pid=1247

 

#include <iostream>
#include <stdio.h>
using namespace std;
#define maxn 50
char a[50005][60];
struct Node{
    int flag;
    Node *next[maxn];
    Node(){
        flag=0;
        for(int i=0; i<maxn; i++)
            next[i]=NULL;
    }
} N;

void add(char x[]){
    Node *p=&N;
    for(int i=0; x[i]; i++){
        int xx=x[i]-'a';
        if(p->next[xx]==NULL)
            p->next[xx]=new Node;
        p=p->next[xx];
    }
    p->flag=1;
}

int findn(char x[]){
    Node *q=&N;
    for(int i=0; x[i]; i++){
        int xx=x[i]-'a';
        if(q->next[xx]){
            q=q->next[xx];
            if(q->flag){
                int ff=1;
                Node *t=&N;
                for(int j=i+1; x[j]; j++){
                    int yy=x[j]-'a';
                    if(t->next[yy])
                        t=t->next[yy];
                    else{
                        ff=0;
                        break;
                    }
                }
                if(ff){
                    if(t->flag)
                        return 1;
                }
            }
        }
    }
    return 0;
}

int main(){
    int n=0;
    while(~scanf("%s",a[n])){
        add(a[n]);
        n++;
    }
    for(int i=0; i<n; i++){
        if(findn(a[i]))
            printf("%s\n",a[i]);
    }
    return 0;
}

 

 

看心情更新，啦啦啦啦啦啦~~~~

 

#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
const int maxn = 50010;
char str[maxn][50];
int n = 0, num = 1, m = 0, tree[maxn*4][30], flag[maxn*4];
void add(){
    int node = 0;
    for(int i = 0; str[n][i]; i++){
        int xx = str[n][i] - 'a';
        if(!tree[node][xx]) tree[node][xx] = num++;
        node = tree[node][xx];
    }
    flag[node] = 1;
}
bool query(){
    int node = 0, len = strlen(str[m]);
    for(int i = 0; str[m][i]; i++){
        int xx = str[m][i] -'a';
        node = tree[node][xx];
        if(flag[node]){
            int node2 = 0, j;
            for(j = i+1; str[m][j]; j++){
                int xxx = str[m][j] -'a';
                if(!tree[node2][xxx]) break;
                node2 = tree[node2][xxx];
            }
            if(j == len && flag[node2]) return true;
        }
    }
    return false;
}
int main(){
    while(~scanf("%s", str[n])){
        add(), n++;
    }
    while(n--){
        if(query()){
            printf("%s\n", str[m]);
        }
        m++;
    }
    return 0;
}

 

------------------------------------------------------------------------

 

http://acm.hdu.edu.cn/showproblem.php?pid=1277

 

将关键字建立字典树

 

#include <iostream>
using namespace std;
int n, m, cnt = 0;
char str[60009], ss[69];
int vis[700000], sum[700000][26];
bool mark[700000], flag = false;
void in(int x){
    int root = 0;
    for(int i = 0; ss[i]; ++i){
        int xx = ss[i]-'0';
        if(!sum[root][xx]) sum[root][xx] = cnt++;
        root = sum[root][xx];
    }
    vis[root] = x;
}
void f(int x){
    int root = 0;
    for(int i = x; str[i] != '\0'; ++i){
        int xx = sum[root][str[i]-'0'];
        if(!xx) return;
        if(vis[xx] && !mark[xx]){
            if(!flag){
                printf("Found key: [Key No. %d]", vis[xx]);
                flag = true;
            }else{
                printf(" [Key No. %d]", vis[xx]);
            }
            mark[xx] = true;
        }
        root = xx;
    }
}
int main(){
    scanf("%d%d", &n, &m);
    getchar();
    char c;
    int nn = 0, num = 0;
    c = getchar();
    while(true){
        if(c == '\n'){
            nn++;
            if(nn == n) break;
            c = getchar();
            continue;
        }
        str[num++] = c;
        c = getchar();
    }
    str[num] = '\0';
    getchar();
    char tp[5];
    for(int i = 1; i <= m; ++i){
        scanf(" %s%s%s%s", tp, tp, tp, ss);
        in(i);
    }
    for(int i = 0; str[i] != '\0'; ++i){
        f(i);
    }
    if(!flag) printf("No key can be found !\n");
    else printf("\n");
    return 0;
}

 

 

---------------------------------------------

 

http://codeforces.com/contest/842/problem/D

 

全局异或求mex

 

#include <iostream>
using namespace std;

const int maxn = 3e5+10;
const int maxr = 6e6+10;
int num = 1, a[maxr][2], sum[maxr];
bool vis[maxn];

void add(int x){
    int root = 1;
    for(int i = 31; i >= 0; --i){
        int id = ((x>>i)&1);
        if(!a[root][id]) a[root][id] = ++num;
        root = a[root][id];
        sum[root] ++;
    }
}

int q(int x){
    int root = 1, cnt = 0;
    for(int i = 31; i >= 0; --i){
        int id = ((x>>i)&1);
        if(!a[root][id]) return cnt;
        if(sum[a[root][id]] == (1<<i)){
            root = a[root][1-id], cnt |= (1<<i);
        }else{
            root = a[root][id];
        }
    }
    return cnt;
}

int main(){
    int n, m, x, y = 0;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; ++i){
        scanf("%d", &x);
        if(!vis[x]) vis[x] = true, add(x);
    }
    while(m--){
        scanf("%d", &x);
        y ^= x;
        printf("%d\n", q(y));
    }
    return 0;
}

 

 

------------------------------------------

 

 

只有不断学习才能进步！