Submission #3629019
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <utility> #include <functional> #include <numeric> #include <list> #include <set> #include <map> #include <cstring> #include <cmath> #include <math.h> using namespace std; const int MOD = 1000000007; const int INF = 1e9; #define v_exists(elem, v) find(v.begin(),v.end(),elem)!=v.end() #define s_exists(elem, s) s.find(elem)!=s.end() #define tasu(x, y) (x+y)%MOD #define kake(x, y) x*y%MOD long gcd(long a, long b) { return b == 0 ? a : gcd(b, a % b); } long lcm( long m, long n ){ if ( ( 0 == m ) || ( 0 == n ) ) return 0; return ((m / gcd(m, n)) * n); } int main(){ int txa, tya, txb, tyb, T, V, n; // 1 1 8 2 2 4 // 1 // 4 5 cin >> txa >> tya >> txb >> tyb >> T >> V >> n; int x[1010]; int y[1010]; fill(x, x+1010, -1); fill(y, y+1010, -1); string possible = "NO"; // get distance to each girl's house for (int i = 0; i < n; ++i){ cin >> x[i] >> y[i]; if(sqrt((x[i]-txa)*(x[i]-txa)+(y[i]-tya)*(y[i]-tya))+sqrt((x[i]-txb)*(x[i]-txb)+(y[i]-tyb)*(y[i]-tyb)) <= T*V){ possible = "YES"; } } cout << possible << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 浮気調査 |
User | cacao |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1194 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 2 ms | 256 KB |
test_02.txt | AC | 2 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 2 ms | 256 KB |
test_08.txt | AC | 2 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 2 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 2 ms | 256 KB |
test_14.txt | AC | 2 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | AC | 2 ms | 256 KB |
test_20.txt | AC | 2 ms | 256 KB |
test_21.txt | AC | 2 ms | 256 KB |
test_22.txt | AC | 1 ms | 256 KB |
test_23.txt | AC | 1 ms | 256 KB |
test_24.txt | AC | 1 ms | 256 KB |
test_25.txt | AC | 2 ms | 256 KB |
test_26.txt | AC | 2 ms | 256 KB |
test_27.txt | AC | 1 ms | 256 KB |
test_28.txt | AC | 1 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 1 ms | 256 KB |