Submission #1476283

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<functional>
#include <string>
#include<cstdio>
#include<math.h>
#include<stack>
#include<queue>
#include<cstring>
#include<vector>
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define EREP(i,n) for(int i=(n-1);i>=0;--i)
#define D(n,retu) REP(i,n){cin>>retu[i];}
#define mod 1000000007
#define MIN -93193111451418101
#define INF 931931114518101
using namespace std;
typedef long long int ll;
template<typename T>
void fill_all(T& arr, const T& v) {
	arr = v;
}
template<typename T, typename ARR>
void fill_all(ARR& arr, const T& v) {
	for (auto& i : arr) { fill_all(i, v); }
}

//------------------変数-----------------------//
double n, m,motox,motoy,kekkax,kekkay,t,v;
typedef pair<ll, ll> P;

ll rec[90001];//kachi,kazu
ll toorimemo[114514];
vector<vector<ll>> G(301);
bool vis[300] = { false };
ll maxa = 0;
//-------------------関数----------------------//


int main() {
	cin >> motox >> motoy >> kekkax >> kekkay >> t >> v;
	cin >> n;
	REP(i, n) {
		ll x, y; cin >> x >> y;
		double hoge, piyo;
		hoge=sqrt((x - motox)*(x - motox)+(y-motoy)*(y - motoy));
		piyo = sqrt((kekkax - x)*(kekkax - x) + (kekkay - y)*(kekkay - y));
		if (hoge + piyo <= t*v) { cout << "YES" << endl; return 0; }
	}
	cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result