?
# | Author | Problem | Lang | Verdict | Time | Memory | Sent | Judged | |
---|---|---|---|---|---|---|---|---|---|
202033760 |
Practice: Kingalldog |
1805C - 41 | C++20 (GCC 11-64) | Accepted | 1045 ms | 760 KB | 2023-04-14 11:00:24 | 2023-04-14 11:00:24 |
#include<bits/stdc++.h> using namespace std; const int N=2e5+10; using ll=long long; int main() { int t; cin>>t; while(t--){ ll n,m; cin>>n>>m; ll k[n]; for(ll i=0;i<n;i++) cin>>k[i]; sort(k,k+n); for(ll i=0;i<m;i++) { ll a,b,c; cin>>a>>b>>c; auto it=upper_bound(k,k+n,b-2*sqrtl(a*c)); if(*it<b+2*sqrt(a*c)){ cout<<"YES\n"; cout<<ll(*it)<<endl; }else{ cout<<"NO\n"; } } } return 0; }
?
?
?
?