結果
問題 | No.8053 2.5 色で色塗り |
ユーザー | uwi |
提出日時 | 2019-04-02 19:48:39 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 716 ms / 2,000 ms |
コード長 | 4,140 bytes |
コンパイル時間 | 3,914 ms |
コンパイル使用メモリ | 83,376 KB |
実行使用メモリ | 181,616 KB |
最終ジャッジ日時 | 2024-11-30 22:03:06 |
合計ジャッジ時間 | 12,245 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 492 ms
181,060 KB |
testcase_01 | AC | 491 ms
181,276 KB |
testcase_02 | AC | 495 ms
181,316 KB |
testcase_03 | AC | 513 ms
181,400 KB |
testcase_04 | AC | 494 ms
178,536 KB |
testcase_05 | AC | 490 ms
181,364 KB |
testcase_06 | AC | 487 ms
181,312 KB |
testcase_07 | AC | 494 ms
181,076 KB |
testcase_08 | AC | 536 ms
181,084 KB |
testcase_09 | AC | 716 ms
181,596 KB |
testcase_10 | AC | 490 ms
181,096 KB |
testcase_11 | AC | 636 ms
181,456 KB |
testcase_12 | AC | 715 ms
181,616 KB |
ソースコード
package af2019; 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 N3053 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int mod = 1000000007; int n = ni(), m = ni(); int[][] S = stirlingNumberOfTheSecondKind(5111, 5111, mod); long x = invl(2, mod) * 5 % mod; long ans = 0; for(int k = 0;k <= m;k++) { long v = S[m][k]; for(int j = 0;j < k;j++) { v = v * (x-j) % mod; } v = v * pow(x+mod-k, n, mod) % mod; ans += v; } out.println(ans%mod); } public static long pow(long a, long n, long mod) { // a %= mod; long ret = 1; int x = 63 - Long.numberOfLeadingZeros(n); for (; x >= 0; x--) { ret = ret * ret % mod; if (n << 63 - x < 0) ret = ret * a % mod; } return ret; } 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 int[][] stirlingNumberOfTheSecondKind(int n, int m, int mod) { int[][] dp = new int[n+1][m+1]; dp[0][0] = 1; for(int i = 1;i <= n;i++){ for(int j = 1;j <= m;j++){ dp[i][j] = (int)(((long)j*dp[i-1][j]+dp[i-1][j-1])%mod); } } return dp; } 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 N3053().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)); } }