#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,L;
cin>>n>>L;
ll x[n+5];
for(ll i=1;i<=n;i++){
cin>>x[i];
}
sort(x+1,x+n+1);
x[0]=0;
ll q;
cin>>q;
while(q--){
ll s,g,t;
cin>>s>>g>>t;
vector<ll>ord(n);
iota(all(ord),1);
bool ok=false;
do{
ll cur=n,cnt=0;
ll pos=s;
for(ll i:ord){
cur+=abs(pos-x[i])*(cnt+1);
cnt++;
pos=x[i];
}
cur+=abs(pos-g)*(cnt+1);
if(cur<=t){
ok=true;
}
}while(next_permutation(all(ord)));
cout<<(ok?"Yes":"No")<<"\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |