2019上海区域赛B Prefix Code

B Prefix Code

题意：给出n个数字(有前缀0)，长度均小于10，问是否有一个数是其他数的前缀？
思路：字典树查找即可，vis表示走过的路径和ed标记结尾，在insert就可判断。

code

#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
const int man = 1e4+10;
#define IOS ios::sync_with_stdio(0)
template <typename T>
inline T read(){T sum=0,fl=1;int ch=getchar();
for(;!isdigit(ch);ch=getchar())if(ch=='-')fl=-1;
for(;isdigit(ch);ch=getchar())sum=sum*10+ch-'0';
return sum*fl;}
template <typename T>
inline void write(T x) {static int sta[35];int top=0;
do{sta[top++]= x % 10, x /= 10;}while(x);
while (top) putchar(sta[--top] + 48);}
template<typename T>T gcd(T a, T b) {return b==0?a:gcd(b, a%b);}
template<typename T>T exgcd(T a,T b,T &g,T &x,T &y){if(!b){g = a,x = 1,y = 0;}
else {exgcd(b,a%b,g,y,x);y -= x*(a/b);}}
#ifndef ONLINE_JUDGE
#define debug(fmt, ...) {printf("debug ");printf(fmt,##__VA_ARGS__);puts("");}
#else
#define debug(fmt, ...)
#endif
typedef long long ll;
const ll mod = 1e9+7;

int tr[man*15][10];
int cnt = 0;
int vis[man*15];
bool ed[man*15];
bool ans;
void insert(const char *s){
    int p = 0;
    for(int i = 0;s[i];i++){
        int tp = s[i] - '0';
        if(!tr[p][tp])tr[p][tp] = ++cnt;
        p = tr[p][tp];
        if(ed[p])ans = 1;//这个数包含其它前缀
        vis[p]++;
    }
    if(vis[p]>1)ans = 1;//这个数为其它数的前缀
    ed[p] = 1;
}

void init(){
    for(int i = 0;i <= cnt;i++){
        memset(tr[i],0,sizeof(tr[i]));
        vis[i] = 0;
        ed[i] = 0;
    }
    cnt = 0;
    ans = 0;
}

int main() {
    #ifndef ONLINE_JUDGE
        //freopen("in.txt", "r", stdin);
        //freopen("out.txt","w",stdout);
    #endif
    int t;
    cin >>t;
    int T = 1;
    while(t--){
        int n;
        init();
        cin >> n;
        char str[15];
        while(n--){
            cin >> str;
            insert(str);
        }
        cout << "Case #" << T++ <<":";
        if(ans)cout << " No\n";
        else cout << " Yes\n";  
    }   
    return 0;
}