zoukankan      html  css  js  c++  java
  • CodeForces 441 A. Valera and Antique Items

    纯粹练JAVA....

    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.




    import java.util.*;
    
    public class Main
    {
    	public static void main(String[] args)
    	{
    		Scanner cin=new Scanner(System.in);
    		int n=cin.nextInt(),v=cin.nextInt();
    		int count=0; 
    		StringBuilder ans= new StringBuilder();
    		for(int lll=0;lll<n;lll++)
    		{
    			int k=cin.nextInt();
    			boolean flag=false;
    			for(int i=0;i<k;i++)
    			{
    				int temp=cin.nextInt();
    				if(temp<v)
    				{
    					flag=true;
    				}
    			}
    			if(flag)
    			{
    				count++;
    				ans.append((lll+1)+" ");
    			}
    		}
    		System.out.println(count);
    		System.out.println(ans.toString().trim());
    	}
    }



    版权声明:来自: 代码代码猿猿AC路 http://blog.csdn.net/ck_boss

  • 相关阅读:
    精灵点点基础教程1 -- 下载与安装
    技术人员搞公司还是省省吧
    企业级自定义表单引擎解决方案(二)--架构及核心模块设计
    企业级自定义表单引擎解决方案(一)--总体介绍
    .net core quartz job作业调度管理组件
    NPOI读写Excel组件封装Excel导入导出组件
    企业级工作流解决方案(十七)--工作流--工作流插件模型
    企业级工作流解决方案(十六)--工作流--工作流实体模型
    企业级工作流解决方案(十五)--集成Abp和ng-alain--Abp其他改造
    企业级工作流解决方案(十四)--集成Abp和ng-alain--自动化脚本
  • 原文地址:https://www.cnblogs.com/yxwkf/p/4742595.html
Copyright © 2011-2022 走看看