【BestCoder】 HDOJ 5101 Select

额。。。下限取小了。。。然后终测挂掉了。。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 5000005
#define maxm 1000005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

LL p[maxn], pp[maxn];
int cnt, n, m;
LL res, k;

int cmp(LL a, LL b)
{
    return a < b;
}

void read(void)
{
    LL x;
    res = 0;
    cnt = 0;
    scanf("%d%I64d", &n, &k);
    for(int i = 0; i < n; i++) {
        scanf("%d", &m);
        for(int i = 0; i < m; i++) {
            scanf("%I64d", &x);
            p[++cnt] = x;
            pp[i] = x;
        }
        sort(pp, pp+m, cmp);
        for(int i = 0; i < m; i++)
            for(int j = i+1; j < m; j++)
                if(pp[i] + pp[j] > k)
                    res++;
    }
}

int find(LL x)
{
    int top = cnt, bot = 0, mid, t;
    if(p[cnt] <= x) return 0;
    while(top >= bot) {
        mid = (top + bot) >> 1;
        if(p[mid] > x) t = mid, top = mid-1;
        else bot = mid+1;
    }
    return cnt - t + 1;
}

void work(void)
{
    LL ans = 0;
    p[0] = -1e17;
    sort(p+1, p+cnt+1, cmp);
    for(int i = 1; i <= cnt; i++) {
        ans += find(k - p[i]);
        if(p[i] + p[i] > k) ans--;
    }
    ans /= 2;
    ans -= res;
    printf("%I64d\n", ans);
}

int main(void)
{
    int _;
    while(scanf("%d", &_)!=EOF) {
        while(_--) {
            read();
            work();
        }
    }

    return 0;
}