Submission #1870591
Source Code Expand
#include <iostream>
#include <cmath>
#include <algorithm>
#include <deque>
#include <vector>
#include <map>
using namespace std;
//
// typedef long long ll;
// typedef pair<int,int> pi;
// typedef pair<ll,ll> pll;
// typedef pair<string,string> pss;
typedef vector<int> vi;
// typedef vector<vi> vvi;
// typedef vector<pi> vpi;
// typedef vector<ll> vll;
// typedef vector<vll> vvll;
//
// double EPS = 1e-9;
// int INFi = 1000000005;
// long long INFll = 1000000000000000005ll;
// double PI = acos(-1);
// int dirx[8] = {-1,0,0,1,-1,-1,1,1};
// int diry[8] = {0,1,-1,0,-1,1,-1,1};
//
#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
// #define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
// #define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
// #define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
// #define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
// #define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
// #define REPN(i,n) FORN(i,1,n)
// #define MAX(a,b) a = max(a,b)
// #define MIN(a,b) a = min(a,b)
// #define SQR(x) ((ll)(x) * (x))
// #define RESET(a,b) memset(a,b,sizeof(a))
// #define fi first
// #define se second
// // #define mp make_pair
// // #define pb push_back
// #define ALL(v) v.begin(),v.end()
// #define ALLA(arr,sz) arr,arr+sz
// #define SIZE(v) (int)v.size()
// #define SORT(v) sort(ALL(v))
// #define REVERSE(v) reverse(ALL(v))
// #define SORTA(arr,sz) sort(ALLA(arr,sz))
// #define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
// #define PERMUTE next_permutation
// #define TC(t) while(t--)
//
// inline string IntToString(ll a){
// char x[100];
// sprintf(x,"%lld",a); string s = x;
// return s;
// }
//
// inline ll StringToInt(string a){
// char x[100]; ll res;
// strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
// return res;
// }
//
// inline string GetString(void){
// char x[1000005];
// scanf("%s",x); string s = x;
// return s;
// }
//
// inline string uppercase(string s){
// int n = SIZE(s);
// REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
// return s;
// }
//
// inline string lowercase(string s){
// int n = SIZE(s);
// REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
// return s;
// }
//
//
int main(){
int txa, tya, txb, tyb, t, v, n;
cin >> txa >> tya >> txb >> tyb >> t >> v;
cin >> n;
vi x, y;
int xtmp, ytmp;
vi dis;
REP(i,n){
cin >> xtmp >> ytmp;
x.push_back(xtmp);
y.push_back(ytmp);
dis.push_back(sqrt((xtmp-txa)*(xtmp-txa) + (ytmp-tya) * (ytmp-tya)) + sqrt((xtmp-txb)*(xtmp-txb) + (ytmp-tyb) * (ytmp-tyb)));
}
REP(i, n){
if(dis[i] <= t * v){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 浮気調査 |
User |
rhd_20034 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2831 Byte |
Status |
WA |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 100 |
Status |
|
Set Name |
Test Cases |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, 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 |
WA |
1 ms |
256 KB |
sample_02.txt |
WA |
1 ms |
256 KB |
sample_03.txt |
WA |
1 ms |
256 KB |
sample_04.txt |
WA |
1 ms |
256 KB |
test_01.txt |
WA |
2 ms |
256 KB |
test_02.txt |
WA |
2 ms |
256 KB |
test_03.txt |
WA |
1 ms |
256 KB |
test_04.txt |
WA |
1 ms |
256 KB |
test_05.txt |
WA |
1 ms |
256 KB |
test_06.txt |
WA |
1 ms |
256 KB |
test_07.txt |
WA |
2 ms |
256 KB |
test_08.txt |
WA |
2 ms |
256 KB |
test_09.txt |
WA |
1 ms |
256 KB |
test_10.txt |
WA |
2 ms |
256 KB |
test_11.txt |
WA |
1 ms |
256 KB |
test_12.txt |
WA |
1 ms |
256 KB |
test_13.txt |
WA |
2 ms |
256 KB |
test_14.txt |
WA |
2 ms |
256 KB |
test_15.txt |
WA |
1 ms |
256 KB |
test_16.txt |
WA |
1 ms |
256 KB |
test_17.txt |
WA |
1 ms |
256 KB |
test_18.txt |
WA |
1 ms |
256 KB |
test_19.txt |
WA |
2 ms |
256 KB |
test_20.txt |
WA |
2 ms |
256 KB |
test_21.txt |
WA |
2 ms |
256 KB |
test_22.txt |
WA |
1 ms |
256 KB |
test_23.txt |
WA |
1 ms |
256 KB |
test_24.txt |
WA |
1 ms |
256 KB |
test_25.txt |
WA |
2 ms |
256 KB |
test_26.txt |
WA |
2 ms |
256 KB |
test_27.txt |
WA |
1 ms |
256 KB |
test_28.txt |
WA |
2 ms |
256 KB |
test_29.txt |
WA |
1 ms |
256 KB |
test_30.txt |
WA |
1 ms |
256 KB |
test_31.txt |
WA |
1 ms |
256 KB |