hdu 6333 莫队，组合数

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6333

 

找出组合数关系数然后用莫队

 

#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<string.h>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#define LL long long
#define mod 1000000007
#define inf 0x3f3f3f3f
#define sqr(a) (a)*(a)
#define For(i,m,n) for(int i=m;i<=n;i++)
#define Dor(i,n,m) for(int i=n;i>=m;i--)
#define lan(a,b) memset(a,b,sizeof(a))
#define maxn 200010

using namespace std;

struct node
{
    int l,r;
    int id;
}a[maxn];
int t;
vector<node> run[maxn];
int mx,chunk,cnt;

int fac[maxn], inv[maxn];
int be[maxn];
int ans[maxn];
int powi(int a, int b)
{
    int c = 1;
    for (; b; b >>= 1, a = 1ll * a * a % mod)
        if (b & 1) c = 1ll * c * a % mod;
    return c;
}

int C(int a, int b)
{
    return 1ll * fac[a] * inv[b] % mod * inv[a - b] % mod;
}

bool cmp(node a,node b)
{
    return a.r<b.r;
}
void print(int l,int r,LL sum)
{
    printf("%d %d %lld\n",l,r,sum);
}


int main()
{
    mx = 100000;
    fac[0] = 1; for (int i = 1; i <= mx; ++ i) fac[i] = 1ll * fac[i - 1] * i % mod;
    inv[mx] = powi(fac[mx], mod - 2); for (int i = mx - 1; ~i; -- i) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;

    chunk=sqrt(mx);
    cnt=1;
    for (int i = 1; i <= mx; i += chunk, ++ cnt)
        for (int j = i; j < i + chunk && j <= mx; ++ j)
            be[j] = cnt;
    cnt--;
    
    scanf("%d",&t);
        For(i,1,t)
        {
            scanf("%d%d",&a[i].r,&a[i].l),a[i].id=i;
            run[be[a[i].l]].push_back(a[i]);
        }
        for(int i=1;i<=cnt;i++)
            if(run[i].size())
                {
                    sort(run[i].begin(),run[i].end(),cmp);
                    int l=-1,r=run[i][0].r,sum=0;
                    for(int j=0;j<run[i].size();j++)
                    {
                        while(r<run[i][j].r)sum=(0ll+sum+sum+mod-C(r++,l))%mod;//print(l,r,sum);
                        while(l<run[i][j].l)sum=(sum+C(r,++l))%mod;//print(l,r,sum);
                        while(l>run[i][j].l)sum=(sum + mod - C(r,l--))%mod;
                        ans[run[i][j].id]=sum;
                    }
                }

        For(i,1,t)
            printf("%d\n",ans[i]);
    return 0;
}