結果
問題 | No.67 よくある棒を切る問題 (1) |
ユーザー | Oland |
提出日時 | 2019-04-02 20:06:12 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,476 bytes |
コンパイル時間 | 2,267 ms |
コンパイル使用メモリ | 78,012 KB |
実行使用メモリ | 83,324 KB |
最終ジャッジ日時 | 2024-11-30 22:15:40 |
合計ジャッジ時間 | 67,491 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | TLE | - |
testcase_01 | AC | 54 ms
76,552 KB |
testcase_02 | AC | 150 ms
78,716 KB |
testcase_03 | AC | 211 ms
46,932 KB |
testcase_04 | AC | 208 ms
81,524 KB |
testcase_05 | AC | 228 ms
81,404 KB |
testcase_06 | AC | 238 ms
83,324 KB |
testcase_07 | AC | 219 ms
81,784 KB |
testcase_08 | AC | 239 ms
61,688 KB |
testcase_09 | AC | 228 ms
41,908 KB |
testcase_10 | AC | 221 ms
41,716 KB |
testcase_11 | AC | 227 ms
41,776 KB |
testcase_12 | AC | 218 ms
41,728 KB |
testcase_13 | AC | 230 ms
41,632 KB |
testcase_14 | AC | 216 ms
40,212 KB |
testcase_15 | AC | 227 ms
41,764 KB |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | AC | 54 ms
36,604 KB |
testcase_25 | AC | 68 ms
37,128 KB |
testcase_26 | AC | 58 ms
36,724 KB |
testcase_27 | AC | 55 ms
36,532 KB |
testcase_28 | AC | 119 ms
38,496 KB |
testcase_29 | AC | 85 ms
37,856 KB |
testcase_30 | AC | 66 ms
76,452 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.Map.Entry; public class Main { final boolean isDebug = false; String fileName = "input.txt"; FastScanner sc; PrintWriter out; final int MOD = (int)1e9+7; final int INF = Integer.MAX_VALUE / 2; int N; long K; int[] L; void solve() throws Exception{ N = sc.nextInt(); L = new int[N]; int max = 0; for(int i = 0; i < N; i++){ L[i] = sc.nextInt(); max = Math.max(max, L[i]); } K = sc.nextLong(); double ok = 0, ng = (double)max+1; while(Math.abs(ng - ok) > 1e-9){ double mid = (ok + ng) / 2; if(makeNum(mid) >= K) ok = mid; else ng = mid; } System.out.println(ok); } long makeNum(double x){ long num = 0; for(int len : L){ num += (double)len / x; } return num; } /* end solve */ /* main */ public static void main(String[] args) throws Exception { new Main().m(); } void m() throws Exception { long S = System.currentTimeMillis(); sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); if(isDebug){ System.out.println("---Debug---"); System.out.printf("%8d ms", (G-S)); } } /* end main */ } /* end Main */ class FastScanner { private InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) { this.in = in; } private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c){ return 33 <= c && c <= 126; } public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }