hdu 6333 多校第4场B

代码如下

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn=100005;
ll f[maxn]={1,1},inv[maxn]={1,1},finv[maxn]={1,1},ans[maxn];
int pos[maxn],sz,t;
const ll M=1e9+7;
struct Node
{
    int m,n,id;
}q[maxn];
void init()
{
    for(int i=2;i<=maxn;i++) {
        f[i]=f[i-1]*i%M;
        inv[i]=(M-M/i)*inv[M%i]%M;
        finv[i]=finv[i-1]*inv[i]%M;
    }
}
ll C(int n,int m)
{
    if(m>n) {
        return 0;
    }
    return f[n]*finv[m]%M*finv[n-m]%M;
}
bool cmp(Node a,Node b)
{
    if(pos[a.m]==pos[b.m]) {
        return a.n<b.n;
    }
    else {
        return a.m<b.m;
    }
}
int main()
{
    init();
    sz=sqrt(maxn);
    for(int i=1;i<=100000;i++) {
        pos[i]=(i-1)/sz+1;
    }
    scanf("%d",&t);
    for(int i=1;i<=t;i++) {
        scanf("%d%d",&q[i].n,&q[i].m);
        q[i].id=i;
    }
    sort(q+1,q+1+t,cmp);
    int n=1,m=0; ll sum=1;
    for(int i=1;i<=t;i++) {
        while(n<q[i].n) {sum=(2*sum-C(n++,m)+M)%M; }
        while(n>q[i].n) {sum=(sum+C(--n,m))%M*inv[2]%M; }
        while(m<q[i].m) {sum=(sum+C(n,++m))%M; }
        while(m>q[i].m) {sum=(sum-C(n,m--)+M)%M; }
        ans[q[i].id]=sum;
    }
    for(int i=1;i<=t;i++) {
        printf("%lld\n",ans[i]);
    }
}