hdu4760Good Firewall

4760

数组模拟就可以了 读的时候可以整数读入

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<queue>
 #include<cmath>
 #include<vector>
 using namespace std;
 #define LL __int64
 int len,maxz;
 LL ip[][][],pp[];
 int vis[],w[],di[],g;
 char s[],s1[],s2[];
 void init()
 {
     int i;
     pp[] = ;
     for(i = ; i <  ; i++)
     pp[i] = pp[i-]*;
 }
 void change(int a)
 {
     int x[],o=,i;
     while(a)
     {
         x[++o] = a%;
         a/=;
     }
     for(i = ; i <= -o ; i++)
     di[++g] = ;
     for(i = o ; i>= ; i--)
     di[++g] = x[i];
 }
 LL swit(int k,int e)
 {
     int i;
     LL sum=;
     if(k==)
     for(i =  ; i <= g ; i++)
     sum+=di[i]*pp[-i];
     else
     {
         for(i = ; i <= e ; i++)
         sum+=di[i]*pp[-i];
         for(i = e+ ; i <=  ; i++)
         sum+=pp[-i];
     }
     return sum;
 }
 int main()
 {
     int m,n,i,j;init();
     int a,b,c,d,e;
     char cc;
     while(scanf("%c",&cc)!=EOF)
     {
         if(cc=='E')
         {
             scanf("%d%d",&n,&m);
             w[n] = m;
             maxz = max(maxz,n);
             for(i = ; i <= m ;i++)
             {
                 getchar();
                 scanf("%d.%d.%d.%d/%d",&a,&b,&c,&d,&e);
                 g=;
                 change(a);change(b);change(c);change(d);
                 ip[n][i][] = swit(,);
                 ip[n][i][] = swit(,e);
             }
         }
         else if(cc=='F')
         {
             scanf("%d.%d.%d.%d",&a,&b,&c,&d);
             g=;
             change(a);change(b);change(c);change(d);
             LL fs1 = swit(,);
             scanf("%d.%d.%d.%d",&a,&b,&c,&d);
             g=;
             change(a);change(b);change(c);change(d);
             LL fs2 = swit(,);
             int flag = ;
             for(i =  ; i <= maxz ; i++)
             {
                 int f=,ff=;
                 if(vis[i]) continue;
                 for(j = ; j <= w[i] ; j++)
                 {
                     if(fs1>=ip[i][j][]&&fs1<=ip[i][j][])
                     f = ;
                     if(fs2>=ip[i][j][]&&fs2<=ip[i][j][])
                     ff = ;
                 }
                 if(ff&&f)
                 {
                     flag = ;
                     break;
                 }
             }
             if(flag)
             printf("F\n");
             else
             printf("D\n");
         }
         else
         {
             scanf("%d",&n);
             vis[n] = ;
         }
         gets(s);
     }
     return ;
 }