Submission #22924
Source Code Expand
#include <iostream> #include <iomanip> #include <sstream> #include <cstdio> #include <string> #include <vector> #include <algorithm> #include <complex> #include <cstring> #include <cstdlib> #include <cmath> #include <cassert> #include <climits> #include <queue> #include <set> #include <map> #include <valarray> #include <bitset> #include <stack> using namespace std; #define REP(i,n) for(int i=0;i<(int)n;++i) #define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i) #define ALL(c) (c).begin(), (c).end() typedef long long ll; typedef pair<int,int> pii; const int INF = 1<<29; const double PI = acos(-1); const double EPS = 1e-8; typedef complex<double> P; P p[100]; int main() { int n; cin >> n; REP(i,n)cin>>p[i].real()>>p[i].imag(); double d = 0; REP(i,n) REP(j,i) { d = max(d, abs(p[i]-p[j])); } printf("%.10f\n",d); }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | sune2 |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 907 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 828 KB |
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 | 21 ms | 784 KB |
00_sample_01.txt | AC | 21 ms | 784 KB |
00_sample_02.txt | AC | 21 ms | 760 KB |
00_sample_03.txt | AC | 21 ms | 792 KB |
00_sample_04.txt | AC | 21 ms | 788 KB |
00_sample_05.txt | AC | 21 ms | 720 KB |
01_rnd_00.txt | AC | 21 ms | 784 KB |
01_rnd_01.txt | AC | 20 ms | 788 KB |
01_rnd_02.txt | AC | 21 ms | 792 KB |
01_rnd_03.txt | AC | 21 ms | 796 KB |
01_rnd_04.txt | AC | 21 ms | 744 KB |
01_rnd_05.txt | AC | 22 ms | 828 KB |
01_rnd_06.txt | AC | 21 ms | 768 KB |
01_rnd_07.txt | AC | 21 ms | 796 KB |
01_rnd_08.txt | AC | 22 ms | 788 KB |
01_rnd_09.txt | AC | 21 ms | 796 KB |
01_rnd_10.txt | AC | 22 ms | 740 KB |
01_rnd_11.txt | AC | 21 ms | 796 KB |
01_rnd_12.txt | AC | 21 ms | 788 KB |
01_rnd_13.txt | AC | 21 ms | 760 KB |
01_rnd_14.txt | AC | 21 ms | 792 KB |
01_rnd_15.txt | AC | 22 ms | 760 KB |
01_rnd_16.txt | AC | 21 ms | 792 KB |
01_rnd_17.txt | AC | 20 ms | 792 KB |
01_rnd_18.txt | AC | 21 ms | 792 KB |
01_rnd_19.txt | AC | 22 ms | 792 KB |