Submission #1688517

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 100000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;
/*---------------------------------------------------*/

int txa,tya,txb,tyb,t,v;
int maxi=0;

void solve(){
  
}

int main(){
  int n;
  int x,y;
  cin>>txa>>tya>>txb>>tyb>>t>>v;
  maxi=v*t;
  cin>>n;
  bool ok=false;
  rep(i,n){
    cin>>x>>y;
    int root_d=sqrt(pow(abs(txa-x),2)+pow(abs(tya-y),2))+sqrt(pow(abs(x-txb),2)+pow(abs(y-tyb),2));
    //cout<<root_d<<" "<<maxi<<endl;
    if(root_d<=maxi)ok=true;
  }
  if(ok)cout<<"YES"<<endl;
  else cout<<"NO"<<endl;
  return 0;
}

Submission Info

Judge Result