HDU 5804/BC 86A Price List

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/weilehuozhe/article/details/52142985

题解:因为是要求一定“记多了”,也就是记录的值大于总和的最大值

注意:sum取long long

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define bug puts("===========");
#define zjc puts("");
const double pi=(acos(-1.0));
const double eps=1e-8;
const ll INF=1e18+10;
const ll inf=1e9+10;
const int mod=1e9+7;
const int maxn=1001;
/*=======================================*/
int main()
{
    int T_T;
    scanf("%d",&T_T);
    while(T_T--){
        int n,m;
        ll sum=0;
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++){
            int a;
            scanf("%d",&a);
            sum+=a;
        }
        for(int i=0;i<m;i++){
            ll a;
            scanf("%I64d",&a);
            if(a>sum) putchar('1');
            else putchar('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

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

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试

关闭