結果
問題 | No.794 チーム戦 (2) |
ユーザー | hiromi_ayase |
提出日時 | 2019-02-23 02:05:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 364 ms / 1,500 ms |
コード長 | 3,014 bytes |
コンパイル時間 | 6,169 ms |
コンパイル使用メモリ | 82,880 KB |
実行使用メモリ | 62,580 KB |
最終ジャッジ日時 | 2023-08-18 04:16:45 |
合計ジャッジ時間 | 13,610 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
50,904 KB |
testcase_01 | AC | 66 ms
50,952 KB |
testcase_02 | AC | 67 ms
50,888 KB |
testcase_03 | AC | 66 ms
51,176 KB |
testcase_04 | AC | 65 ms
50,688 KB |
testcase_05 | AC | 66 ms
50,824 KB |
testcase_06 | AC | 66 ms
51,004 KB |
testcase_07 | AC | 66 ms
51,328 KB |
testcase_08 | AC | 66 ms
50,892 KB |
testcase_09 | AC | 67 ms
50,880 KB |
testcase_10 | AC | 66 ms
50,596 KB |
testcase_11 | AC | 66 ms
51,012 KB |
testcase_12 | AC | 67 ms
50,716 KB |
testcase_13 | AC | 67 ms
51,152 KB |
testcase_14 | AC | 359 ms
62,324 KB |
testcase_15 | AC | 364 ms
62,164 KB |
testcase_16 | AC | 359 ms
61,568 KB |
testcase_17 | AC | 359 ms
61,896 KB |
testcase_18 | AC | 356 ms
62,016 KB |
testcase_19 | AC | 356 ms
62,580 KB |
testcase_20 | AC | 358 ms
62,100 KB |
testcase_21 | AC | 359 ms
60,904 KB |
testcase_22 | AC | 293 ms
59,616 KB |
testcase_23 | AC | 290 ms
59,536 KB |
testcase_24 | AC | 266 ms
57,616 KB |
testcase_25 | AC | 262 ms
57,788 KB |
testcase_26 | AC | 261 ms
57,920 KB |
testcase_27 | AC | 255 ms
60,280 KB |
testcase_28 | AC | 246 ms
58,228 KB |
testcase_29 | AC | 248 ms
60,444 KB |
testcase_30 | AC | 256 ms
58,332 KB |
testcase_31 | AC | 252 ms
58,216 KB |
testcase_32 | AC | 251 ms
58,168 KB |
testcase_33 | AC | 253 ms
58,164 KB |
testcase_34 | AC | 253 ms
58,044 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int k = ni(); int[] a = na(n); Arrays.sort(a); int mod = 1000000000 + 7; int ptr = 0; int cnt = 0; long ret = 1; for (int i = n - 1; i >= 0; i --) { while (ptr < i && a[ptr] + a[i] <= k) { ptr ++; } if (ptr == i) { int last = i + 1 - cnt; System.err.println(last); for (int j = 1; j <= last; j += 2) { ret *= j; ret %= mod; } break; } else { ret *= ptr - cnt; ret %= mod; cnt ++; } } System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }