Submission #180100
Source Code Expand
#include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <deque> #include <complex> #include <stack> #include <queue> #include <cstdio> #include <cctype> #include <cstring> #include <ctime> #include <iterator> #include <bitset> #include <numeric> #include <list> #include <iomanip> #if __cplusplus >= 201103L #include <array> #include <tuple> #include <initializer_list> #include <unordered_set> #include <unordered_map> #include <forward_list> #define cauto const auto& #endif using namespace std; typedef long long LL; typedef pair<int,int> pii; typedef pair<LL,LL> pll; typedef vector<int> vint; typedef vector<vector<int> > vvint; typedef vector<long long> vll, vLL; typedef vector<vector<long long> > vvll, vvLL; #define VV(T) vector<vector< T > > template <class T> void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){ v.assign(a, vector<T>(b, t)); } template <class F, class T> void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t; } #define REP(i,n) for(int i=0;i<int(n);++i) #define ALL(v) (v).begin(),(v).end() #define RALL(v) (v).rbegin(),(v).rend() #define PB push_back #define MOD 1000000009LL #define EPS 1e-8 int main(){ double x1, y1, x2, y2, t, v; int n; double x3, y3; cin >> x1 >> y1 >> x2 >> y2 >> t >> v >> n; bool ans = false; for(int i = 0; i < n; ++i){ cin >> x3 >> y3; double d = hypot(x1 - x3, y1 - y3) + hypot(x2 - x3, y2 - y3); if(d < t * v + EPS){ ans = true; } } puts(ans ? "YES" : "NO"); }
Submission Info
Submission Time | |
---|---|
Task | C - 浮気調査 |
User | climpet |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1790 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 928 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 22 ms | 924 KB |
sample_02.txt | AC | 22 ms | 884 KB |
sample_03.txt | AC | 20 ms | 924 KB |
sample_04.txt | AC | 20 ms | 924 KB |
test_01.txt | AC | 22 ms | 796 KB |
test_02.txt | AC | 22 ms | 928 KB |
test_03.txt | AC | 20 ms | 796 KB |
test_04.txt | AC | 20 ms | 744 KB |
test_05.txt | AC | 21 ms | 924 KB |
test_06.txt | AC | 20 ms | 924 KB |
test_07.txt | AC | 22 ms | 924 KB |
test_08.txt | AC | 22 ms | 736 KB |
test_09.txt | AC | 21 ms | 804 KB |
test_10.txt | AC | 23 ms | 928 KB |
test_11.txt | AC | 22 ms | 804 KB |
test_12.txt | AC | 21 ms | 796 KB |
test_13.txt | AC | 23 ms | 736 KB |
test_14.txt | AC | 22 ms | 672 KB |
test_15.txt | AC | 21 ms | 924 KB |
test_16.txt | AC | 22 ms | 928 KB |
test_17.txt | AC | 20 ms | 796 KB |
test_18.txt | AC | 21 ms | 800 KB |
test_19.txt | AC | 22 ms | 924 KB |
test_20.txt | AC | 22 ms | 796 KB |
test_21.txt | AC | 22 ms | 756 KB |
test_22.txt | AC | 21 ms | 928 KB |
test_23.txt | AC | 20 ms | 796 KB |
test_24.txt | AC | 23 ms | 680 KB |
test_25.txt | AC | 24 ms | 736 KB |
test_26.txt | AC | 23 ms | 800 KB |
test_27.txt | AC | 23 ms | 804 KB |
test_28.txt | AC | 23 ms | 736 KB |
test_29.txt | AC | 23 ms | 804 KB |
test_30.txt | AC | 20 ms | 928 KB |
test_31.txt | AC | 21 ms | 800 KB |