Submission #22938
Source Code Expand
#include <iostream> #include <sstream> #include <string> #include <vector> #include <stack> #include <queue> #include <set> #include <map> #include <algorithm> #include <cstdio> #include <cstdlib> #include <cstring> #include <cctype> #include <cmath> #include <cassert> using namespace std; #define all(c) (c).begin(), (c).end() #define iter(c) __typeof((c).begin()) #define cpresent(c, e) (find(all(c), (e)) != (c).end()) #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i) #define pb(e) push_back(e) #define mp(a, b) make_pair(a, b) #include <complex> typedef complex<double> p_t; int main() { int N; while (1 == scanf("%d", &N)) { vector<p_t> P(N); rep (i, N) scanf("%lf%lf", &P[i].real(), &P[i].imag()); double ans = 0.0; rep (i, N) rep (j, i) ans = max(ans, abs(P[i] - P[j])); printf("%.10f\n", ans); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | iwiwi |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 963 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 820 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:33:59: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_max.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_max.txt | AC | 23 ms | 796 KB |
00_sample_01.txt | AC | 21 ms | 792 KB |
00_sample_02.txt | AC | 22 ms | 792 KB |
00_sample_03.txt | AC | 21 ms | 788 KB |
00_sample_04.txt | AC | 20 ms | 788 KB |
00_sample_05.txt | AC | 20 ms | 784 KB |
01_rnd_00.txt | AC | 21 ms | 788 KB |
01_rnd_01.txt | AC | 22 ms | 792 KB |
01_rnd_02.txt | AC | 22 ms | 780 KB |
01_rnd_03.txt | AC | 22 ms | 812 KB |
01_rnd_04.txt | AC | 21 ms | 788 KB |
01_rnd_05.txt | AC | 21 ms | 796 KB |
01_rnd_06.txt | AC | 21 ms | 784 KB |
01_rnd_07.txt | AC | 21 ms | 820 KB |
01_rnd_08.txt | AC | 21 ms | 784 KB |
01_rnd_09.txt | AC | 21 ms | 796 KB |
01_rnd_10.txt | AC | 21 ms | 788 KB |
01_rnd_11.txt | AC | 21 ms | 788 KB |
01_rnd_12.txt | AC | 20 ms | 784 KB |
01_rnd_13.txt | AC | 21 ms | 792 KB |
01_rnd_14.txt | AC | 21 ms | 792 KB |
01_rnd_15.txt | AC | 20 ms | 756 KB |
01_rnd_16.txt | AC | 20 ms | 792 KB |
01_rnd_17.txt | AC | 22 ms | 812 KB |
01_rnd_18.txt | AC | 22 ms | 756 KB |
01_rnd_19.txt | AC | 20 ms | 792 KB |