HihoCoder#1513 : 小Hi的烦恼(五维数点 bitset 分块)

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 30001;
inline int read() {
    int x = 0, f = 1; char c = getchar();
    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, a[5][MAXN], rak[5][MAXN], base = 1;
bitset<MAXN> B[5][175];
main() {
    N = read(); base = sqrt(N);
    for (int i = 1; i <= N; i++) for (int j = 0; j < 5; j++) a[j][i] = read(), rak[j][a[j][i]] = i;
    for (int j = 0; j < 5; j++) 
        for (int i = 1; i * base <= N; i++) 
            for(int k = 1; k <= i * base; k++) B[j][i].set(rak[j][k]);  
    for (int i = 1; i <= N; i++) {
        bitset<MAXN> tmp, cal; tmp.set();
        for(int j = 0; j < 5; j++) {
            cal.reset();
            int now = a[j][i] / base;
            cal |= B[j][now];
            for(int k = now * base + 1; k <= a[j][i]; k++) cal.set(rak[j][k]); 
            tmp &= cal;
        }
        printf("%d\n", tmp.count() - 1);
    }
}