Submission #22940


Source Code Expand

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;

public class Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni();
		int[][] a = new int[n][];
		for(int i = 0;i < n;i++){
			a[i] = new int[]{ni(), ni()};
		}
		double max = 0;
		for(int i = 0;i < n;i++){
			for(int j = i+1;j < n;j++){
				max = Math.max(max, 
						Math.sqrt(
								(a[i][0]-a[j][0])*(a[i][0]-a[j][0])+
								(a[i][1]-a[j][1])*(a[i][1]-a[j][1])
								));
			}
		}
		out.printf("%.9f\n", max);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	static boolean eof()
	{
		try {
			is.mark(1000);
			int b;
			while((b = is.read()) != -1 && !(b >= 33 && b <= 126));
			is.reset();
			return b == -1;
		} catch (IOException e) {
			return true;
		}
	}
		
	static int ni()
	{
		try {
			int num = 0;
			boolean minus = false;
			while((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));
			if(num == '-'){
				num = 0;
				minus = true;
			}else{
				num -= '0';
			}
			
			while(true){
				int b = is.read();
				if(b >= '0' && b <= '9'){
					num = num * 10 + (b - '0');
				}else{
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}
	
	static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User uwi
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 1784 Byte
Status AC
Exec Time 471 ms
Memory 19956 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 452 ms 19824 KB
00_sample_01.txt AC 411 ms 19832 KB
00_sample_02.txt AC 458 ms 19832 KB
00_sample_03.txt AC 414 ms 19820 KB
00_sample_04.txt AC 433 ms 19760 KB
00_sample_05.txt AC 407 ms 19816 KB
01_rnd_00.txt AC 412 ms 19832 KB
01_rnd_01.txt AC 465 ms 19804 KB
01_rnd_02.txt AC 441 ms 19832 KB
01_rnd_03.txt AC 423 ms 19828 KB
01_rnd_04.txt AC 412 ms 19828 KB
01_rnd_05.txt AC 420 ms 19836 KB
01_rnd_06.txt AC 415 ms 19836 KB
01_rnd_07.txt AC 424 ms 19828 KB
01_rnd_08.txt AC 471 ms 19880 KB
01_rnd_09.txt AC 421 ms 19832 KB
01_rnd_10.txt AC 461 ms 19760 KB
01_rnd_11.txt AC 414 ms 19844 KB
01_rnd_12.txt AC 409 ms 19956 KB
01_rnd_13.txt AC 467 ms 19880 KB
01_rnd_14.txt AC 404 ms 19820 KB
01_rnd_15.txt AC 416 ms 19824 KB
01_rnd_16.txt AC 413 ms 19832 KB
01_rnd_17.txt AC 415 ms 19788 KB
01_rnd_18.txt AC 428 ms 19828 KB
01_rnd_19.txt AC 412 ms 19808 KB