Submission #6899996

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
using ll=long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;


int main(){
    ll xa,ya,xb,yb;
    cin>>xa>>ya>>xb>>yb;
    ll t,v;
    cin>>t>>v;
    int n;
    cin>>n;
    ll x,y;
    bool judge=false;
    rep(i,n){
      cin>>x>>y;
      ll a=(int)pow(x-xa,2)+(int)pow(y-ya,2);
      a=pow(a,0.5);
      ll b=(int)pow(x-xb,2)+(int)pow(y-yb,2);
      b=pow(b,0.5);
      if(t*v>=a+b){
        judge=true;
        break;
      }
    }
    if(judge)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}

Submission Info

Judge Result