Coconut

最新推荐文章于 2019-05-27 16:27:12 发布

叫我AC

最新推荐文章于 2019-05-27 16:27:12 发布

阅读量593

点赞数

分类专栏： acm

本文链接：https://blog.csdn.net/Lison_Zhu/article/details/77916276

版权

acm 专栏收录该内容

62 篇文章 0 订阅

订阅专栏

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_i$ days.

Initially, there is no coconut on his ship. Fortunately, he could get supply of $C_i$ coconuts from the $i$ -th city.

Could you tell him, whether he could drink coconut juice every day during the trip no not?

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 $C1,C2,⋯,CNC_1, C_2, \cdots, C_N$ .

The third line contains $N - 1$ integers $D1,D2,⋯,DN−1D_1, D_2, \cdots, D_{N-1}$ .

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.

样例输入

样例输出

Yes
No
#include<stdio.h>
#define M 1005
void Check(int a[],int b[],int q,int n){
	int tag=a[0];
		for(int i=1;i<n;i++){
			tag=tag-b[i-1]*q;
			if(tag<0){
				printf("No\n");
				return ;
			}
			tag=tag+a[i];
		}
	printf("Yes\n");
}
int city[M];
int Day[M];
int main(){
	int n;
	scanf("%d",&n);
	while(n){
		int N,b;
		scanf("%d%d",&N,&b);
		for(int i=0;i<N;i++){
			scanf("%d",city+i);
		}
		for(int j=0;j<N-1;j++){
			scanf("%d",Day+j);
		}
		Check(city,Day,b,N);
		n--;
	}
	return 0;
}