結果

問題 No.475 最終日 - Writerの怠慢
ユーザー GrenacheGrenache
提出日時 2016-12-25 13:09:27
言語 Java19
(openjdk 21)
結果
AC  
実行時間 293 ms / 2,000 ms
コード長 4,686 bytes
コンパイル時間 3,645 ms
コンパイル使用メモリ 76,784 KB
実行使用メモリ 57,976 KB
最終ジャッジ日時 2023-08-25 16:42:27
合計ジャッジ時間 7,922 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 115 ms
55,888 KB
testcase_01 AC 120 ms
56,012 KB
testcase_02 AC 126 ms
55,516 KB
testcase_03 AC 161 ms
56,548 KB
testcase_04 AC 289 ms
57,976 KB
testcase_05 AC 274 ms
57,240 KB
testcase_06 AC 280 ms
57,612 KB
testcase_07 AC 286 ms
57,840 KB
testcase_08 AC 286 ms
57,320 KB
testcase_09 AC 293 ms
57,020 KB
testcase_10 AC 284 ms
57,536 KB
testcase_11 AC 265 ms
57,232 KB
testcase_12 AC 202 ms
54,708 KB
testcase_13 AC 125 ms
53,032 KB
testcase_14 AC 42 ms
49,524 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.util.*;


public class Main_yukicoder475 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int s = sc.nextInt();
		int id = sc.nextInt();

		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}

		int wsc = a[id];
		int sc = wsc + s * 100;
		Arrays.sort(a);

		double ret = 1;
		for (int i = 0; i < n - 1; i++) {
			int tmp = 50 * s + 250 * s / (4 + (i + 1));
			int key = sc - tmp;

			int index = lower_bound(a, 0, n, key);
			if (index - i - (key >= wsc ? 1 : 0) <= 0) {
				pr.println(0);
				return;
			}
			ret *= (double)(index - i - (key >= wsc ? 1 : 0)) / (n - 1 - i);
		}

		pr.printf("%.10f\n", ret);
	}

	private static int lower_bound(int[] data, int l, int r, int value) {
		while (r > l) {
			int mid = l + (r - l) / 2;
//			if (data[mid] >= value) {
			if (data[mid] > value) {
				r = mid;
			} else {
				l = mid + 1;
			}
		}

		return l;
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0