神TM啊,祝卡bzoj的人全家原地爆炸螺旋升天。
。。
分析:用树状数组维护一下上下的组合数,离散坐标,然后直接算就好了。。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#define T 101
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e5+5;
const int inf=2147483647;
struct node
{
int x,y,u,d,id;
}a[N];
int n,m,w,k;
int s[N],id[N],cnt;
int c[N][15];
int num[N];
inline int lowbit(int x)
{
return x&(-x);
}
bool cmpx(node a,node b)
{
if (a.x==b.x)return a.y<b.y;
else return a.x<b.x;
}
bool cmpy(node a,node b)
{
if (a.y==b.y)return a.x<b.x;
else return a.y<b.y;
}
inline int sum(int x)
{
int ans=0;
while (x>=1)ans+=s[x],x-=lowbit(x);
return ans;
}
inline void add(int x,int y)
{
while (x<=cnt)
{
s[x]+=y;
x+=lowbit(x);
}
}
int main()
{
scanf("%d%d%d",&n,&m,&w);
fo(i,1,w)scanf("%d%d",&a[i].x,&a[i].y);
a[0].x=a[0].y=a[w+1].x=a[w+1].y=-1;
scanf("%d",&k);
c[0][0]=1;
fo(i,1,w)
{
c[i][0]=1;
fo(j,1,k)
c[i][j]=c[i-1][j]+c[i-1][j-1];
}
sort(a+1,a+w+1,cmpx);
fo(i,1,w)
if (a[i].x==a[i-1].x)
{
a[i].d=a[i-1].d+1;
a[i].id=cnt;
}
else a[i].id=++cnt;
fd(i,w,1)
if (a[i].x==a[i+1].x)
{
a[i].u=a[i+1].u+1;
}
else a[i].u=1;
int tmp=0;
sort(a+1,a+1+w,cmpy);
fo(i,1,w)
{
tmp++;
if (a[i].y!=a[i+1].y)num[i]=tmp,tmp=0;
}
fd(i,w,1)
if (a[i].y==a[i+1].y)num[i]=num[i+1];
tmp=0;
int ans=0;
fo(i,1,w)
{
tmp++;
if (a[i].y!=a[i+1].y)tmp=0;
else ans+=(c[tmp][k]*c[num[i]-tmp][k])*(sum(a[i+1].id-1)-sum(a[i].id));
add(a[i].id,-c[a[i].u][k]*c[a[i].d][k]+c[a[i].u-1][k]*c[a[i].d+1][k]);
}
printf("%d\n",ans&inf);
return 0;
}