結果
問題 | No.172 UFOを捕まえろ |
ユーザー | uwi |
提出日時 | 2015-03-26 23:26:31 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 43 ms / 5,000 ms |
コード長 | 3,012 bytes |
コンパイル時間 | 4,870 ms |
コンパイル使用メモリ | 80,740 KB |
実行使用メモリ | 49,268 KB |
最終ジャッジ日時 | 2023-08-05 16:47:27 |
合計ジャッジ時間 | 5,630 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
48,948 KB |
testcase_01 | AC | 42 ms
49,144 KB |
testcase_02 | AC | 41 ms
48,908 KB |
testcase_03 | AC | 42 ms
47,568 KB |
testcase_04 | AC | 42 ms
49,020 KB |
testcase_05 | AC | 41 ms
49,140 KB |
testcase_06 | AC | 42 ms
49,256 KB |
testcase_07 | AC | 43 ms
49,064 KB |
testcase_08 | AC | 41 ms
49,184 KB |
testcase_09 | AC | 42 ms
48,924 KB |
testcase_10 | AC | 42 ms
48,952 KB |
testcase_11 | AC | 41 ms
49,076 KB |
testcase_12 | AC | 42 ms
49,128 KB |
testcase_13 | AC | 42 ms
49,148 KB |
testcase_14 | AC | 42 ms
49,260 KB |
testcase_15 | AC | 42 ms
49,080 KB |
testcase_16 | AC | 42 ms
49,268 KB |
testcase_17 | AC | 42 ms
47,428 KB |
testcase_18 | AC | 42 ms
49,068 KB |
testcase_19 | AC | 41 ms
49,244 KB |
testcase_20 | AC | 43 ms
49,136 KB |
testcase_21 | AC | 43 ms
47,208 KB |
testcase_22 | AC | 43 ms
49,048 KB |
testcase_23 | AC | 42 ms
49,156 KB |
ソースコード
package q4xx; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q388 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { // x+y+k=0 // X,Y // (k-(X+Y))/√2 >= R long x = Math.abs(nl()), y = Math.abs(nl()), r = nl(); for(long i = 1;i <= 100000;i++){ if(i-(x+y) > 0 && (i-(x+y))*(i-(x+y)) > 2L*r*r){ out.println(i); return; } } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q388().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }