C - Sonya and Queries

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:

+  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.
 -  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.
? s — count the number of integers in the multiset (with repetitions) that match some pattern s consisting of 0 and 1. In the pattern, 0 stands 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
12

• 1
• 241
  ? 1
• 361

• 241
  ? 0101

• 101
  ? 101

• 101
  ? 101

• 4000
  ? 0
  Output
  2
  1
  2
  1
  1
  Input
  4
• 200
• 200

• 200
  ? 0
  Output
  1
  Note
  Consider the integers matching the patterns from the queries of the third type. Queries are numbered in the order they appear in the input.

1 and 241.
361.
101 and 361.
361.
4000.

题解：
把每个插入的数按奇偶性转化成01序列，再算出这个二进制数对应的十进制，然后对这个十进制计数
对于每一次查询s，把s转换成十进制输出计数就好了

#include<iostream>
using namespace std;
int ans[300000];
long long solve(long long a)//十进制转二进制转十进制（yun）
{
    long long b=0,p=1;
    while(a)
    {
        if(a%2) b+=p;
        a/=10;
        p*=2;
    }
    return b;
}
void init(long long a,char &c)//插入删除
{
    long long b=solve(a);
    if(c=='+') ans[b]++;
    else ans[b]--;
}
int main()
{
    ios::sync_with_stdio(false);//玄学加速
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        char c;
        long long a;
        cin>>c>>a;
        if(c!='?') init(a,c);
        else cout<<ans[solve(a)]<<endl;
    }
}