1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
struct node
{
    struct node *left,*right;
    int x;
    int pos;
}*ptree,tree;
char limit[20];
long long int a[100005],c[100005],mark3[100005];
int main()
{
    char w;
    long long int n,q,i,k,x1,x2,x3,x4,j,h,d;
    scanf("%lld%lld",&n,&q);
    for(i=1;i<=n;i++)
    {
        k=32;
        scanf("%s",limit);
        scanf("%lld.%lld.%lld.%lld",&x1,&x2,&x3,&x4);
         a[i]=x1*2048*2048*4+x2*1024*64+x3*256+x4;
         if(limit[0]=='a') mark3[i]=1;
         else mark3[i]=-1;
        w=getchar();
        if(w=='/') scanf("%lld",&k);
        c[i]=k;
    }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX