zoukankan      html  css  js  c++  java
  • hdu 2578 Dating with girls(1)

    题目连接

    http://acm.hdu.edu.cn/showproblem.php?pid=2578

     Dating with girls(1)

    Description

    Everyone in the HDU knows that the number of boys is larger than the number of girls. But now, every boy wants to date with pretty girls. The girls like to date with the boys with higher IQ. In order to test the boys ' IQ, The girls make a problem, and the boys who can solve the problem 
    correctly and cost less time can date with them.
    The problem is that : give you n positive integers and an integer k. You need to calculate how many different solutions the equation x + y = k has . x and y must be among the given n integers. Two solutions are different if x0 != x1 or y0 != y1.
    Now smart Acmers, solving the problem as soon as possible. So you can dating with pretty girls. How wonderful!

    Input

    The first line contain an integer T. Then T cases followed. Each case begins with two integers n(2 <= n <= 100000) , k(0 <= k < 2^31). And then the next line contain n integers.

    Output

    For each cases,output the numbers of solutions to the equation.

    Sample Input

    2
    5 4
    1 2 3 4 5
    8 8
    1 4 5 7 8 9 2 6

    Sample Output

    3
    5

    先排序,再二分,可能有重复的元素,去重即可。。。

     1 #include<algorithm>
     2 #include<iostream>
     3 #include<cstdlib>
     4 #include<cstring>
     5 #include<cstdio>
     6 #include<vector>
     7 #include<map>
     8 #include<set>
     9 using std::cin;
    10 using std::cout;
    11 using std::endl;
    12 using std::find;
    13 using std::sort;
    14 using std::pair;
    15 using std::vector;
    16 using std::unique;
    17 using std::lower_bound;
    18 #define pb(e) push_back(e)
    19 #define sz(c) (int)(c).size()
    20 #define mp(a, b) make_pair(a, b)
    21 #define all(c) (c).begin(), (c).end()
    22 #define iter(c) decltype((c).begin())
    23 #define cls(arr,val) memset(arr,val,sizeof(arr))
    24 #define cpresent(c, e) (find(all(c), (e)) != (c).end())
    25 #define rep(i, n) for (int i = 0; i < (int)(n); i++)
    26 #define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
    27 const int Max_N = 100010;
    28 typedef unsigned long long ull;
    29 int n, m;
    30 vector<int> vec;
    31 void solve() {
    32     int ans = 0;
    33     sort(all(vec));
    34     vec.erase(unique(all(vec)), vec.end());
    35     rep(i, sz(vec)) {
    36         vector<int>::iterator ite = lower_bound(all(vec), m - vec[i]);
    37         if ((ite != vec.end() && *ite + vec[i] == m) ||  vec[i] << 1 == m) ans++;
    38     }
    39     vec.clear();
    40     printf("%d
    ", ans);
    41 }
    42 int main() {
    43 #ifdef LOCAL
    44     freopen("in.txt", "r", stdin);
    45     freopen("out.txt", "w+", stdout);
    46 #endif
    47     int t, v;
    48     scanf("%d", &t);
    49     while (t--) {
    50         scanf("%d %d", &n, &m);
    51         rep(i, n) scanf("%d", &v), vec.pb(v);
    52         solve();
    53     }
    54     return 0;
    55 }
    View Code
    By: GadyPu 博客地址:http://www.cnblogs.com/GadyPu/ 转载请说明
  • 相关阅读:
    JDBC的步骤
    Java异常
    两个init方法的区别
    迭代器、foreach循环、泛型集合
    servlet的生命周期
    集合类对比
    在servlet中的中文乱码,相对路径和绝对路径
    【转】学习使用Jmeter做压力测试(一)--压力测试基本概念
    【转】jmeter压力测试
    【转】配置Jmeter的自定义参数
  • 原文地址:https://www.cnblogs.com/GadyPu/p/4601035.html
Copyright © 2011-2022 走看看