zoukankan      html  css  js  c++  java
  • Codeforces Round #252 (Div. 2)A. Valera and Antique Items

    A. Valera and Antique Items
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Valera is a collector. Once he wanted to expand his collection with exactly one antique item.

    Valera knows n sellers of antiques, the i-th of them auctioned ki items. Currently the auction price of the j-th object of the i-th seller issij. Valera gets on well with each of the n sellers. He is perfectly sure that if he outbids the current price of one of the items in the auction (in other words, offers the seller the money that is strictly greater than the current price of the item at the auction), the seller of the object will immediately sign a contract with him.

    Unfortunately, Valera has only v units of money. Help him to determine which of the n sellers he can make a deal with.

    Input

    The first line contains two space-separated integers n, v (1 ≤ n ≤ 50; 104 ≤ v ≤ 106) — the number of sellers and the units of money the Valera has.

    Then n lines follow. The i-th line first contains integer ki (1 ≤ ki ≤ 50) the number of items of the i-th seller. Then go ki space-separated integers si1, si2, ..., siki (104 ≤ sij ≤ 106) — the current prices of the items of the i-th seller.

    Output

    In the first line, print integer p — the number of sellers with who Valera can make a deal.

    In the second line print p space-separated integers q1, q2, ..., qp (1 ≤ qi ≤ n) — the numbers of the sellers with who Valera can make a deal. Print the numbers of the sellers in the increasing order.

    Sample test(s)
    input
    3 50000
    1 40000
    2 20000 60000
    3 10000 70000 190000
    
    output
    3
    1 2 3
    
    input
    3 50000
    1 50000
    3 100000 120000 110000
    3 120000 110000 120000
    
    output
    0
    
    
    Note

    In the first sample Valera can bargain with each of the sellers. He can outbid the following items: a 40000 item from the first seller, a20000 item from the second seller, and a 10000 item from the third seller.

    In the second sample Valera can not make a deal with any of the sellers, as the prices of all items in the auction too big for him.


    #include <iostream>
    #include <cstring>
    using namespace std;
    #define inf 0x3f3f3f3f
    int t[1111111];
    int main()
    {
       int n,m,k,a;
    
       cin>>n>>m;
       int ans=0;
       int vis=0;
       for(int i=1;i<=n;i++)
       {
           vis=0;
           cin>>k;
           for(int j=1;j<=k;j++)
           {
               cin>>a;
               if(a<m)
               {
                   vis=1;
               }
           }
           if(vis)
           {
               t[ans++]=i;
           }
       }
       cout<<ans<<endl;
       for(int i=0;i<ans;i++)
       {
           cout<<t[i]<<' ';
       }
       cout<<endl;
    
        return 0;
    }


  • 相关阅读:
    TCP和UDP的区别
    项目--华为商城---登录页面(一)
    Servlet(一)—— 文件上传(表单文件上传)
    LeetCode(一) —— 存在重复
    电脑右击不能创建txt文件
    边工作边刷题:70天一遍leetcode: day 92-2
    自底向上集成 Bottom-Up
    分层集成(线性关系) Layers
    基干集成(内核耦合度高) Backbone
    三明治集成(分而治之策略) 又分为传统型和改进型 Sandwich
  • 原文地址:https://www.cnblogs.com/llguanli/p/7113170.html
Copyright © 2011-2022 走看看