C: Coconut
time limit 200ms memory limit 131072KB
Coconut is Captain Gangplank's favourite fruit. That is why he needs to drink coconut
juice from b coconuts each day.
On his next trip, he would pass through N citis.
His trip would begin in the 1-st city and end in the N -th city.
The journey from the i-th city to the (i + 1)-th city costs D days.
Initially, there is no coconut on his ship. Fortunately, he could get supply of C coconuts
from the i-th city.
Could you tell him, whether he could drink coconut juice every day during the trip no
not?
i
i
Input Format
The first line contains an integer T , indicating that there are T test cases.
For each test case the first line contains two integers N and b as described above.The second line contains N integers C , C , ⋯ , C .The third line contains N − 1 integers D , D , ⋯ , D .
All integers in the input are less than 1000.
Output Format
For each case, output Yes if Captain Gangplank could drink coconut juice every day,
and otherwise output No.
2
4 1
3 2 1 41 2 3
4 2
2 4 6 8
3 2 1
Yes
No
思路:只需要计算从起点到终点的过程是否够每天喝的椰汁。AC代码如下:
#include<stdio.h>
int a[1000];
int c[1000];
int n,b;
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&b);
for(int i=0;i<n;i++) scanf("%d",&a[i]);
for(int i=0;i<n-1;i++) scanf("%d",&c[i]);
int sum=a[0];
bool flag=true;
for(int i=0;i<n-1;i++)
{
sum-=c[i]*b;
if(sum<0)
{
printf("No\n");
flag=false;
break;
}
sum+=a[i+1];
}
if(flag) printf("Yes\n");
}
return 0;
}