Hdu5804 Price List
来源:互联网 发布:php抓取图片到本地 编辑:程序博客网 时间:2024/04/27 16:16
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.
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 (1≤T≤10) , denoting the number of test cases.
In each test case, the first line of the input contains two integersn,m (1≤n,m≤100000) , denoting the number of shops and the number of records on Byteasar's account book.
The second line of the input containsn integers v1,v2,...,vn (1≤vi≤100000) , denoting the price of the i -th shop's goods.
Each of the nextm lines contains an integer q (0≤q≤1018) , denoting each number on Byteasar's account book.
In each test case, the first line of the input contains two integers
The second line of the input contains
Each of the next
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
13 32 5 41710000
Sample Output
001
Source
BestCoder Round #86
Recommend
wange2014
当给定值超过所有数总和时,一定是不可能的,否则难以判断。
#include <iostream>#include <cstdio>#include <map>#include <set>#include <vector>#include <queue>#include <stack>#include <cmath>#include <algorithm>#include <cstring>#include <string>using namespace std;#define INF 0x3f3f3f3ftypedef long long LL;int main(){ int t; int n,m,a; char c[100005]; LL sum,b; scanf("%d",&t); while(t--){ scanf("%d%d",&n,&m); sum=0; while(n--){ scanf("%d",&a); sum+=a; } for(int i=0;i<m;i++){ scanf("%lld",&b); if(b>sum){ c[i]='1'; }else{ c[i]='0'; } } for(int i=0;i<m;i++){ printf("%c",c[i]); } printf("\n"); } return 0;}
0 0
- Hdu5804 Price List
- HDU5804--Price List
- HDU5804&BestCoder Round #86 1001 Price List
- HDU5804 BestCoder Round 86A 【Price List】
- 【HDU5804 BestCoder Round 86A】【水题】Price List
- InterCompany中的Price list
- BZOJ3415: Poi2013 Price List
- hdu Price List
- HDU 5804:Price List
- hdu 5804 Price List
- HDU 5804 Price List
- HDU 5804 Price List
- HDU 5804 Price List
- hdoj-5804-Price List
- hdoj-【5804 Price List】
- 3415: Poi2013 Price List
- hdu 5804 Price List(水题 )
- Hdu 5804 Price List【水题】
- DispatcherServlet详解
- 机房错误(二)
- 前端学习笔记1---HTML meta简介、JavaScript简介创建对象--待完善
- POJ - 3111 K Best (二分 + 01分数规划)
- ViewPager指示器
- Hdu5804 Price List
- hdu 1232 畅通工程
- maven编译代码下载jar太慢的问题
- CodeForces 165D Beard Graph
- js平稳退化,性能考虑(javascript DOM 编程艺术)
- HDU 5804 Price List
- iOS 【Objective-C 微博发布日期格式化】
- 剑指Offer: 两个链表的第一个公共结点
- 自己对LayoutInflater理解