結果
問題 | No.67 よくある棒を切る問題 (1) |
ユーザー | fujisu |
提出日時 | 2015-05-12 04:48:12 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 523 ms / 5,000 ms |
コード長 | 2,574 bytes |
コンパイル時間 | 2,439 ms |
コンパイル使用メモリ | 78,976 KB |
実行使用メモリ | 58,044 KB |
最終ジャッジ日時 | 2024-04-25 23:25:11 |
合計ジャッジ時間 | 15,430 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 297 ms
57,384 KB |
testcase_01 | AC | 51 ms
50,080 KB |
testcase_02 | AC | 285 ms
57,564 KB |
testcase_03 | AC | 448 ms
57,568 KB |
testcase_04 | AC | 459 ms
57,440 KB |
testcase_05 | AC | 434 ms
57,668 KB |
testcase_06 | AC | 436 ms
57,552 KB |
testcase_07 | AC | 471 ms
58,020 KB |
testcase_08 | AC | 481 ms
57,720 KB |
testcase_09 | AC | 467 ms
57,684 KB |
testcase_10 | AC | 406 ms
57,552 KB |
testcase_11 | AC | 454 ms
57,796 KB |
testcase_12 | AC | 383 ms
57,572 KB |
testcase_13 | AC | 446 ms
57,816 KB |
testcase_14 | AC | 478 ms
57,592 KB |
testcase_15 | AC | 447 ms
57,680 KB |
testcase_16 | AC | 361 ms
57,752 KB |
testcase_17 | AC | 441 ms
57,564 KB |
testcase_18 | AC | 369 ms
57,844 KB |
testcase_19 | AC | 523 ms
57,924 KB |
testcase_20 | AC | 467 ms
57,736 KB |
testcase_21 | AC | 478 ms
57,716 KB |
testcase_22 | AC | 337 ms
57,584 KB |
testcase_23 | AC | 449 ms
57,504 KB |
testcase_24 | AC | 52 ms
50,420 KB |
testcase_25 | AC | 108 ms
52,128 KB |
testcase_26 | AC | 97 ms
52,160 KB |
testcase_27 | AC | 94 ms
51,728 KB |
testcase_28 | AC | 226 ms
58,044 KB |
testcase_29 | AC | 176 ms
56,936 KB |
testcase_30 | AC | 119 ms
52,376 KB |
ソースコード
import java.io.IOException; import java.util.Arrays; import java.util.InputMismatchException; public class Main { int n; long[] s; long k; boolean check(double l) { long ans = 0; for (int i = 0; i < n; i++) { ans += (int) (s[i] / l); } return k <= ans; } void run() { MyScanner sc = new MyScanner(); n = sc.nextInt(); s = sc.nextLongArray(n); k = sc.nextLong(); Arrays.sort(s); double low = 0, high = s[n - 1]; for (int i = 0; i < 100; i++) { double mid = (low + high) / 2; if (check(mid)) { low = mid; } else { high = mid; } } System.out.println(low); } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }