結果
問題 | No.794 チーム戦 (2) |
ユーザー | tutuz |
提出日時 | 2019-02-22 22:42:44 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,266 bytes |
コンパイル時間 | 2,556 ms |
コンパイル使用メモリ | 86,832 KB |
実行使用メモリ | 55,004 KB |
最終ジャッジ日時 | 2024-11-25 10:41:55 |
合計ジャッジ時間 | 9,683 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
50,208 KB |
testcase_01 | AC | 54 ms
50,256 KB |
testcase_02 | AC | 56 ms
50,516 KB |
testcase_03 | AC | 55 ms
50,400 KB |
testcase_04 | AC | 55 ms
50,724 KB |
testcase_05 | AC | 56 ms
50,008 KB |
testcase_06 | AC | 55 ms
50,184 KB |
testcase_07 | AC | 57 ms
50,208 KB |
testcase_08 | AC | 53 ms
50,116 KB |
testcase_09 | AC | 56 ms
50,516 KB |
testcase_10 | AC | 55 ms
50,660 KB |
testcase_11 | AC | 55 ms
50,076 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 319 ms
53,800 KB |
testcase_17 | AC | 287 ms
54,044 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 190 ms
54,404 KB |
testcase_30 | AC | 174 ms
53,944 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
ソースコード
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.util.Arrays; 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); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { public void solve(int testNumber, MyInput in, PrintWriter out) { int n = in.nextInt(); long k = in.nextLong(); long[] a = in.nextLongArray(n); Arrays.sort(a); long ans = 1; long cnt = 0; for (int i = n-1; i >= 0; i--) { int idx = upperBound(a, k - a[i], i-1) - 1 + 1; ans *= Math.max(idx - cnt, 1); if (idx - cnt >= 0) cnt++; } out.println(a[0] + a[1] > k ? 0 : ans); } } public static int upperBound(long[] a, long obj, int R) { int l = 0, r = R; while (r - l >= 0) { int c = (l + r) / 2; if (a[c] <= obj) { l = c + 1; } else { r = c - 1; } } return l; } 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 = 0; if (str[0] == '-') { i = 1; } for (; i < len; i++) ret = ret * 10 + str[i] - '0'; if (str[0] == '-') { ret = -ret; } return ret; } public char nextChar() { while (true) { final int c = read(); if (!isSpace[c]) { return (char) c; } } } public String nextString() { return new String(nextChars()); } public char[] nextChars() { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } public char[][] next2DChars(int h, int w) { char[][] s = new char[h][w]; for (int i = 0; i < h; i++) { s[i] = nextChars(); } return s; } 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; } public int[] nextIntArray(final int n) { final int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArray1Index(final int n) { final int[] res = new int[n + 1]; for (int i = 1; i < n + 1; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(final int n) { final int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public long[] nextLongArray(final int n) { final long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArray1Index(final int n) { final long[] res = new long[n + 1]; for (int i = 1; i < n + 1; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(final int n) { final long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public double nextDouble() { return Double.parseDouble(nextString()); } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } static class EndOfFileRuntimeException extends RuntimeException { } } }