Codeforces Round #502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) D. The Wu （思维 + 2进制预处理前缀和）_childan is making up a legendary story and trying -CSDN博客

本文链接：https://blog.csdn.net/Lee_w_j__/article/details/81544415

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

Output

Copy

Input

Copy

Output

Copy

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.

题目大意：给出m个长度为n的01串。每个01串每一位如果成功进行匹配就能获得相对应的权值val[i]，q次询问，每次询问给出一个01串S和一个权值k，询问当前01串S与给出的m个01串进行匹配有多少个匹配获得的权值是小于k的。

题目思路：由于本题的数据范围n<=12非常小，我们就可以考虑对所有长度小于等于12的01串做预处理，算出所有串与给出的m个串匹配的得分情况，01串的总个数也就只有2^12，所以预处理的总复杂度只有O(2^12*2^12)，然后再用个前缀和记录下某一个串得分的数量，查询的时候直接借助前缀和查询即可。总的时间复杂度为O(2^12*2^12+q)。

具体实现看代码：

#include <bits/stdc++.h>
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lowbit(x) x&-x
#define pb push_back
#define MP make_pair
#define clr(a) memset(a,0,sizeof(a))
#define INF(a) memset(a,0x3f,sizeof(a))
#define FIN freopen("in.txt","r",stdin)
#define fuck(x) cout<<"["<<x<<"]"<<endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,ll>pll;
typedef vector<int> VI;
//head
const int maxn=1200;

int n,q,m;
int val[13];
int num[(1<<13)];
int sum[(1<<13)][maxn];

int main(){
    scanf("%d%d%d",&n,&m,&q);
    for(int i=0;i<n;i++) scanf("%d",&val[i]);
    for(int i=1;i<=m;i++){
        char s[15];
        scanf("%s",s);
        int len=strlen(s);
        int tmp=0;
        for(int j=0;j<len;j++){
            if(s[j]=='1') tmp|=(1<<j);
        }
        //cout<<tmp<<endl;
        num[tmp]++;
    }
    for(int i=0;i<(1<<n);i++){
        for(int j=0;j<(1<<n);j++){
            if(num[j]==0) continue;
            int cnt=0;
            for(int k=0;k<n;k++){
                if(((i>>k)&1) == ((j>>k)&1))
                    cnt+=val[k];
            }
           // cout<<i<<" "<<j<<" "<<cnt<<endl;
            sum[i][cnt]+=num[j];
        }
    }
    for(int i=0;i<(1<<n);i++){
        for(int j=1;j<maxn;j++){
            sum[i][j]+=sum[i][j-1];
        }
    }
    while(q--){
        int k;
        char s[15];
        scanf("%s%d",s,&k);
        int len=strlen(s);
        int tmp=0;
        for(int j=0;j<len;j++){
            if(s[j]=='1') tmp|=(1<<j);
        }
        printf("%d\n",sum[tmp][k]);
    }
    return 0;
}