Codeforces 741C Sonya and Queries（字典树）

数字的每一位分奇偶，向一个集合内实现插入和删除操作，询问某一数字与集合内所有数字的最大匹配数（每一位每一位的匹配）

例如：010可以匹配091，但是不可以匹配003；

字典树建个数，然后以字符串的方式度入，不满足的位数，也就是前面的部分补0就好了，在最后的节点进行++或--的操作。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N=1e5+5;
struct node
{
    int cou;
    node *n[3];
    void init()
    {
        for(int i=0;i<3;i++)
        {
            n[i]=NULL;
            cou=0;
        }
    }
};
node *root;

void ins(char str[])
{
    int len;
    node *p=root;
    len=strlen(str);
    //printf("len=%d\n",len);
    for(int i=1;i<=32-len;i++)
    {
        int temp=0;
        if(p->n[temp]==NULL)
        {
            p->n[temp]=new node();
            p->n[temp]->init();
        }
        p=p->n[temp];
    }
    for(int i=0;i<len;i++)
    {
        int temp=str[i]-'0';
        temp=temp%2;
        if(p->n[temp]==NULL)
        {
            p->n[temp]=new node();
            p->n[temp]->init();
        }
        p=p->n[temp];
    }
    p->cou++;
}
void sub(char str[])
{
    int len;
    node *p=root;
    len=strlen(str);
    for(int i=1;i<=32-len;i++)
    {
        int temp=0;
        if(p->n[temp]==NULL)
        {
            p->n[temp]=new node();
            p->n[temp]->init();
        }
        p=p->n[temp];
    }
    for(int i=0;i<len;i++)
    {
        int temp=str[i]-'0';
        temp=temp%2;
        if(p->n[temp]==NULL)
        {
            p->n[temp]=new node();
            p->n[temp]->init();
        }
        p=p->n[temp];
    }
    p->cou--;
}
int query(char str[])
{
    node *p=root;
    int len=strlen(str);
    for(int i=1;i<=32-len;i++)
    {
        int temp=0;
        if(p->n[temp]==NULL)
        {
            return 0;
        }
        p=p->n[temp];
    }
    for(int i=0;i<len;i++)
    {
        int temp=str[i]-'0';
        temp=temp%2;
        if(p->n[temp]==NULL)
        {
            return 0;
        }
        p=p->n[temp];
    }
    return p->cou;
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        char str[5];
        char s[20];

        root=new node();
        while(n--)
        {
            scanf("%s %s",str,s);
            if(str[0]=='+')
            {
                ins(s);
            }
            if(str[0]=='?')
            {
                int ans=query(s);
                printf("%d\n",ans);
            }
            if(str[0]=='-')
            {
                sub(s);
            }
        }
    }
    return 0;
}

C. Sonya and Queries

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Today Sonya learned about long integers and invited all her friends to share the fun. Sonya has an initially empty multiset with integers. Friends give her t queries, each of one of the following type:

1.  +  ai — add non-negative integer ai to the multiset. Note, that she has a multiset, thus there may be many occurrences of the same integer.
2.  -  ai — delete a single occurrence of non-negative integer ai from the multiset. It's guaranteed, that there is at least one ai in the multiset.
3. ? s — count the number of integers in the multiset (with repetitions) that match some pattern s consisting of 0 and 1. In the pattern, 0stands for the even digits, while 1 stands for the odd. Integer x matches the pattern s, if the parity of the i-th from the right digit in decimal notation matches the i-th from the right digit of the pattern. If the pattern is shorter than this integer, it's supplemented with 0-s from the left. Similarly, if the integer is shorter than the pattern its decimal notation is supplemented with the 0-s from the left.

For example, if the pattern is s = 010, than integers 92, 2212, 50 and 414 match the pattern, while integers 3, 110, 25 and 1030 do not.

Input

The first line of the input contains an integer t (1 ≤ t ≤ 100 000) — the number of operation Sonya has to perform.

Next t lines provide the descriptions of the queries in order they appear in the input file. The i-th row starts with a character ci — the type of the corresponding operation. If ci is equal to '+' or '-' then it's followed by a space and an integer ai (0 ≤ ai < 1018) given without leading zeroes (unless it's 0). If ci equals '?' then it's followed by a space and a sequence of zeroes and onse, giving the pattern of length no more than 18.

It's guaranteed that there will be at least one query of type '?'.

It's guaranteed that any time some integer is removed from the multiset, there will be at least one occurrence of this integer in it.

Output

For each query of the third type print the number of integers matching the given pattern. Each integer is counted as many times, as it appears in the multiset at this moment of time.

Examples

input

Copy

12
+ 1
+ 241
? 1
+ 361
- 241
? 0101
+ 101
? 101
- 101
? 101
+ 4000
? 0

output

2
1
2
1
1

input

Copy

4
+ 200
+ 200
- 200
? 0

output

1