Submission #2175557
Source Code Expand
#include <iostream> #include <cstring> #include <cstdlib> #include <cmath> #include <algorithm> #include <functional> #include <vector> #include <queue> #include <stack> #include <map> #include <set> #include <bitset> #include <cassert> #include <exception> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<string> vs; typedef vector<P> vp; #define rep(i,a,n) for(ll i = (a);i < (n);i++) #define per(i,a,n) for(ll i = (a);i > (n);i--) #define lep(i,a,n) for(ll i = (a);i <= (n);i++) #define pel(i,a,n) for(ll i = (a);i >= (n);i--) #define clr(a,b) memset((a),(b),sizeof(a)) #define pb push_back #define mp make_pair #define all(c) (c).begin(),(c).end() #define sz size() #define print(X) cout << (X) << endl const ll INF = 1e+9+7; ll n,m,l; string s,t; ll d[200010],dp[550][550]; int main(){ ll a,b,x,y,p,q; cin >> a >> b >> x >> y >> p >> q; cin >> n; s = "NO"; p *= q; rep(i,0,n){ cin >> m >> l; double ans = 0; ans += sqrt(pow(a-m,2) + pow(b-l,2)); ans += sqrt(pow(x-m,2) + pow(y-l,2)); if(p >= ans)s = "YES"; } print(s); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 浮気調査 |
User | shadowlink_0122 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1239 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 | 2 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 |