codeforces-D. The Wu（状压+树状数组）

D. The Wu

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Childan is making up a legendary story and trying to sell his forgery — a necklace with a strong sense of "Wu" to the Kasouras. But Mr. Kasoura is challenging the truth of Childan's story. So he is going to ask a few questions about Childan's so-called "personal treasure" necklace.

This "personal treasure" is a multiset S

of m

"01-strings".

A "01-string" is a string that contains n

characters "0" and "1". For example, if n=4, strings "0110", "0000", and "1110" are "01-strings", but "00110" (there are 5 characters, not 4

) and "zero" (unallowed characters) are not.

Note that the multiset S

can contain equal elements.

Frequently, Mr. Kasoura will provide a "01-string" t

and ask Childan how many strings s are in the multiset S such that the "Wu" value of the pair (s,t) is not greater than k

.

Mrs. Kasoura and Mr. Kasoura think that if si=ti

(1≤i≤n) then the "Wu" value of the character pair equals to wi, otherwise 0. The "Wu" value of the "01-string" pair is the sum of the "Wu" values of every character pair. Note that the length of every "01-string" is equal to n

.

For example, if w=[4,5,3,6]

, "Wu" of ("1001", "1100") is 7 because these strings have equal characters only on the first and third positions, so w1+w3=4+3=7

.

You need to help Childan to answer Mr. Kasoura's queries. That is to find the number of strings in the multiset S

such that the "Wu" value of the pair is not greater than k

.

Input

The first line contains three integers n

, m, and q (1≤n≤12, 1≤q,m≤5⋅105) — the length of the "01-strings", the size of the multiset S

, and the number of queries.

The second line contains n

integers w1,w2,…,wn (0≤wi≤100) — the value of the i

-th caracter.

Each of the next m

lines contains the "01-string" s of length n — the string in the multiset S

.

Each of the next q

lines contains the "01-string" t of length n and integer k (0≤k≤100

) — the query.

Output

For each query, print the answer for this query.

Examples

Input

Copy

2 4 5
40 20
01
01
10
11
00 20
00 40
11 20
11 40
11 60

Output

Copy

2
4
2
3
4

Input

Copy

1 2 4
100
0
1
0 0
0 100
1 0
1 100

Output

Copy

1
2
1
2

Note

In the first example, we can get:

"Wu" of ("01", "00") is 40

.

"Wu" of ("10", "00") is 20

.

"Wu" of ("11", "00") is 0

.

"Wu" of ("01", "11") is 20

.

"Wu" of ("10", "11") is 40

.

"Wu" of ("11", "11") is 60

.

In the first query, pairs ("11", "00") and ("10", "00") satisfy the condition since their "Wu" is not greater than 20

.

In the second query, all strings satisfy the condition.

In the third query, pairs ("01", "11") and ("01", "11") satisfy the condition. Note that since there are two "01" strings in the multiset, the answer is 2

, not 1

.

In the fourth query, since k

was increased, pair ("10", "11") satisfies the condition too.

In the fifth query, since k

was increased, pair ("11", "11") satisfies the condition too.

 

思路：这道题要灵活运用状压。

代码：

#include<bits/stdc++.h>
using namespace std;
int n,m,q;
int c[1<<12|1],a[1<<12|1][1205];
int w[20];
int val;
char s[20];
int lb(int x){return x&(-x);}
void add1(int id,int x,int num){
    while(x<1205)///x指的是价值，指x坐标
    {
        a[id][x]+=num;
        x+=lb(x);
    }
}
int query1(int id,int x){
    int ans=0;
    while(x){
        ans+=a[id][x];
        x-=lb(x);
    }
    return ans;
}
void add(int id,int i,int v)
{
    while(i<1205)
    {
        a[id][i]+=v;
        i+=lb(i);
    }
}
int query(int id,int i)
{
    int ans=0;
    while(i>0)
    {
        ans+=a[id][i];
        i-=lb(i);
    }
    return ans;
}
int main()
{

    char ch[20],s[20];
    scanf("%d%d%d",&n,&m,&q);
    memset(a,0,sizeof(a));memset(c,0,sizeof(c));
    for(int i=0;i<n;i++)   scanf("%d",&w[i]);
    ///首先做一下预处理
    for(int i=0;i<m;i++){
        scanf("%s",ch);
        int x=0;
        for(int j=0;j<n;j++){
            if(ch[j]=='1')
                x|=(1<<j);
        }
        c[x]++;///记录一下
    }
     int lala=1<<n;
     for(int i=0;i<lala;i++)
        {
            for(int j=0;j<lala;j++)
            if(c[j])
            {
                int x=0;
                for(int k=0;k<n;k++)
                {
                    if((i&(1<<k))==(j&(1<<k)))///&同一个数相等，说明i和j相等
                    x+=w[k];
                }
                add(i,x+1,c[j]);
            }
        }

        while(q--)
        {
                scanf("%s",s);
                int x=0;
                for(int i=0;i<n;i++)
                {
                    if(s[i]=='1')
                        x|=(1<<i);
                }
                scanf("%d",&val);
                printf("%d\n",query(x,val+1));///查询到val的有几个
        }
    return 0;
}