2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 C cocout

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_iD​i​​ days.

Initially, there is no coconut on his ship. Fortunately, he could get supply of C_iC​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 C_1, C_2, \cdots, C_NC​1​​,C​2​​,⋯,C​N​​.

The third line contains $N-1$ integers D_1, D_2, \cdots, D_{N-1}D​1​​,D​2​​,⋯,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.

样例输入

2
4 1
3 2 1 4
1 2 3
4 2
2 4 6 8
3 2 1

样例输出

Yes
No

题目来源

2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int t,n,b,i,j,a[1005],bb[1005],cnt,flag;
    cin>>t;
    while(t--)
    {
        scanf("%d%d",&n,&b);
        cnt=0;
        flag=0;
        for(i=1;i<=n;i++)
            cin>>a[i];
        for(i=1;i<=n-1;i++)
            cin>>bb[i];
         for(i=1;i<n;i++)
         {
             cnt+=a[i];
             cnt-=b*bb[i];
             if(cnt<0)
                {
                    flag=1;
                    break;
                }
         }
         if(flag)
            cout<<"No"<<endl;
         else
            cout<<"Yes"<<endl;
    }
}