結果
問題 | No.243 出席番号(2) |
ユーザー | hiromi_ayase |
提出日時 | 2019-03-10 10:55:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 427 ms / 2,000 ms |
コード長 | 3,021 bytes |
コンパイル時間 | 3,510 ms |
コンパイル使用メモリ | 77,912 KB |
実行使用メモリ | 53,684 KB |
最終ジャッジ日時 | 2023-09-05 19:53:45 |
合計ジャッジ時間 | 10,204 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
50,880 KB |
testcase_01 | AC | 67 ms
50,820 KB |
testcase_02 | AC | 67 ms
50,656 KB |
testcase_03 | AC | 111 ms
52,244 KB |
testcase_04 | AC | 108 ms
52,800 KB |
testcase_05 | AC | 109 ms
52,564 KB |
testcase_06 | AC | 109 ms
52,476 KB |
testcase_07 | AC | 108 ms
52,828 KB |
testcase_08 | AC | 149 ms
53,056 KB |
testcase_09 | AC | 154 ms
52,976 KB |
testcase_10 | AC | 150 ms
50,764 KB |
testcase_11 | AC | 150 ms
53,008 KB |
testcase_12 | AC | 148 ms
50,980 KB |
testcase_13 | AC | 210 ms
53,328 KB |
testcase_14 | AC | 210 ms
52,784 KB |
testcase_15 | AC | 211 ms
53,128 KB |
testcase_16 | AC | 210 ms
53,128 KB |
testcase_17 | AC | 211 ms
53,408 KB |
testcase_18 | AC | 309 ms
53,112 KB |
testcase_19 | AC | 307 ms
52,948 KB |
testcase_20 | AC | 307 ms
53,020 KB |
testcase_21 | AC | 310 ms
53,088 KB |
testcase_22 | AC | 307 ms
52,852 KB |
testcase_23 | AC | 412 ms
53,324 KB |
testcase_24 | AC | 416 ms
53,084 KB |
testcase_25 | AC | 427 ms
53,524 KB |
testcase_26 | AC | 414 ms
53,048 KB |
testcase_27 | AC | 419 ms
53,684 KB |
testcase_28 | AC | 67 ms
51,052 KB |
testcase_29 | AC | 67 ms
51,032 KB |
testcase_30 | AC | 69 ms
51,024 KB |
testcase_31 | AC | 67 ms
51,032 KB |
testcase_32 | AC | 69 ms
50,876 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); int[] x = new int[5000]; for (int i = 0; i < n; i++) { x[ni()]++; } int mod = (int) (1e9 + 7); long[] f = new long[n + 1]; f[0] = 1; for (int i = 1; i <= n; i++) { f[i] = f[i - 1] * i % mod; } long[] dp = new long[n + 1]; dp[0] = 1; for (int i = 0; i < n; i++) { for (int j = n - 1; j >= 0; j--) { dp[j+1] += dp[j] * x[i]; dp[j] %= mod; } } long ret = 0; for (int i = 0; i <= n; i++) { ret += f[n - i] * dp[i] % mod * (i % 2 == 0 ? 1 : (mod-1)); ret %= mod; } 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)); } }