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 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 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 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 q (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
1 3 3 2 5 4 1 7 10000
Sample Output
001
真是懵逼了,这题,竟然错了那么多遍,最后从判还被判错。
水的不行。 之前错是因为大意,理解错题意,之后的错,我写的都一样,就不明白怎么有对有不对。
我把我过的和不过的都贴出来。
#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> #include <stack> #include <vector> #include <queue> #include <set> #include <map> #include <string> #include <math.h> #include <stdlib.h> #include <time.h> using namespace std; #define LL long long #define N 200005 #define mod 1000000007 __int64 a[N],b[N]; int main() { int t,n,m,T; __int64 s,sum; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); sum=0; for(int i=0;i<n;i++) { scanf("%d",&a[i]); sum+=a[i]; } for(int i=0;i<m;i++) { scanf("%I64d",&s); if(s>sum) b[i]=1; else b[i]=0; } for(int i=0;i<m;i++) printf("%d",b[i]); printf("\n"); } return 0; }
// ac
<pre name="code" class="cpp">#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> #include <stack> #include <vector> #include <queue> #include <set> #include <map> #include <string> #include <math.h> #include <stdlib.h> #include <time.h> using namespace std; #define LL long long #define N 200005 #define mod 1000000007 __int64 a[N],b[N]; int main() { int t,n,m,T; __int64 s; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); for(int i=0;i<n;i++) { scanf("%d",&a[i]); if(i)a[i]+=a[i-1]; //printf("%d ",a[i]); }//printf("\n"); for(int i=0;i<m;i++) { scanf("%I64d",&s); if(s>a[n-1]) b[i]=1; else b[i]=0; } for(int i=0;i<m;i++) printf("%d",b[i]); printf("\n"); } return 0; }
//wa 只是存储方式有一点小不一样。不知道为啥会错