Description
Input
Output
Sample Input
3 3
1 2 3 4 5 6
1 2 3 0 0 0
0 0 0 4 5 6
Sample Output
2
HINT
Dragonite修正数据
Source
Hash
我是傻逼T_T先写错了Hash姿势…然后把Hash改成Po姐姿势…
然后又发现自己组合数都求错了T_T
容斥原理+组合数学+hash
考虑k个位置对应相同的数目=至少有k个位置相同的对数*C(k,k)-至少有k+1个位置相同的对数*C(k+1,k)+至少有k+2个位置相同的对数*C(k+2,k)+..
hash用于统计相同元素
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define MAXN 101000
#define GET (ch>='0'&&ch<='9')
#define ULL unsigned long long
#define base 99816169
#define P 862033
using namespace std;
const int len=(1<<6);
int n,k;
int c[11][11],a[MAXN][7];
int digit[100];
long long ans;
void in(int &x)
{
char ch=getchar();x=0;
while (!GET) ch=getchar();
while (GET) x=x*10+ch-'0',ch=getchar();
}
int top,tim[MAXN*10],T=1;
struct list
{
int num;
ULL hash;
list *next;
list() {}
list (list *x,ULL data):
next(x),hash(data),num(0) {}
}*prev[MAXN*10],Hash[MAXN*10],*C=Hash;
int& gethash(ULL x)
{
int pos=x%P;
if (tim[pos]!=T) tim[pos]=T,prev[pos]=NULL;
for (list *i=prev[pos];i;i=i->next)
if (i->hash==x) return i->num;
prev[pos]=new (C++) list(prev[pos],x);
return prev[pos]->num;
}
ULL calc(int x)
{
long long ret=0;T++;C=Hash;
for (int i=1;i<=n;i++)
{
ULL hash=0;
for (int j=1;j<=6;j++)
if (x&(1<<(j-1))) hash=hash*base+a[i][j];
int &val=gethash(hash);ret+=(val++);
}
return ret;
}
int main()
{
in(n);in(k);c[0][0]=1;
for (int i=1;i<=10;i++)
{
c[i][0]=1;
for (int j=1;j<=i;j++) c[i][j]=c[i-1][j]+c[i-1][j-1];
}
for (int i=1;i<=n;i++)
for (int j=1;j<=6;j++) in(a[i][j]);
for (int i=0;i<len;i++)
{
digit[i]=digit[i>>1]+(i&1);
if (digit[i]>=k) ans+=calc(i)*((digit[i]-k)&1?-1:1)*c[digit[i]][k];
}
cout<<ans<<endl;
}