Submission #2175555

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<P> vp;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << endl
const ll INF = 1e+9+7;
ll n,m,l;
string s,t;
ll d[200010],dp[550][550];

int main(){
  ll a,b,x,y,p,q;
  cin >> a >> b >> x >> y >> p >> q;
  cin >> n;
  s = "NO";
  p *= q;
  rep(i,0,n){
    cin >> m >> l;
    ll ans = 0;
    ans += sqrt(pow(a-m,2) + pow(b-l,2));
    ans += sqrt(pow(x-m,2) + pow(y-l,2));
    if(p >= ans)s = "YES";
  }
  print(s);
  return 0;
}

Submission Info

Judge Result