結果
問題 | No.2420 Simple Problem |
ユーザー | hiromi_ayase |
提出日時 | 2023-08-12 15:01:05 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,347 bytes |
コンパイル時間 | 2,254 ms |
コンパイル使用メモリ | 78,680 KB |
実行使用メモリ | 60,292 KB |
最終ジャッジ日時 | 2024-04-30 07:49:50 |
合計ジャッジ時間 | 20,539 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
50,588 KB |
testcase_01 | AC | 361 ms
60,116 KB |
testcase_02 | AC | 96 ms
52,416 KB |
testcase_03 | AC | 245 ms
59,440 KB |
testcase_04 | AC | 475 ms
59,800 KB |
testcase_05 | AC | 395 ms
60,148 KB |
testcase_06 | AC | 524 ms
60,028 KB |
testcase_07 | AC | 504 ms
60,144 KB |
testcase_08 | AC | 528 ms
60,196 KB |
testcase_09 | AC | 525 ms
60,040 KB |
testcase_10 | AC | 509 ms
59,824 KB |
testcase_11 | AC | 508 ms
60,144 KB |
testcase_12 | AC | 532 ms
60,060 KB |
testcase_13 | AC | 517 ms
59,824 KB |
testcase_14 | AC | 524 ms
59,932 KB |
testcase_15 | AC | 538 ms
59,828 KB |
testcase_16 | AC | 575 ms
60,016 KB |
testcase_17 | AC | 511 ms
60,124 KB |
testcase_18 | AC | 520 ms
60,092 KB |
testcase_19 | AC | 534 ms
60,264 KB |
testcase_20 | AC | 517 ms
60,160 KB |
testcase_21 | AC | 507 ms
60,176 KB |
testcase_22 | AC | 518 ms
59,952 KB |
testcase_23 | AC | 507 ms
60,120 KB |
testcase_24 | AC | 514 ms
60,152 KB |
testcase_25 | AC | 519 ms
60,292 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 47 ms
50,612 KB |
testcase_33 | AC | 366 ms
59,692 KB |
ソースコード
import java.util.*; import java.io.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); for (int i = 0; i < n; i ++) { solve(ni(), ni()); } } private static void solve(long a, long b) { // a + b + 2sqrt(ab) < x^2 // x^2 - a - b > 2sqrt(ab) // (x^2 - a- b)^2 > 4ab long ok = (int)Math.sqrt(1e9) * 2 + 100; long ng = 0; while (Math.abs(ok - ng) > 1) { long x = (ok + ng) / 2; double y = (x * x - a - b) - 2 * Math.sqrt(a * b); if (y > 0) { ok = x; } else { ng = x; } } out.println(ok); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { solve(); out.flush(); } }, "", 64000000).start(); } private static PrintWriter out = new PrintWriter(System.out); private static StringTokenizer tokenizer = null; private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768); public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } }