Say No To Drugs Problem Code: NODRUGS

 

Say No To Drugs Problem Code: NODRUGS

There are N$N$ people participating in a race. The Nth$N^{th}$ participant is your friend, so you want him to win. You are not a man of ethics, so you decided to inject some units of a Performance Enhancement Drug (don't ask where that came from) in your friend's body.

• From the charts, you came to know the speed of every player. Formally, for a player i$i$, his speed is denoted by Si$S_i$.
• The change in speed with one unit of the drug is K$K$ units. Note that K$K$ can be negative, which means the drug has more side effects than benefits.
• Of course, there will be a drug test before the race, so your friend will be caught if the number of units of the drug in his blood is greater than or equal to L$L$.

You need to determine whether you can help your friend to win the race (with or without drugs), without getting caught.

Note: A player wins the race if he has the maximum speed among all the participants. If there are more than one people with a maximal speed, they tie at first place, and no one wins!

Input Format

• First line will contain a single integer T$T$, the number of test cases. Description of the test cases follows.
• First line of each test case will contain three space-separated integers, N$N$ - the number of participants, K$K$ - the change in speed with one unit of the drug, and L$L$ - minimum units of the drug that can be detected in the drug test.
• Second line of each test case will contain N$N$ space-separated integers Si$S_i$, the speeds of the participants.

Output Format

For each test case print "Yes" if you can help your friend to win the race, otherwise "No" in a single line.

Constraints

• 1≤T≤200$1\le T\le 200$
• 1≤N,L≤1000$1\le N,L\le 1000$
• −1000≤K≤1000$-1000\le K\le 1000$
• 1≤Si≤1000$1\le S_i\le 1000$

Sample Input 1 

3
4 2 2
2 1 3 2
4 2 2
2 1 4 2
3 -10 100
12 11 9

Sample Output 1 

Yes
No
No

Explanation

• In test case 1$1$, initial speeds are {2,1,3,2}$\{2,1,3,2\}$. You can inject 1$1$ unit of the drug into your friend's body, and increase his speed from 2$2$ to 4$4$. 4$4$ is the fastest speed, thus you helped your friend win the race. Hence, the answer is "Yes".
• In test case 2$2$, initial speeds are {2,1,4,2}$\{2,1,4,2\}$. You can inject 1$1$ unit of the drug into your friend's body, and increase his speed from 2$2$ to 4$4$. But you can not inject any more units of the drug, and with speed 4$4$ your friend can only tie at rank 1$1$ and not Win. Hence, the answer is "No".
• In test case 3$3$, initial speeds are {12,11,9}$\{12,11,9\}$. Note that the impact of the drug in this case is negative, which means that the speed will only decrease if you inject it. So, there is no way you can help your friend to win. Hence, the answer is "No".

Author:6★hitch_hiker42

Date Added:12-08-2021

Time Limit:0.5 secs

Source Limit:50000 Bytes

Languages:CPP14, C, JAVA, PYTH 3.6, CPP17, PYTH, PYP3, CS2, ADA, PYPY, TEXT, PAS fpc, NODEJS, RUBY, PHP, GO, HASK, TCL, PERL, SCALA, LUA, kotlin, BASH, JS, LISP sbcl, rust, PAS gpc, BF, CLOJ, R, D, CAML, FORT, ASM, swift, FS, WSPC, LISP clisp, SQL, SCM guile, PERL6, ERL, CLPS, ICK, NICE, PRLG, ICON, COB, SCM chicken, PIKE, SCM qobi, ST, SQLQ, NEM

SOLUTION IN C++

#include <iostream>

#include<bits/stdc++.h>

#define ll long long int

using namespace std;

void sol(){

    ll n,k,l;

    cin>>n>>k>>l;

    vector<ll>v(n);

    for(ll i=0;i<n;i++){

        cin>>v[i];

    }

    if(k>0){

        ll take=max((ll)0,(ll)l-1);

        v[n-1]+=(ll)take*k;

    }

    else

    {

        

    }

    int ma=-1e9;

    int cnt=0;

    for(ll i=0;i<n;i++){

        if(ma<v[i]){

            ma=v[i];

            cnt=1;

        }

        else if(ma==v[i]){

            cnt++;

        }

    }

    if(v[n-1]==ma && cnt==1){

        cout<<"Yes";

    }

    else{

        cout<<"No";

    }

    cout<<"\n";

}

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);

    int t;

    cin>>t;

    while(t--){

        sol();

    }

}