Submission #1730884

---

Source Code Expand

#include <iostream>
#include <vector>
#include <math.h>

using namespace std;
typedef long long ll;
#define pl pair<ll,ll>
#define rep(i,n) for(int i=0;i<(n);++i)
#define fi first
#define se second

int main(){
  vector<pl> tx(2);
  ll t,v,n; 
  rep(i,2){
    cin>>tx[i].fi>>tx[i].se;
  }
  cin>>t>>v>>n;
  vector<pl> x(n);
  rep(i,n){
    cin>>x[i].fi>>x[i].se;
  }

  //視点と中間地点と終点の距離を出す．速度で割る．時間より短いなら可能．
  rep(i,n){
    long double st =sqrt(pow(x[i].fi-tx[0].fi,2)+pow(x[i].se-tx[0].se,2));
    long double tf =sqrt(pow(x[i].fi-tx[1].fi,2)+pow(x[i].se-tx[1].se,2));
    if((st+tf)/v<=t){
      cout<<"YES"<<endl;
      return 0;
    }
  }
  cout<<"NO"<<endl;
  return 0;

}

Submission Info

Judge Result