Submission #180164


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define dump(n) cout<<"# "<<#n<<'='<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make_tuple

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;

const int INF=1e9;
const int MOD=1e9+7;
const double EPS=1e-9;

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
	return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& a){
	os<<'[';
	rep(i,a.size()) os<<(i?" ":"")<<a[i];
	return os<<']';
}

int main()
{
	for(int x1,y1,x2,y2,t,v,n;cin>>x1>>y1>>x2>>y2>>t>>v>>n;){
		int d=v*t;
		vi xs(n),ys(n);
		rep(i,n) cin>>xs[i]>>ys[i];
		
		bool res=false;
		rep(i,n){
			int dx1=x1-xs[i],dy1=y1-ys[i];
			int dx2=x2-xs[i],dy2=y2-ys[i];
			if(sqrt(dx1*dx1+dy1*dy1)+sqrt(dx2*dx2+dy2*dy2)<d+EPS){
				res=true;
				break;
			}
		}
		cout<<(res?"YES":"NO")<<endl;
	}
}

Submission Info

Submission Time
Task C - 浮気調査
User lyoz
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1375 Byte
Status AC
Exec Time 26 ms
Memory 932 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 31
Set Name Test Cases
All test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt
Case Name Status Exec Time Memory
sample_01.txt AC 21 ms 924 KB
sample_02.txt AC 21 ms 800 KB
sample_03.txt AC 20 ms 840 KB
sample_04.txt AC 26 ms 932 KB
test_01.txt AC 25 ms 928 KB
test_02.txt AC 21 ms 804 KB
test_03.txt AC 22 ms 808 KB
test_04.txt AC 21 ms 928 KB
test_05.txt AC 21 ms 932 KB
test_06.txt AC 20 ms 796 KB
test_07.txt AC 20 ms 796 KB
test_08.txt AC 21 ms 924 KB
test_09.txt AC 21 ms 748 KB
test_10.txt AC 20 ms 796 KB
test_11.txt AC 21 ms 748 KB
test_12.txt AC 21 ms 800 KB
test_13.txt AC 22 ms 932 KB
test_14.txt AC 21 ms 800 KB
test_15.txt AC 21 ms 924 KB
test_16.txt AC 21 ms 744 KB
test_17.txt AC 21 ms 800 KB
test_18.txt AC 21 ms 784 KB
test_19.txt AC 20 ms 928 KB
test_20.txt AC 22 ms 928 KB
test_21.txt AC 22 ms 804 KB
test_22.txt AC 24 ms 804 KB
test_23.txt AC 25 ms 804 KB
test_24.txt AC 20 ms 800 KB
test_25.txt AC 21 ms 796 KB
test_26.txt AC 22 ms 844 KB
test_27.txt AC 21 ms 928 KB
test_28.txt AC 24 ms 768 KB
test_29.txt AC 20 ms 804 KB
test_30.txt AC 21 ms 676 KB
test_31.txt AC 19 ms 796 KB