Submission #22922


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <complex>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <utility>
#include <functional>
#include <iterator>

using namespace std;

#define dump(n) cerr<<"# "<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int,int> pii;

int main()
{
	for(int n;cin>>n;){
		vd x(n),y(n);
		rep(i,n) cin>>x[i]>>y[i];
		double mx=0;
		rep(i,n) rep(j,n)
			mx=max(mx,hypot(x[i]-x[j],y[i]-y[j]));
		printf("%f\n",mx);
	}
	
	return 0;
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User lyoz
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1205 Byte
Status AC
Exec Time 82 ms
Memory 816 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 26
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 788 KB
00_sample_01.txt AC 22 ms 788 KB
00_sample_02.txt AC 22 ms 816 KB
00_sample_03.txt AC 20 ms 788 KB
00_sample_04.txt AC 20 ms 784 KB
00_sample_05.txt AC 21 ms 752 KB
01_rnd_00.txt AC 23 ms 764 KB
01_rnd_01.txt AC 22 ms 796 KB
01_rnd_02.txt AC 22 ms 784 KB
01_rnd_03.txt AC 20 ms 748 KB
01_rnd_04.txt AC 20 ms 792 KB
01_rnd_05.txt AC 23 ms 788 KB
01_rnd_06.txt AC 22 ms 792 KB
01_rnd_07.txt AC 22 ms 784 KB
01_rnd_08.txt AC 24 ms 788 KB
01_rnd_09.txt AC 23 ms 788 KB
01_rnd_10.txt AC 20 ms 784 KB
01_rnd_11.txt AC 22 ms 792 KB
01_rnd_12.txt AC 20 ms 784 KB
01_rnd_13.txt AC 21 ms 796 KB
01_rnd_14.txt AC 20 ms 788 KB
01_rnd_15.txt AC 23 ms 788 KB
01_rnd_16.txt AC 22 ms 760 KB
01_rnd_17.txt AC 22 ms 792 KB
01_rnd_18.txt AC 23 ms 792 KB
01_rnd_19.txt AC 82 ms 788 KB