hiho149周 - 数据结构 trie树

题目链接

坑点：accept和deny的ip可能相同，需加个判断

#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <cstring>
#include <iostream>
#define OO 0x0fffffff
#define MIN(a,b) (a<b?a:b)
using namespace std;

struct NODE{
    NODE *left,*right;
    int aid;
    bool accept;
    NODE(){
        aid = -;
        left = right = NULL;
    }
};
NODE root;
int digits[];
void add_acl(int id,char *acl,bool accept){
    NODE *ptr = &root;
    for(int i=;acl[i];i++){
        if(acl[i]=='') {
            if(ptr->right==NULL) ptr->right = new NODE();
            ptr = ptr->right;
        }
        else{
            if(ptr->left==NULL) ptr->left = new NODE();
            ptr = ptr->left;
        }
    }
    if(ptr->aid<){
        ptr->aid = id;
        ptr->accept = accept;
    }
}
void parse_ip(char *input,char *output,int len){
    sscanf(input,"%d.%d.%d.%d",digits+,digits+,digits+,digits+);
    int i,j;
    for(i=;i<;i++){
        int td = digits[i];
        for(j=(i+)*-;j>=i*;j--){
            output[j] = ''+(td&);
            td>>=;
        }
    }
    output[len]='\0';
}
int main(){
    int m,n,len;
    char type[],str[],ip[];
    scanf("%d%d",&n,&m);
    for(int i=;i<n;i++){
        cin>>type>>str;
        len = ;
        std::size_t idx = string(str).find('/');
        if(idx!=std::string::npos){
            str[idx]='\0';
            len = atoi(str+idx+);
        }
        parse_ip(str,ip,len);
        add_acl(i,ip,type[]=='a');
    }
    for(int i=;i<m;i++){
        cin>>str;
        parse_ip(str,ip,);
        NODE *ptr = &root;
        int ans = OO;
        bool accept = true;
        int iptr = ;
        while(ptr){
            if(ptr->aid>=) {
                if(ptr->aid<ans){
                    ans = ptr->aid;
                    accept = ptr->accept;
                }
            }
            if(ip[iptr]=='') ptr=ptr->right;
            else ptr=ptr->left;
            iptr++;
        }
        puts(accept?"YES":"NO");
    }
    return ;
}