HNU Judging Troubles (字典树)

The input consists of:

? one line with one integer n (1 ≤ n ≤ 10^5), the number of submissions;

? n lines, each with a result of the judging by DOMjudge, in arbitrary order;

? n lines, each with a result of the judging by Kattis, in arbitrary order.

Each result is a string of length between 5 and 15 characters (inclusive) consisting of lowercase letters.

Output one line with the maximum number of judging results that could have been the same for both systems.

5
correct
wronganswer
correct
correct
timelimit
wronganswer
correct
timelimit
correct
timelimit

4

#include<stdio.h>
struct node{
    node* nxt[26];
    int k;
    node(){
        for(int i=0; i<26; i++)
            nxt[i]=NULL;
        k=0;
    }
};
node* root;
void inset(char s[])
{
    node* p=root;
    int i=0;
    while(s[i]!='\0'){
        if(p->nxt[s[i]-'a']==NULL)
            p->nxt[s[i]-'a']=new node();
        p=p->nxt[s[i]-'a'];
        i++;
    }
    (p->k)++;
}
int query(char s[])
{
    node* p=root;
    int i=0;
    while(s[i]!='\0'&&p->nxt[s[i]-'a']!=NULL){
        p=p->nxt[s[i]-'a'];
        i++;
    }
    if(p->k&&s[i]=='\0')
    {
        (p->k)--; return 1;
    }
    return 0;
}
int main()
{
    int n;
    char s[20];
    while(scanf("%d",&n)>0)
    {
        root=new node();
        for(int i=0; i<n; i++)
        {
            scanf("%s",s);
            inset(s);
        }
        int ans=0;
        while(n--)
        {
            scanf("%s",s);
            ans+=query(s);
        }
        printf("%d\n",ans);
    }
}