Submission #1182214
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { FastScanner sc = new FastScanner(); int N = sc.nextInt(); int A = sc.nextInt(); int B = sc.nextInt(); long[] v = sc.nextLongList(N); Arrays.sort(v); double ave = 0; for (int i = 0; i < A; i ++) { ave += v[v.length - i - 1]; } ave /= A; int idx = 0; for (; idx < v.length; idx ++) { if (v[idx] > v[v.length - A]) { break; } } long s = v[v.length - A]; if (s < v[v.length - 1]) { long n = 0; for (int i = 0; i < v.length; i ++) { if (s == v[i]) { n ++; } } long r = idx - (v.length - A); long ret = 1; for (int i = 0; i < r; i ++) { ret *= (n - i); ret /= (i + 1); } System.out.printf("%f\n", ave); System.out.println(ret); } else { long n = 0; for (int i = 0; i < N; i ++) { if (s == v[i]) { n ++; } } long ret = 0; for (long r = A; r <= B; r ++) { long c = 1; for (int i = 0; i < r; i ++) { c *= (n - i); c /= (i + 1); } ret += c; } System.out.printf("%f\n", ave); System.out.println(ret); } } } class FastScanner { public static String debug = null; private final InputStream in = System.in; private int ptr = 0; private int buflen = 0; private byte[] buffer = new byte[1024]; private boolean eos = false; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { if (debug != null) { buflen = debug.length(); buffer = debug.getBytes(); debug = ""; eos = true; } else { buflen = in.read(buffer); } } catch (IOException e) { e.printStackTrace(); } if (buflen < 0) { eos = true; return false; } else 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 void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean isEOS() { return this.eos; } public boolean hasNext() { skipUnprintable(); 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() { return (int) nextLong(); } public long[] nextLongList(int n) { return nextLongTable(1, n)[0]; } public int[] nextIntList(int n) { return nextIntTable(1, n)[0]; } public long[][] nextLongTable(int n, int m) { long[][] ret = new long[n][m]; for (int i = 0; i < n; i ++) { for (int j = 0; j < m; j ++) { ret[i][j] = nextLong(); } } return ret; } public int[][] nextIntTable(int n, int m) { int[][] ret = new int[n][m]; for (int i = 0; i < n; i ++) { for (int j = 0; j < m; j ++) { ret[i][j] = nextInt(); } } return ret; } }
Submission Info
Submission Time | |
---|---|
Task | D - Maximum Average Sets |
User | hiromi_ayase |
Language | Java8 (OpenJDK 1.8.0) |
Score | 400 |
Code Size | 4130 Byte |
Status | AC |
Exec Time | 75 ms |
Memory | 21588 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 74 ms | 21588 KB |
sample_02.txt | AC | 73 ms | 21332 KB |
sample_03.txt | AC | 73 ms | 18772 KB |
sample_04.txt | AC | 73 ms | 18260 KB |
subtask_1_1.txt | AC | 75 ms | 21332 KB |
subtask_1_10.txt | AC | 72 ms | 21460 KB |
subtask_1_11.txt | AC | 75 ms | 21204 KB |
subtask_1_12.txt | AC | 75 ms | 19156 KB |
subtask_1_13.txt | AC | 73 ms | 18388 KB |
subtask_1_14.txt | AC | 73 ms | 19412 KB |
subtask_1_15.txt | AC | 75 ms | 20692 KB |
subtask_1_2.txt | AC | 75 ms | 19668 KB |
subtask_1_3.txt | AC | 74 ms | 19540 KB |
subtask_1_4.txt | AC | 74 ms | 19284 KB |
subtask_1_5.txt | AC | 75 ms | 21204 KB |
subtask_1_6.txt | AC | 75 ms | 21204 KB |
subtask_1_7.txt | AC | 75 ms | 20308 KB |
subtask_1_8.txt | AC | 74 ms | 19924 KB |
subtask_1_9.txt | AC | 74 ms | 21332 KB |