HDU 5804 Price List (BC#86)

原创 2016年08月28日 19:15:53

Price List

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)
Total Submission(s): 737    Accepted Submission(s): 420


Problem Description
There are n shops numbered with successive integers from 1 to n in Byteland. Every shop sells only one kind of goods, and the price of the i-th shop's goods is vi.

Every day, Byteasar will purchase some goods. He will buy at most one piece of goods from each shop. Of course, he can also choose to buy nothing. Back home, Byteasar will calculate the total amount of money he has costed that day and write it down on his account book.

However, due to Byteasar's poor math, he may calculate a wrong number. Byteasar would not mind if he wrote down a smaller number, because it seems that he hadn't used too much money.

Please write a program to help Byteasar judge whether each number is sure to be strictly larger than the actual value.
 

Input
The first line of the input contains an integer T (1T10), denoting the number of test cases.

In each test case, the first line of the input contains two integers n,m (1n,m100000), denoting the number of shops and the number of records on Byteasar's account book.

The second line of the input contains n integers v1,v2,...,vn (1vi100000), denoting the price of the i-th shop's goods.

Each of the next m lines contains an integer q (0q1018), denoting each number on Byteasar's account book.
 

Output
For each test case, print a line with m characters. If the i-th number is sure to be strictly larger than the actual value, then the i-th character should be '1'. Otherwise, it should be '0'.
 

Sample Input
1 3 3 2 5 4 1 7 10000
 

Sample Output
001
分析:sum把所有商店的价值都加起来,判断输入的值是否比sum大即可。注意每组数据只为一行。

ACcode:

#include <stdio.h>
long long a;
int main()
{
	int T;
	int n,m;
	int i;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d %d",&n,&m);
		long long sum=0;
		for(i=0;i<n;i++)
		{
			scanf("%I64d",&a);
			sum+=a;
		}
		for(i=0;i<m;i++)
		{
			scanf("%I64d",&a);
			if(a>sum)
				printf("1");
			else
				printf("0");
		}
		putchar('\n');
	}
	
	return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU5804--Price List

Price List Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others) T...

hdu 5804 Price List(水题 )

Price List Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others) T...

【HDU5808 BestCoder Round 86E】【时间排序 树状数组计数 bitsetDP 或分治】Price List Strike Back 距离范围、区间范围商店购物 使得价值和恰为m

Price List Strike Back    Accepts: 2    Submissions: 51  Time Limit: 6000/3000 MS (Java/Other...

BestCoder#86 E / hdu5808 Price List Strike Back

整体二分***

HDU 5808 BestCoder Round #86 Price List Strike Back (树状数组)

Price List Strike Back   题目链接:点我打开链接 Source BestCoder Round #86 题意:  在Byteland一共有n家商店,编号依次为1...

HDU 5805/BC 86B NanoApe Loves Sequence

题解:首先计算出每两个相邻数之间的差值,统计出其中最大的三个。然后枚举删每一个点,对于删除当前点,首先删除当前点与左右两个点之间的距离 (只有删除的距离为最大的两个时才会有影响),然后处理没被删掉的最...

HDU 5808 Price List Strike Back

Problem Description There are n shops numbered with successive integers from 1 to n in Bytela...

price list

  • 2014-09-19 18:10
  • 99KB
  • 下载

数列区间询问中的分块思想CF86D,BC#22-1004-NPY and girls

学自:http://www.cnblogs.com/Lyush/archive/2013/08/16/3263247.html CF 86D powerful array 代码: #in...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)