結果

問題 No.68 よくある棒を切る問題 (2)
ユーザー ぴろずぴろず
提出日時 2016-01-12 11:22:31
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,066 ms / 5,000 ms
コード長 4,499 bytes
コンパイル時間 3,847 ms
コンパイル使用メモリ 79,760 KB
実行使用メモリ 66,276 KB
最終ジャッジ日時 2024-09-19 18:51:12
合計ジャッジ時間 20,396 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 980 ms
58,716 KB
testcase_01 AC 962 ms
58,960 KB
testcase_02 AC 973 ms
58,716 KB
testcase_03 AC 1,044 ms
58,780 KB
testcase_04 AC 1,038 ms
58,924 KB
testcase_05 AC 1,017 ms
66,276 KB
testcase_06 AC 971 ms
58,732 KB
testcase_07 AC 953 ms
58,756 KB
testcase_08 AC 1,066 ms
56,136 KB
testcase_09 AC 1,011 ms
58,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no068;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;

public class Main {
	public static final int KMAX = 500000;
	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		PriorityQueue<Pair> pq = new PriorityQueue<Pair>(Collections.reverseOrder());
		for(int i=0;i<n;i++) {
			pq.offer(new Pair(io.nextInt(),1));
		}
		double[] ans = new double[KMAX+1];
		for(int i=1;i<=KMAX;i++) {
			Pair p = pq.poll();
			ans[i] = (double) p.a / p.b;
			p.b++;
			pq.offer(p);
		}
		int q = io.nextInt();
		for(int i=0;i<q;i++) {
			int k = io.nextInt();
			io.printf("%.10f\n",ans[k]);
		}
		io.flush();
	}
}
class Pair implements Comparable<Pair>{
	long a,b;
	public Pair(long a,long b) {
		this.a = a;
		this.b = b;
	}
	@Override
	public int compareTo(Pair o) {
		return Long.compare(a*o.b, o.a*b);
	}
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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 char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0