Submission #1370081

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
int txa,tya,txb,tyb;
int T,V;
int n;
int x[1001],y[1001];
int main(){
  cin >> txa >> tya >> txb >> tyb;
  cin >> T >> V;
  cin >> n;
  bool f=false;
  for(int i=0;i<n;i++)cin >> x[i] >> y[i];
  for(int i=0;i<n;i++){
    int s=(txa-x[i])*(txa-x[i])+(tya-y[i])*(tya-y[i]);
    int t=(txb-x[i])*(txb-x[i])+(tyb-y[i])*(tyb-y[i]);
    double a=sqrt(s)+sqrt(t);
    if(a<=T*V)f=true;
    
  }
  if(f)cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}

Submission Info

Judge Result