結果
問題 | No.563 超高速一人かるた large |
ユーザー |
|
提出日時 | 2017-08-25 22:59:24 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 665 ms / 3,000 ms |
コード長 | 5,332 bytes |
コンパイル時間 | 4,199 ms |
コンパイル使用メモリ | 87,200 KB |
実行使用メモリ | 53,724 KB |
最終ジャッジ日時 | 2024-10-15 16:07:37 |
合計ジャッジ時間 | 13,139 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
ソースコード
package contest170825;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;public class F {InputStream is;PrintWriter out;String INPUT = "";// String INPUT = "12 a b c d e f g h i j k l";void solve(){int n = ni();char[][] ss = new char[n][];for(int i = 0;i < n;i++){ss[i] = ns().toCharArray();}long[] ls = new long[n];for(int i = 0;i < n;i++){int[] lcps = new int[n];int p = 0;for(int j = 0;j < n;j++){if(j == i)continue;lcps[p++] = lcp(ss[i], ss[j]);}lcps[p++] = 1;Arrays.sort(lcps);for(int j = 0;j < n;j++)ls[j] += lcps[j];}int mod = 1000000007;int[][] fif = enumFIF(1000000, mod);for(int j = 0;j < n;j++){ls[j] = ls[j] % mod;}long[] ans = new long[n];for(int i = n;i >= 1;i--){for(int j = 0;j < n;j++){// tr(i, j, C(n-j-2, n-i-j, mod, fif));ans[n-i] += C(n-j-2, n-i-j, mod, fif) * ls[n-1-j];ans[n-i] %= mod;}if(i == 1){ans[n-i] += ls[0];ans[n-i] %= mod;}}for(int i = 0;i < n;i++){ans[i] = ans[i] * invl(C(n-1, i, mod, fif) % mod * n % mod, mod) % mod;}for(int i = 0;i < n-1;i++){ans[i+1] += ans[i];ans[i+1] %= mod;}long q = 1;for(int i = 0;i < n;i++){q = q * (n-i) % mod;ans[i] = ans[i] * q % mod;}for(long an : ans){out.println(an);}}public static long invl(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 long C(int n, int r, int mod, int[][] fif) {if (n < 0 || r < 0 || r > n)return 0;return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;}public static int[][] enumFIF(int n, int mod) {int[] f = new int[n + 1];int[] invf = new int[n + 1];f[0] = 1;for (int i = 1; i <= n; i++) {f[i] = (int) ((long) f[i - 1] * i % mod);}long a = f[n];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;}invf[n] = (int) (p < 0 ? p + mod : p);for (int i = n - 1; i >= 0; i--) {invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);}return new int[][] { f, invf };}int lcp(char[] a, char[] b){for(int i = 0;i < a.length && i < b.length;i++){if(a[i] != b[i])return i+1;}return Math.min(a.length, b.length) + 1;}void run() throws Exception{is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);long s = System.currentTimeMillis();solve();out.flush();if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){// @Override// public void run() {// long s = System.currentTimeMillis();// solve();// out.flush();// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// }// };// t.start();// t.join();}public static void main(String[] args) throws Exception { new F().run(); }private byte[] inbuf = new byte[1024];public int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private long[] nal(int n){long[] a = new long[n];for(int i = 0;i < n;i++)a[i] = nl();return a;}private char[][] nm(int n, int m) {char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[][] nmi(int n, int m) {int[][] map = new int[n][];for(int i = 0;i < n;i++)map[i] = na(m);return map;}private int ni() { return (int)nl(); }private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }}