HDU 5804:Price List

版权声明:------------------- 这是千千的个人网站哦! https://www.dreamwings.cn ------------------- https://blog.csdn.net/qq_28954601/article/details/52141288

Price List

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


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

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  , denoting the number of test cases.

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

The second line of the input contains  integers  , denoting the price of the -th shop's goods.

Each of the next  lines contains an integer  , denoting each number on Byteasar's account book.
 

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

Sample Input
1 3 3 2 5 4 1 7 10000
 

Sample Output
001
 

Source
 


        第三行所输入的数,代表购买的实际价格,然后接下来所输入的是账本上所记录的数据,如果这个数据大于购买总额,输出1,否则输出0。注意数据范围哦!

        因为数据范围的问题,我被Hack过了……[伤心]


AC代码:

/*
HDU 5804 Price List
*/

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
__int64 a[100005],b[100005];
int main()
{
    __int64 T;
    scanf("%I64d",&T);
    while(T--)
    {
        __int64 n,m,t,s=0;
        scanf("%I64d%I64d",&n,&m);
        for(__int64 i=1; i<=n; i++)
        {
            scanf("%I64d",a+i);
            s+=a[i];
        }
        for(__int64 i=1; i<=m; i++)
        {
            scanf("%I64d",&t);
            if(t>s)printf("1");
            else printf("0");
        }
        puts("");
    }
    return 0;
}
阅读更多

Price List

06-19

Problem DescriptionnThere 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.nnEvery 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.nnHowever, 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.nnPlease write a program to help Byteasar judge whether each number is sure to be strictly larger than the actual value.n nnInputnThe first line of the input contains an integer T (1≤T≤10), denoting the number of test cases.nnIn 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.nnThe second line of the input contains n integers v1,v2,...,vn (1≤vi≤100000), denoting the price of the i-th shop's goods.nnEach of the next m lines contains an integer q (0≤q≤1018), denoting each number on Byteasar's account book.n nnOutputnFor 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'.n nnSample Inputn1n3 3n2 5 4n1n7n10000n nnSample Outputn001n

换一批

Price List Strike Back

10-27

Problem DescriptionnThere 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. The distance between the i-th shop and Byteasar's home is di.nnEvery day, Byteasar will purchase some goods. On the i-th day, he will choose an interval [li,ri] and an upper limit ci. Then, he will visit each shop with distance at most ci away from home in [li,ri], buy at most one piece of goods from each shop and go back home. 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, denoted as sumi.nnHowever, due to Byteasar's poor math, he may calculate it wrong. nnPlease write a program to help Byteasar judge whether each number is sure to be calculated wrong.n nnInputnThe first line of the input contains an integer T (1≤T≤10), denoting the number of test cases.nnIn each test case, the first line of the input contains two integers n,m (1≤n≤20000,1≤m≤100000), denoting the number of shops and the number of records on Byteasar's account book.nnThe second line of the input contains n integers v1,v2,...,vn (1≤vi≤100), denoting the price of the i-th shop's goods.nnThe third line of the input contains n integers d1,d2,...,dn (1≤di≤109), denoting the distance between the i-th shop and Byteasar's home.nnEach of the next m lines contains four integers li,ri,ci,sumi (1≤li≤ri≤n,1≤ci≤109,1≤sumi≤100), denoting a record on Byteasar's account book.n nnOutputnFor each test case, print a line with m characters. If the i-th number is sure to be calculated wrong, then the i-th character should be '1'. Otherwise, it should be '0'.n nnSample Inputn2n3 3n3 3 3n2 4 3n3 3 5 3n3 3 3 1n2 3 1 3n5 4n5 1 2 4 2n1 8 9 2 1n1 5 1 3n4 4 1 5n1 5 3 5n1 3 5 1n nnSample Outputn011n1101

没有更多推荐了,返回首页