hdu5101——SelectSelect

96 阅读 0 评论 64 点赞

我是靠谱客的博主淡淡小懒虫，这篇文章主要介绍hdu5101——SelectSelect，现在分享给大家，希望可以做个参考。

Select

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 179 Accepted Submission(s): 48

Problem Description

One day, Dudu, the most clever boy, heard of ACM/ICPC, which is a very interesting game. He wants to take part in the game. But as we all know, you can't get good result without teammates.
So, he needs to select two classmates as his teammates.
In this game, the IQ is very important, if you have low IQ you will WanTuo. Dudu's IQ is a given number k. We use an integer v[i] to represent the IQ of the ith classmate.
The sum of new two teammates' IQ must more than Dudu's IQ.
For some reason, Dudu don't want the two teammates comes from the same class.
Now, give you the status of classes, can you tell Dudu how many ways there are.

Input

There is a number T shows there are T test cases below. (

T≤20 )
For each test case , the first line contains two integers, n and k, which means the number of class and the IQ of Dudu. n (

0≤n≤1000 ), k(

0≤k<231 ).
Then, there are n classes below, for each class, the first line contains an integer m, which means the number of the classmates in this class, and for next m lines, each line contains an integer v[i], which means there is a person whose iq is v[i] in this class. m(

0≤m≤100 ), v[i](

0≤v[i]<231 )

Output

For each test case, output a single integer.

Sample Input

复制代码

Sample Output

复制代码

Source

BestCoder Round #17

Recommend

heyang | We have carefully selected several similar problems for you: 5103 5102 5100 5099 5098

Statistic | Submit | Discuss | Note

先计算总的，然后排出在同一个班级的就行复杂度是n*m

复制代码

#include <map>  
#include <set>  
#include <list>  
#include <stack>  
#include <queue>  
#include <vector>  
#include <cmath>  
#include <cstdio>  
#include <cstring>  
#include <iostream>  
#include <algorithm>  
  
using namespace std;

const int N = 1010;

vector <__int64> ma[N];
__int64 all[N * 100];

int main()
{
    __int64 t;
    scanf("%I64d", &t);
    while (t--)
    {
        __int64 n, k, v, res, m;
        scanf("%I64d%I64d", &n, &k);
        res = 0;
        for (int i = 1; i <= n; ++i)
        {
            scanf("%I64d", &m);
            ma[i].clear();
            for (int j = 1; j <= m; ++j)
            {
                scanf("%I64d", &v);
                ma[i].push_back(v);
                all[res++] = v;
            }
            sort(ma[i].begin(), ma[i].end());
        }
        sort(all, all + res);
        __int64 ans = 0, tmp = 0;
        int i = 0, j = res - 1;
        while (i < j)
        {
            while(i < j && all[i] + all[j] > k)
            {
                j--;
            }
            tmp += j - i;
            i++;
        }
        ans = (__int64)(res * (res - 1) / 2) - tmp;
        for (int i = 1; i <= n; ++i)
        {
            int j = 0, l = ma[i].size() - 1;
            tmp = 0;
            int cnt = ma[i].size();
            while(j < l)
            {
                while(j < l && ma[i][j] + ma[i][l] > k)
                {
                    l--;
                }
                tmp += l - j;
                j++;
            }
            ans -= (__int64)(cnt * (cnt - 1) / 2) - tmp;
        }
        printf("%I64dn", ans);
    }
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <map>  
#include <set>  
#include <list>  
#include <stack>  
#include <queue>  
#include <vector>  
#include <cmath>  
#include <cstdio>  
#include <cstring>  
#include <iostream>  
#include <algorithm>  
  
using namespace std;

const int N = 1010;

vector <__int64> ma[N];
__int64 all[N * 100];

int main()
{
    __int64 t;
    scanf("%I64d", &t);
    while (t--)
    {
        __int64 n, k, v, res, m;
        scanf("%I64d%I64d", &n, &k);
        res = 0;
        for (int i = 1; i <= n; ++i)
        {
            scanf("%I64d", &m);
            ma[i].clear();
            for (int j = 1; j <= m; ++j)
            {
                scanf("%I64d", &v);
                ma[i].push_back(v);
                all[res++] = v;
            }
            sort(ma[i].begin(), ma[i].end());
        }
        sort(all, all + res);
        __int64 ans = 0, tmp = 0;
        int i = 0, j = res - 1;
        while (i < j)
        {
            while(i < j && all[i] + all[j] > k)
            {
                j--;
            }
            tmp += j - i;
            i++;
        }
        ans = (__int64)(res * (res - 1) / 2) - tmp;
        for (int i = 1; i <= n; ++i)
        {
            int j = 0, l = ma[i].size() - 1;
            tmp = 0;
            int cnt = ma[i].size();
            while(j < l)
            {
                while(j < l && ma[i][j] + ma[i][l] > k)
                {
                    l--;
                }
                tmp += l - j;
                j++;
            }
            ans -= (__int64)(cnt * (cnt - 1) / 2) - tmp;
        }
        printf("%I64dn", ans);
    }
    return 0;
}