Hdu5804 Price List

最新推荐文章于 2019-03-09 10:16:47 发布

原创最新推荐文章于 2019-03-09 10:16:47 发布 · 562 阅读

0 ·

CC 4.0 BY-SA版权

水专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种算法，用于帮助Byteasar验证其购物支出记录是否可能超过了实际消费金额。该算法通过比较记录中的数值与所有商品价格之和来判断记录是否准确。

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

(1≤T≤10) , denoting the number of test cases.
In each test case, the first line of the input contains two integers

n,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 contains

n integers

v1,v2,...,vn

(1≤vi≤100000) , denoting the price of the

i -th shop's goods.
Each of the next

m lines contains an integer

(0≤q≤1018) , 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

Sample Output

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 0x3f3f3f3f
typedef 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;
}