結果

問題 No.67 よくある棒を切る問題 (1)
ユーザー OlandOland
提出日時 2019-04-02 20:15:22
言語 Java21
(openjdk 21)
結果
AC  
実行時間 287 ms / 5,000 ms
コード長 3,515 bytes
コンパイル時間 2,437 ms
コンパイル使用メモリ 78,332 KB
実行使用メモリ 54,604 KB
最終ジャッジ日時 2024-04-26 00:41:22
合計ジャッジ時間 10,714 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 270 ms
52,912 KB
testcase_01 AC 55 ms
50,208 KB
testcase_02 AC 147 ms
52,144 KB
testcase_03 AC 215 ms
54,404 KB
testcase_04 AC 229 ms
54,424 KB
testcase_05 AC 207 ms
52,948 KB
testcase_06 AC 207 ms
52,832 KB
testcase_07 AC 217 ms
52,904 KB
testcase_08 AC 215 ms
54,316 KB
testcase_09 AC 218 ms
53,032 KB
testcase_10 AC 200 ms
52,856 KB
testcase_11 AC 224 ms
54,408 KB
testcase_12 AC 204 ms
52,792 KB
testcase_13 AC 208 ms
52,936 KB
testcase_14 AC 231 ms
54,544 KB
testcase_15 AC 231 ms
54,500 KB
testcase_16 AC 272 ms
52,980 KB
testcase_17 AC 265 ms
52,676 KB
testcase_18 AC 287 ms
54,540 KB
testcase_19 AC 274 ms
53,052 KB
testcase_20 AC 275 ms
53,116 KB
testcase_21 AC 267 ms
52,816 KB
testcase_22 AC 273 ms
54,604 KB
testcase_23 AC 253 ms
52,744 KB
testcase_24 AC 56 ms
50,168 KB
testcase_25 AC 70 ms
50,428 KB
testcase_26 AC 61 ms
49,640 KB
testcase_27 AC 59 ms
50,244 KB
testcase_28 AC 126 ms
52,056 KB
testcase_29 AC 98 ms
51,152 KB
testcase_30 AC 70 ms
50,544 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
		int cnt = 0;
		while(Math.abs(ng - ok) > 1e-9 && cnt <= 100){
			cnt++;
			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());
    }
}
0