結果

問題 No.67 よくある棒を切る問題 (1)
ユーザー OlandOland
提出日時 2019-04-02 20:15:22
言語 Java
(openjdk 23)
結果
AC  
実行時間 289 ms / 5,000 ms
コード長 3,515 bytes
コンパイル時間 3,075 ms
コンパイル使用メモリ 78,952 KB
実行使用メモリ 42,248 KB
最終ジャッジ日時 2024-11-08 12:53:15
合計ジャッジ時間 10,531 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 268 ms
40,720 KB
testcase_01 AC 56 ms
36,552 KB
testcase_02 AC 150 ms
39,320 KB
testcase_03 AC 181 ms
39,720 KB
testcase_04 AC 210 ms
42,176 KB
testcase_05 AC 209 ms
40,396 KB
testcase_06 AC 206 ms
42,248 KB
testcase_07 AC 243 ms
42,192 KB
testcase_08 AC 241 ms
41,952 KB
testcase_09 AC 220 ms
40,572 KB
testcase_10 AC 199 ms
42,124 KB
testcase_11 AC 203 ms
40,496 KB
testcase_12 AC 200 ms
41,876 KB
testcase_13 AC 210 ms
40,484 KB
testcase_14 AC 234 ms
42,032 KB
testcase_15 AC 206 ms
40,444 KB
testcase_16 AC 281 ms
42,204 KB
testcase_17 AC 289 ms
42,020 KB
testcase_18 AC 260 ms
42,104 KB
testcase_19 AC 273 ms
40,592 KB
testcase_20 AC 269 ms
40,516 KB
testcase_21 AC 288 ms
42,128 KB
testcase_22 AC 246 ms
40,252 KB
testcase_23 AC 252 ms
40,472 KB
testcase_24 AC 55 ms
37,024 KB
testcase_25 AC 68 ms
36,924 KB
testcase_26 AC 58 ms
36,948 KB
testcase_27 AC 57 ms
37,144 KB
testcase_28 AC 120 ms
38,664 KB
testcase_29 AC 97 ms
38,152 KB
testcase_30 AC 70 ms
37,180 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());
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0