Submission #7577313
Source Code Expand
#include <bits/stdc++.h> #define SORT(a) sort(a.begin(), a.end()) #define RSORT(a) sort(a.rbegin(), a.rend()) #define REP(i, n) for (int i = 0; i < n; i++) #define RREP(i, n) for (int i = n - 1; 0 <= i; i--) #define FOR(i, start, end) for (int i = start; i < end; i++) #define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--) #define ALL(a) a.begin(), a.end() using ll = long long; using namespace std; constexpr int INF32 = 1'050'000'000; constexpr long long INF64 = 4'000'000'000'000'000'000; constexpr int MOD7 = 1'000'000'007; constexpr int MOD9 = 1'000'000'009; template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } void print() { std::cout << '\n'; } template <class H, class... T> void print(H &&head, T &&... args) { std::cout << head; sizeof...(args) == 0 ? std::cout << "" : std::cout << ' '; print(std::forward<T>(args)...); } template <class T> void print(std::vector<T> &v) { for (int i = 0; i < v.size(); i++) { std::cout << v[i]; i == v.size() - 1 ? std::cout << '\n' : std::cout << ' '; } } template <class T> void print(std::vector<std::vector<T>> &v) { for (int i = 0; i < v.size(); i++) { for (int j = 0; j < v[i].size(); j++) { std::cout << v[i][j]; j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' '; } } } int main() { cin.tie(0); ios::sync_with_stdio(false); int xa, xb, ya, yb, T, V; cin >> xa >> xb >> ya >> yb >> T >> V; int N; cin >> N; vector<int> x(N), y(N); REP(i, N) { cin >> x[i] >> y[i]; } double mx = T * V; REP(i, N) { double xx = xa - x[i]; double yy = ya - x[i]; double xxx = x[i] - xb; double yyy = y[i] - yb; double dist = sqrt(xx * xx + yy * yy) + sqrt(xxx * xxx + yyy * yyy); if (dist <= mx) { print("YES"); return 0; } } print("NO"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 浮気調査 |
User | kobyn |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2243 Byte |
Status | WA |
Exec Time | 1 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 | 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 | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | WA | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | WA | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | WA | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | WA | 1 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | WA | 1 ms | 256 KB |
test_20.txt | AC | 1 ms | 256 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | WA | 1 ms | 256 KB |
test_23.txt | AC | 1 ms | 256 KB |
test_24.txt | AC | 1 ms | 256 KB |
test_25.txt | AC | 1 ms | 256 KB |
test_26.txt | WA | 1 ms | 256 KB |
test_27.txt | WA | 1 ms | 256 KB |
test_28.txt | AC | 1 ms | 256 KB |
test_29.txt | WA | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 1 ms | 256 KB |