結果
問題 | No.94 圏外です。(EASY) |
ユーザー | tanzaku |
提出日時 | 2014-12-07 19:35:07 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 2,298 ms / 5,000 ms |
コード長 | 6,024 bytes |
コンパイル時間 | 2,984 ms |
コンパイル使用メモリ | 87,988 KB |
実行使用メモリ | 43,328 KB |
最終ジャッジ日時 | 2024-06-26 07:23:31 |
合計ジャッジ時間 | 31,781 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 129 ms
41,276 KB |
testcase_01 | AC | 55 ms
37,356 KB |
testcase_02 | AC | 129 ms
41,068 KB |
testcase_03 | AC | 57 ms
37,376 KB |
testcase_04 | AC | 160 ms
41,496 KB |
testcase_05 | AC | 191 ms
41,396 KB |
testcase_06 | AC | 260 ms
41,568 KB |
testcase_07 | AC | 456 ms
41,508 KB |
testcase_08 | AC | 1,012 ms
42,304 KB |
testcase_09 | AC | 2,284 ms
42,604 KB |
testcase_10 | AC | 2,277 ms
42,592 KB |
testcase_11 | AC | 2,281 ms
42,596 KB |
testcase_12 | AC | 2,276 ms
42,672 KB |
testcase_13 | AC | 2,281 ms
42,696 KB |
testcase_14 | AC | 2,283 ms
42,528 KB |
testcase_15 | AC | 2,281 ms
42,704 KB |
testcase_16 | AC | 2,288 ms
42,684 KB |
testcase_17 | AC | 2,281 ms
42,592 KB |
testcase_18 | AC | 2,283 ms
42,592 KB |
testcase_19 | AC | 2,298 ms
43,328 KB |
testcase_20 | AC | 130 ms
41,220 KB |
testcase_21 | AC | 57 ms
37,272 KB |
ソースコード
import java.io.*; import java.math.*; import java.util.*; import static java.util.Arrays.*; public class Main { private static final int mod = (int)1e9+7; final Random random = new Random(0); final IOFast io = new IOFast(); /// MAIN CODE public void run() throws IOException { // int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim()); int TEST_CASE = 1; while(TEST_CASE-- != 0) { int n = io.nextInt(); int[][] p = io.nextIntArray2D(n, 2); boolean[][] b = new boolean[n][n]; for(int i = 0; i < n; i++) { for(int j = i + 1; j < n; j++) { int dx = p[i][0]-p[j][0]; int dy = p[i][1]-p[j][1]; if(dx*dx+dy*dy <= 10*10) { b[i][j] = b[j][i] = true; } } } for(int k = 0; k < n; k++) for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) b[i][j] |= b[i][k] & b[k][j]; int ans = 0; for(int i = 0; i < n; i++) { for(int j = i + 1; j < n; j++) if(b[i][j]) { int dx = p[i][0]-p[j][0]; int dy = p[i][1]-p[j][1]; ans = Math.max(ans, dx*dx+dy*dy); } } if(ans == 0) { io.out.println(n > 0 ? 2 : 1); } else { io.out.printf("%.10f\n", Math.sqrt(ans) + 2); } } } /// TEMPLATE static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); } static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); } static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; } static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; } void main() throws IOException { // IOFast.setFileIO("rle-size.in", "rle-size.out"); try { run(); } catch (EndOfFileRuntimeException e) { } io.out.flush(); } public static void main(String[] args) throws IOException { new Main().main(); } static class EndOfFileRuntimeException extends RuntimeException { private static final long serialVersionUID = -8565341110209207657L; } static public class IOFast { private BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); private PrintWriter out = new PrintWriter(System.out); void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); } void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); } void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); } private static int pos, readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500*8*2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; } public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } } int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); } public String nextString() throws IOException { return new String(next()); } public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; } public double nextDouble() throws IOException { return Double.parseDouble(nextString()); } public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; } public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; } public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }