Submission #1769658

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>     //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>        //do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod=1000000007;

int main(){
	int n,sx,sy,gx,gy,t,v,x[1001],y[1001];
	cin>>sx>>sy>>gx>>gy>>t>>v>>n;
	int dx=t*v,f=0;
	double dst=0;
	FOR(i,0,n)cin>>x[i]>>y[i];
	FOR(i,0,n){
		if(sqrt((x[i]-sx)*(x[i]-sx)+(y[i]-sy)*(y[i]-sy))+sqrt((x[i]-gx)*(x[i]-gx)+(y[i]-gy)*(y[i]-gy))<=dx+0.0000002){
			f=1;
			break;
		}
		
	}
	if(f==0)cout<<"NO"<<endl;
	else cout<<"YES"<<endl;
	
	
    return 0;
}

Submission Info

Judge Result