BZOJ2506 calc

Orz hzwer巨巨

竟然要分块。。。本来以为离线就好了。。。

 

/**************************************************************
    Problem: 2506
    User: rausen
    Language: C++
    Result: Accepted
    Time:920 ms
    Memory:6320 kb
****************************************************************/
 
#include <cstdio>
#include <algorithm>
 
using namespace std;
const int N = 100005;
const int M = 105;
 
struct data {
    int x, p, k, w, f;
    data() {}
    data(int _x, int _p, int _k, int _w, int _f) : x(_x), p(_p), k(_k), w(_w), f(_f) {}
}q[N << 1];
inline bool operator < (const data &a, const data &b) {
    return a.x < b.x;
}
 
int n, m, tot, Max;
int a[N], f1[M][M], f2[N];
int ans[2][N];
 
inline int read() {
    int x = 0;
    char ch = getchar();
    while (ch < '0' || '9' < ch)
        ch = getchar();
    while ('0' <= ch && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x;
}
 
void add(int x) {
    for (int i = 1; i <= 100; ++i)
        ++f1[i][x % i];
    ++f2[x];
}
 
int main() {
    int i, j;
    int l, r, p, k;
    n = read(), m = read();
    for (i = 1; i <= n; ++i)
        a[i] = read(), Max = max(Max, a[i]);
    for (i = 1; i <= m; ++i) {
        l = read(), r = read(), p = read(), k = read();
        q[++tot] = data(l - 1, p, k, i, 0);
        q[++tot] = data(r, p, k, i, 1);
    }
    sort(q + 1, q + tot + 1);
    int now = 0;
    for (i = 1; i <= tot; ++i) {
        while (now < q[i].x)
            ++now, add(a[now]);
        p = q[i].p, k = q[i].k;
        if (p <= 100)
            ans[q[i].f][q[i].w] = f1[p][k];
        else
            for (j = k; j <= Max; j += p)
                ans[q[i].f][q[i].w] += f2[j];
    }
    for (i = 1; i <= m; ++i)
        printf("%d\n", ans[1][i] - ans[0][i]);
}