Submission #23053
Source Code Expand
#include <iostream> #include <iomanip> #include <sstream> #include <cstdio> #include <cstdlib> #include <cmath> #include <climits> #include <string> #include <vector> #include <stack> #include <queue> #include <set> #include <map> #include <algorithm> #include <functional> #include <utility> using namespace std; typedef unsigned int ui; typedef long long ll; typedef unsigned long long ull; typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int,int> PII; const int INF = INT_MAX / 4; #define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); i++ ) #define UREP( i, m, n ) for ( ui i = (ui)( m ); i < (ui)( n ); i++ ) #define EACH( v, c ) for ( __typeof( c.front() ) &v : c ) #define ITER( c ) __typeof( (c).begin() ) #define IREP( c, it ) for ( ITER(c) it = c.begin(); it != c.end(); ++it ) #define ALL( c ) (c).begin(), (c).end() #define RALL( c ) (c).rbegin(), (c).rend() #define PB( n ) push_back( n ) #define MP( a, b ) make_pair( ( a ), ( b ) ) #define EXIST( c, e ) ( (c).find( e ) != (c).end() ) #define fst first #define snd second #define DUMP( x ) cerr << #x << " = " << ( x ) << endl #define DEBUG( x ) cerr << __FILE__ << ":" << __LINE__ << ": " << #x << " = " << ( x ) << endl int main() { int n; cin >> n; vector<int> x( n ), y( n ); REP( i, 0, n ) { cin >> x[i] >> y[i]; } double res = 0.; REP( i, 0, n ) { REP( j, i + 1, n ) { double curr = sqrt( pow( x[i] - x[j], 2 ) + pow( y[i] - y[j], 2 ) ); res = max( res, curr ); } } cout.precision( 12 ); cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | torus711 |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1660 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 896 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 | 844 KB |
00_sample_01.txt | AC | 23 ms | 732 KB |
00_sample_02.txt | AC | 22 ms | 768 KB |
00_sample_03.txt | AC | 21 ms | 776 KB |
00_sample_04.txt | AC | 22 ms | 780 KB |
00_sample_05.txt | AC | 21 ms | 776 KB |
01_rnd_00.txt | AC | 22 ms | 776 KB |
01_rnd_01.txt | AC | 24 ms | 736 KB |
01_rnd_02.txt | AC | 21 ms | 896 KB |
01_rnd_03.txt | AC | 21 ms | 784 KB |
01_rnd_04.txt | AC | 22 ms | 764 KB |
01_rnd_05.txt | AC | 21 ms | 784 KB |
01_rnd_06.txt | AC | 20 ms | 784 KB |
01_rnd_07.txt | AC | 24 ms | 852 KB |
01_rnd_08.txt | AC | 21 ms | 780 KB |
01_rnd_09.txt | AC | 22 ms | 772 KB |
01_rnd_10.txt | AC | 21 ms | 776 KB |
01_rnd_11.txt | AC | 22 ms | 780 KB |
01_rnd_12.txt | AC | 21 ms | 768 KB |
01_rnd_13.txt | AC | 23 ms | 836 KB |
01_rnd_14.txt | AC | 21 ms | 784 KB |
01_rnd_15.txt | AC | 23 ms | 780 KB |
01_rnd_16.txt | AC | 21 ms | 780 KB |
01_rnd_17.txt | AC | 21 ms | 780 KB |
01_rnd_18.txt | AC | 22 ms | 788 KB |
01_rnd_19.txt | AC | 21 ms | 732 KB |