Submission #22958


Source Code Expand

Copy
#include <cmath>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <sstream>
#include <utility>
#include <numeric>
#include <complex>
#include <cstdio>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) ((int)(a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FOREACH(i, a) REP(i, SZ(a))
using namespace std;

int main() {
	int N;
	scanf("%d", &N);
	int x[N], y[N];
	for(int i=0; i<N; ++i) {
		scanf("%d%d", &x[i], &y[i]);
	}

	double ret = 0;
	for(int i=0; i<N; ++i) {
		for(int j=i+1; j<N; ++j) {
			int dx = x[i] - x[j];
			int dy = y[i] - y[j];
			double z = sqrt(dx*dx + dy*dy);
			ret = max(ret, z);
		}
	}
	printf("%.9f\n", ret);

	return 0;
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User colun
Language C++ (G++ 4.6.4)
Score 100
Code Size 931 Byte
Status
Exec Time 48 ms
Memory 820 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:27:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Score / Max Score Test Cases
All 100 / 100 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 22 ms 780 KB
00_sample_01.txt 21 ms 792 KB
00_sample_02.txt 22 ms 792 KB
00_sample_03.txt 22 ms 796 KB
00_sample_04.txt 23 ms 816 KB
00_sample_05.txt 23 ms 788 KB
01_rnd_00.txt 24 ms 788 KB
01_rnd_01.txt 23 ms 760 KB
01_rnd_02.txt 23 ms 820 KB
01_rnd_03.txt 23 ms 800 KB
01_rnd_04.txt 23 ms 784 KB
01_rnd_05.txt 23 ms 768 KB
01_rnd_06.txt 23 ms 788 KB
01_rnd_07.txt 22 ms 788 KB
01_rnd_08.txt 24 ms 792 KB
01_rnd_09.txt 24 ms 760 KB
01_rnd_10.txt 23 ms 792 KB
01_rnd_11.txt 21 ms 796 KB
01_rnd_12.txt 23 ms 764 KB
01_rnd_13.txt 48 ms 792 KB
01_rnd_14.txt 23 ms 772 KB
01_rnd_15.txt 23 ms 756 KB
01_rnd_16.txt 29 ms 784 KB
01_rnd_17.txt 23 ms 792 KB
01_rnd_18.txt 23 ms 796 KB
01_rnd_19.txt 22 ms 792 KB