洛谷P4424 [HNOI/AHOI2018]寻宝游戏(思维题)

#include<bits/stdc++.h>
#define LL long long 
using namespace std;
const int MAXN = 5e5 + 10, INF = 1e9 + 7, mod = 1000000007;
template<typename A, typename B> inline void chmax(A &x, B y) {
    x = x > y ? x : y;
}
template<typename A, typename B> inline void chmin(A &x, B y) {
    x = x < y ? x : y;
}
template<typename A, typename B> inline void add2(A &x, B y) {
    x = (x + y >= mod ? x + y - mod : x + y);
}
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}
int N, M, Q, v[MAXN], rak[MAXN], po2[MAXN], sa[MAXN], val[MAXN];
char a[1002][5002], q[5001];
int comp(const int &x, const int &y) {
    for(int i = N; i >= 1; i--)
        if(a[i][x] == '0' && a[i][y] == '1') return 1;
        else if(a[i][x] == '1' && a[i][y] == '0') return 0;
    return 0;
}
int trans(int id) {
    int ans = 0;
    for(int i = N; i >= 1; i--) 
        if(a[i][id] == '1') add2(ans, po2[i - 1]);
    return ans;
}
int main() {
//  freopen("a.in", "r", stdin);
    N = read(); M = read(); Q = read(); po2[0] = 1;
    for(int i = 1; i <= N; i++) scanf("%s", a[i] + 1), po2[i] = (po2[i - 1] * 2) % mod;
    for(int i = 1; i <= N; i++) a[i][M + 1] = '1', a[i][0]= '0'; 
    for(int i = 1; i <= M + 1; i++) sa[i] = i;
    sort(sa + 1, sa + M + 2, comp);
    for(int i = 1; i <= M + 1; i++) rak[sa[i]] = i;
    for(int i = 1; i <= M + 1; i++) val[i] = trans(i); val[M + 1]++;//不++就比答案少1，加了莫名其妙就过了。。。 
    for(int i = 1; i <= Q; i++) {
        scanf("%s", q + 1);
        int r = M + 1, l = 0;
        for(int j = 1; j <= M; j++) 
            if(q[j] == '1') chmin(r, rak[j]);
            else chmax(l, rak[j]);
        if(l > r) puts("0");
        else cout << (val[sa[r]] - val[sa[l]] + mod) % mod << '\n';
    }
    return 0;
}
/*
3
0 1 1
5 7 3
*/