結果

問題 No.67 よくある棒を切る問題 (1)
ユーザー touchan4692touchan4692
提出日時 2019-05-09 01:46:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 331 ms / 5,000 ms
コード長 6,146 bytes
コンパイル時間 3,397 ms
コンパイル使用メモリ 93,348 KB
実行使用メモリ 43,548 KB
最終ジャッジ日時 2024-11-08 12:55:30
合計ジャッジ時間 12,791 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 331 ms
42,740 KB
testcase_01 AC 56 ms
37,392 KB
testcase_02 AC 195 ms
39,984 KB
testcase_03 AC 292 ms
43,004 KB
testcase_04 AC 300 ms
41,712 KB
testcase_05 AC 301 ms
43,484 KB
testcase_06 AC 303 ms
41,888 KB
testcase_07 AC 322 ms
42,916 KB
testcase_08 AC 323 ms
42,608 KB
testcase_09 AC 321 ms
42,948 KB
testcase_10 AC 288 ms
43,328 KB
testcase_11 AC 310 ms
43,432 KB
testcase_12 AC 300 ms
43,300 KB
testcase_13 AC 307 ms
42,732 KB
testcase_14 AC 314 ms
42,920 KB
testcase_15 AC 315 ms
43,436 KB
testcase_16 AC 297 ms
41,856 KB
testcase_17 AC 299 ms
43,548 KB
testcase_18 AC 301 ms
41,788 KB
testcase_19 AC 323 ms
42,692 KB
testcase_20 AC 320 ms
43,008 KB
testcase_21 AC 319 ms
42,348 KB
testcase_22 AC 305 ms
43,504 KB
testcase_23 AC 300 ms
41,800 KB
testcase_24 AC 56 ms
37,248 KB
testcase_25 AC 83 ms
38,444 KB
testcase_26 AC 61 ms
37,176 KB
testcase_27 AC 60 ms
37,032 KB
testcase_28 AC 147 ms
39,608 KB
testcase_29 AC 100 ms
38,668 KB
testcase_30 AC 82 ms
38,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.AbstractMap;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.TreeSet;
import static java.util.Comparator.*;				

public class Main {
	
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInput in = new MyInput(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        
        Solver solver = new Solver();
        solver.solve(1, in, out);
        
        out.close();
    }
    
    // ======================================================================
    //
    static class Solver {
    	
    	int N;
    	long K;
    	long[] L;
    	
    	// index が条件を満たすかどうか	
    	boolean isOK(double len) {
    		long cnt = 0;
    		for(int i=0; i < N; i++) {
    			cnt += (L[i] / len);
    		}
    	    if (cnt < K)		return true;
    	    else 				return false;	
    	}
    	// 汎用的な二分探索のテンプレ
    	// この場合、key より大きい中で　一番左のインデックスを返す
    	double calc(long max) {
    	    double ng = 0; 				//「index = 0」が条件を満たすこともあるので、初期値は -1	
    	    double ok = (double)max; 		// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()	
    		for(int i=0; i < 100; i++) {
    	        double mid = (ok + ng) / 2;	
    	        if (isOK(mid)) 		ok = mid;	
    	        else 				ng = mid;	
    	    }
    	    return ok;
    	}
    	
    	public void solve(int testNumber, MyInput in, PrintWriter out) {
    		N = in.nextInt();
    		L = new long[N];
    		long m = 0;
    		for(int i=0; i < N; i++) {
    			L[i] = in.nextLong();
    			m = Math.max(m, L[i]);
    		}
    		K = in.nextLong();
    		out.println(calc(m));
        }
    }
    // ======================================================================
    static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {
        /** serialVersionUID. */
        private static final long serialVersionUID = 6411527075103472113L;

        public Pair(final K key, final V value) {
            super(key, value);
        }
     }    
    static class MyInput {
        private final BufferedReader in;
        private static int pos;
        private static int readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500 * 8 * 2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];
 
        static {
            for (int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
            isLineSep['\r'] = isLineSep['\n'] = true;
        }
 
        public MyInput(InputStream is) {
            in = new BufferedReader(new InputStreamReader(is));
        }
 
        public int read() {
            if (pos >= readLen) {
                pos = 0;
                try {
                    readLen = in.read(buffer);
                } catch (IOException e) {
                    throw new RuntimeException();
                }
                if (readLen <= 0) {
                    throw new MyInput.EndOfFileRuntimeException();
                }
            }
            return buffer[pos++];
        }
 
        public int nextInt() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            int ret = 0;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
        public long nextLong() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            long ret = 0L;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
       public String nextString() {
        	String ret = new String(nextDChar()).trim();
            return ret;
        }
 
        public char[] nextDChar() {
            int len = 0;
            len = reads(len, isSpace);
            char[] ret = new char[len + 1];
            for (int i=0; i < len; i++)		ret[i] = str[i];
            ret[len] = 0x00;
            return ret;
        }
 
        public char nextChar() {
            while (true) {
                final int c = read();
                if (!isSpace[c]) {
                    return (char) c;
                }
            }
        }
 
        int reads(int len, boolean[] accept) {
            try {
                while (true) {
                    final int c = read();
                    if (accept[c]) {
                        break;
                    }
                    if (str.length == len) {
                        char[] rep = new char[str.length * 3 / 2];
                        System.arraycopy(str, 0, rep, 0, str.length);
                        str = rep;
                    }
                    str[len++] = (char) c;
                }
            } catch (MyInput.EndOfFileRuntimeException e) {
            }
            return len;
        }
 
        static class EndOfFileRuntimeException extends RuntimeException {
        }
    }
}
0