結果
問題 | No.2235 Line Up Colored Balls |
ユーザー | hiromi_ayase |
提出日時 | 2023-03-03 22:41:25 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 359 ms / 2,000 ms |
コード長 | 3,171 bytes |
コンパイル時間 | 5,875 ms |
コンパイル使用メモリ | 82,884 KB |
実行使用メモリ | 62,016 KB |
最終ジャッジ日時 | 2023-10-18 04:29:18 |
合計ジャッジ時間 | 19,519 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 86 ms
54,936 KB |
testcase_01 | AC | 88 ms
54,872 KB |
testcase_02 | AC | 87 ms
54,868 KB |
testcase_03 | AC | 86 ms
54,876 KB |
testcase_04 | AC | 312 ms
61,904 KB |
testcase_05 | AC | 91 ms
54,864 KB |
testcase_06 | AC | 89 ms
54,892 KB |
testcase_07 | AC | 290 ms
60,176 KB |
testcase_08 | AC | 88 ms
54,872 KB |
testcase_09 | AC | 89 ms
54,872 KB |
testcase_10 | AC | 90 ms
54,872 KB |
testcase_11 | AC | 87 ms
54,880 KB |
testcase_12 | AC | 88 ms
54,876 KB |
testcase_13 | AC | 86 ms
54,892 KB |
testcase_14 | AC | 89 ms
54,924 KB |
testcase_15 | AC | 87 ms
54,896 KB |
testcase_16 | AC | 90 ms
54,924 KB |
testcase_17 | AC | 90 ms
54,884 KB |
testcase_18 | AC | 320 ms
61,600 KB |
testcase_19 | AC | 311 ms
61,996 KB |
testcase_20 | AC | 321 ms
61,980 KB |
testcase_21 | AC | 320 ms
61,664 KB |
testcase_22 | AC | 329 ms
61,988 KB |
testcase_23 | AC | 326 ms
61,988 KB |
testcase_24 | AC | 325 ms
61,604 KB |
testcase_25 | AC | 317 ms
61,996 KB |
testcase_26 | AC | 330 ms
62,008 KB |
testcase_27 | AC | 331 ms
62,016 KB |
testcase_28 | AC | 312 ms
60,096 KB |
testcase_29 | AC | 317 ms
60,384 KB |
testcase_30 | AC | 309 ms
60,264 KB |
testcase_31 | AC | 304 ms
60,076 KB |
testcase_32 | AC | 318 ms
60,148 KB |
testcase_33 | AC | 298 ms
59,968 KB |
testcase_34 | AC | 312 ms
59,964 KB |
testcase_35 | AC | 325 ms
60,360 KB |
testcase_36 | AC | 290 ms
60,148 KB |
testcase_37 | AC | 316 ms
60,288 KB |
testcase_38 | AC | 153 ms
56,124 KB |
testcase_39 | AC | 105 ms
53,660 KB |
testcase_40 | AC | 171 ms
57,372 KB |
testcase_41 | AC | 322 ms
60,264 KB |
testcase_42 | AC | 319 ms
60,244 KB |
testcase_43 | AC | 126 ms
56,040 KB |
testcase_44 | AC | 264 ms
60,068 KB |
testcase_45 | AC | 135 ms
55,960 KB |
testcase_46 | AC | 359 ms
60,244 KB |
testcase_47 | AC | 260 ms
60,132 KB |
testcase_48 | AC | 323 ms
61,988 KB |
testcase_49 | AC | 326 ms
61,992 KB |
testcase_50 | AC | 326 ms
62,000 KB |
testcase_51 | AC | 328 ms
61,988 KB |
testcase_52 | AC | 328 ms
61,980 KB |
testcase_53 | AC | 315 ms
61,904 KB |
testcase_54 | AC | 333 ms
61,988 KB |
testcase_55 | AC | 334 ms
61,984 KB |
testcase_56 | AC | 320 ms
61,996 KB |
testcase_57 | AC | 327 ms
61,532 KB |
testcase_58 | AC | 89 ms
54,988 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); long[] x = nal(n); int mod = (int) 1e9 + 7; long sum = Arrays.stream(x).sum(); long p = 0; for (int i = 0; i < n; i++) { p += x[i] * inv(sum, mod) % mod * (x[i] - 1) % mod * inv(sum - 1, mod) % mod; p %= mod; } p = (1 + mod - p) % mod; p = p * (sum - 1) % mod + 1; p %= mod; System.out.println(p); // ab 1/3 * 1 // aa 1/3 * 0 // ba 1/3 * 1 // 2/3 * 2 + 17/3 } public static long inv(long a, long mod) { long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } return p < 0 ? p + mod : p; } 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)); } }