1341A - Nastya and Rice - CodeForces Solution

#include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll mod=1e9+7;
long double fact(int N){
    if(N < 0) 
        return 0; 
    if (N == 0)
        return 1; 
    else 
        return N * fact(N - 1); 
}
struct batya {
    vector <long long> tree;
    ll size;
    void init(ll n) {
        size = 1;
        while (size < n) {
            size *= 2;
        }
        tree.assign(2 * size - 1, 0);
    }
 
    void set(int i, int v, int x, int lx, int rx) {
        if (rx - lx == 1) {
            tree[x] = v;
            return;
        }
        int m = (lx + rx) / 2;
        if (i < m) {
            set(i, v, 2 * x + 1, lx, m);
        }
        else {
            set(i, v, 2 * x + 2, m, rx);
        }
        tree[x] =min(tree[2 * x + 1],tree[2 * x + 2]);
    }
 
    void set(int i, int v) {
        set(i, v, 0, 0, size);
    }
    ll sum(int l, int r, int x, int lx, int rx){
        if (lx >= r || rx <= l) {
            return 1000000000;
        }
        if (lx >= l && rx <= r) {
            return tree[x];
        }
        int m = (lx + rx) / 2;
        long long s1 = sum(l, r, 2 * x + 1, lx, m);
        long long s2 = sum(l, r, 2 * x + 2, m, rx);
        return min(s1,s2);
    }
 
    ll sum(int l, int r) {
       return sum(l, r, 0, 0, size);
    }
};
/* void upd (int pos, int v = 1, int tl = 1, int tr = N) {
 	if (tl == tr) {
 		t[v]++;
 		return;
 	}
 	int tm = tl + tr >> 1;
	if (pos <= tm) upd(pos, v << 1, tl, tm);
	else upd(pos, v << 1 | 1, tm + 1, tr);
	t[v] = t[v << 1] + t[v << 1 | 1];
}
 
int get (int l, int r, int v = 1, int tl = 1, int tr = N) {
	if (tl > r || tr < l) return 0; 
	if (tl >= l && tr <= r) return t[v];
	int tm = tl + tr >> 1;
	int a = get(l, r, v << 1, tl, tm);
	int b = get(l, r, v << 1 | 1, tm + 1, tr);
	return (a + b);
}*/
string as(ll x){
    string ans;
    while(x>0){
        ans+=((x%2)+'0');
        x/=2;
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
   cout.tie(0);
    ll t;
    cin>>t;
    while(t--){
        ll n,a,b,c,d;
        cin>>n>>a>>b>>c>>d;
        if((a+b)*n<c-d){ 
            cout<<"No"<<endl;
            continue;
        }
        else if((c+d)<(a-b)*n){
            cout<<"No"<<endl;
            continue;
        }
        else cout<<"Yes"<<endl;
    }
return 0;
}