Submission #22928
Source Code Expand
#include <map> #include <set> #include <cmath> #include <stack> #include <queue> #include <string> #include <vector> #include <bitset> #include <fstream> #include <sstream> #include <stdio.h> #include <ctype.h> #include <string.h> #include <iostream> #include <algorithm> using namespace std; #define li long long int #define rep(i,to) for(li i=0;i<((li)(to));++i) #define pb push_back #define sz(v) ((li)(v).size()) #define bit(n) (1ll<<(li)(n)) #define all(vec) (vec).begin(),(vec).end() #define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++) #define MP make_pair #define F first #define S second int main() { li n; cin >> n; vector<pair<double, double> > a(n); rep(i, n) cin >> a[i].F >> a[i].S; double res = 0; rep(i, n)rep(j, i) res = max(res, hypot(a[i].F - a[j].F, a[i].S - a[j].S)); printf("%0.30lf\n", res); }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | Komaki |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 934 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 796 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 | 22 ms | 792 KB |
00_sample_01.txt | AC | 21 ms | 784 KB |
00_sample_02.txt | AC | 22 ms | 788 KB |
00_sample_03.txt | AC | 21 ms | 792 KB |
00_sample_04.txt | AC | 22 ms | 784 KB |
00_sample_05.txt | AC | 22 ms | 780 KB |
01_rnd_00.txt | AC | 22 ms | 788 KB |
01_rnd_01.txt | AC | 22 ms | 788 KB |
01_rnd_02.txt | AC | 21 ms | 784 KB |
01_rnd_03.txt | AC | 22 ms | 792 KB |
01_rnd_04.txt | AC | 21 ms | 784 KB |
01_rnd_05.txt | AC | 22 ms | 736 KB |
01_rnd_06.txt | AC | 22 ms | 772 KB |
01_rnd_07.txt | AC | 21 ms | 792 KB |
01_rnd_08.txt | AC | 20 ms | 788 KB |
01_rnd_09.txt | AC | 21 ms | 784 KB |
01_rnd_10.txt | AC | 22 ms | 768 KB |
01_rnd_11.txt | AC | 22 ms | 788 KB |
01_rnd_12.txt | AC | 22 ms | 788 KB |
01_rnd_13.txt | AC | 22 ms | 788 KB |
01_rnd_14.txt | AC | 22 ms | 768 KB |
01_rnd_15.txt | AC | 20 ms | 796 KB |
01_rnd_16.txt | AC | 21 ms | 796 KB |
01_rnd_17.txt | AC | 21 ms | 796 KB |
01_rnd_18.txt | AC | 22 ms | 788 KB |
01_rnd_19.txt | AC | 22 ms | 796 KB |