Codeforces-809C Find a car（分治）

传送门：CF-809C

#include<bits/stdc++.h>#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define x first#define y second#define add(x,y) (x+=y)%=mod;using namespace std;typedef long long LL;const int MX = 2e5 + 5;const int inf = 0x3f3f3f3f;const LL mod = 1e9 + 7;LL k;LL solve(int x, int y, LL f) {    if (x == 0 || y == 0 || f > k) return 0;    if (x < y) swap(x, y);    if (x == (x & -x)) {        LL l = f, r = min(k, f + x - 1);        return (l + r) * (r - l + 1) / 2 % mod * y % mod;    }    int d = 1;    LL ret = 0;    while ((d << 1) < x) d <<= 1;    if (y <= d) {        add(ret, solve(d, y, f));        add(ret, solve(x - d, y, f + d));    } else {        add(ret, solve(d, d, f));        add(ret, solve(x - d, d, f + d));        add(ret, solve(d, y - d, f + d));        add(ret, solve(x - d, y - d, f));    }    return ret;}int main() {    //freopen("in.txt", "r", stdin);    int n;    scanf("%d", &n);    while (n--) {        int x1, x2, y1, y2;        scanf("%d%d%d%d%I64d", &x1, &y1, &x2, &y2, &k);        LL ans = solve(x2, y2, 1) + solve(x1 - 1, y1 - 1, 1) - solve(x1 - 1, y2, 1) - solve(x2, y1 - 1, 1);        printf("%I64d\n", (ans + 2 * mod) % mod);    }    return 0;}