2016 USP-ICMC-Codeforces-Gym101063C-Sleep Buddies Gym101063F-Bandejao Gym101063J-The Keys

C.Sleep Buddies

It is nighttime in the Earth Colony on Mars and everyone is getting ready to sleep. It is common to sleep in pairs, so that if anything were to happen during the night people could aid each other.

To decide who is a suitable candidate to sleep with whom, the leaders of GEMA asked everyone to answer a questionnaire about attributes they desire their partner to have from a list of M possible items.

To choose the pairs, GEMA uses the Jaccard index between the desired attributes of both persons. The Jaccard index for two sets A and B is defined as , that is, the size of the intersection between A and B divided by the size of their union. They allow a pair to be formed if the Jaccard index of the two attribute sets for the pair is at least K.

Thanks to GEMA, there are too many people living on Mars these days. Help the high commanders decide how many allowed pairs there are out of the N people living there.

Input

The input begins with two integers, N and M (1 ≤ N ≤ 10⁵, 1 ≤ M ≤ 10), the number of people on Mars and the number of possible attributes on the questionnaire.

Then follow N lines, each beginning with an integer Q (1 ≤ Q ≤ M), the number of desired attributes on the list of the i-th person. Then follow Q integers q (1 ≤ q ≤ M), encoding these attributes. There numbers are all different.

The last line of input contains a real number K (0 ≤ K ≤ 1), the minimum required Jaccard index for a pair.

Output

Output the number of pairs that are allowed.

Example

Input

2 5
2 1 3
5 3 1 5 4 2
0.66489

Output

0

Input

3 1
1 1
1 1
1 1
0.85809

Output

3

代码:

 #include<bits/stdc++.h>
 using namespace std;
 #define ll long long
 const int M = 1e5 + ;
 int main()
 {
     int t,k=,n,x,a[M],m,p[];
     ll b[M];
     double dd;
     scanf("%d%d",&t,&m);
     for(int i=;i<=m+;i++){
         p[i] = pow(,i-);
     }
     memset(b,,sizeof(b));
     while(t--){
         scanf("%d",&n);
         memset(a,,sizeof(a));
         for(int i = ;i < n;i++){
             scanf("%d",&x);
             a[x] = ;
         }
         int ans = ;
         for(int i=;i<=m;i++){
             ans += (p[i]*a[i]);
         }
         //cout<<ans<<endl;
         b[ans]++;
     }                                //设一个十进制的数，b数组是因为总共不超过1024，然后他有1e5的集合，有重复；
     cin>>dd;
     int c[];
     for(int k=;k<=m;k++)
         c[k]=pow(,k-);
     ll sum = ;
     for(int i = ;i <= p[m+]; i++){
         for(int j = i;j <= p[m+]; j++){
             int num1 = (i|j),num2=(i&j);
             double cnt1=,cnt2=;
             for(int k=;k<=m;k++)
             {
                 if(num1&c[k])
                     cnt1++;
                 if(num2&c[k])
                     cnt2++;
             }
             //cout<<cnt1/cnt2<<endl;
             if(cnt2/cnt1>=dd&&i!=j&&b[i])
                 sum+=b[i]*b[j];
             else if(cnt1/cnt2>=dd&&i==j&&b[i]){
                 sum+=b[i]*(b[i]-)/;
             }
         }
     }
     cout<<sum<<endl;
 }