結果
問題 | No.1035 Color Box |
ユーザー | 37zigen |
提出日時 | 2020-05-09 21:23:04 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 190 ms / 2,000 ms |
コード長 | 2,922 bytes |
コンパイル時間 | 2,352 ms |
コンパイル使用メモリ | 74,552 KB |
実行使用メモリ | 55,288 KB |
最終ジャッジ日時 | 2023-09-20 09:21:38 |
合計ジャッジ時間 | 11,020 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 187 ms
54,892 KB |
testcase_01 | AC | 158 ms
54,872 KB |
testcase_02 | AC | 158 ms
55,288 KB |
testcase_03 | AC | 161 ms
54,912 KB |
testcase_04 | AC | 160 ms
54,700 KB |
testcase_05 | AC | 161 ms
54,876 KB |
testcase_06 | AC | 158 ms
54,908 KB |
testcase_07 | AC | 158 ms
54,796 KB |
testcase_08 | AC | 183 ms
54,884 KB |
testcase_09 | AC | 168 ms
54,860 KB |
testcase_10 | AC | 158 ms
54,736 KB |
testcase_11 | AC | 157 ms
54,868 KB |
testcase_12 | AC | 156 ms
54,884 KB |
testcase_13 | AC | 180 ms
54,724 KB |
testcase_14 | AC | 183 ms
54,844 KB |
testcase_15 | AC | 189 ms
54,736 KB |
testcase_16 | AC | 160 ms
55,192 KB |
testcase_17 | AC | 159 ms
54,828 KB |
testcase_18 | AC | 158 ms
55,196 KB |
testcase_19 | AC | 190 ms
54,800 KB |
testcase_20 | AC | 159 ms
54,820 KB |
testcase_21 | AC | 158 ms
54,736 KB |
testcase_22 | AC | 159 ms
54,800 KB |
testcase_23 | AC | 158 ms
54,856 KB |
testcase_24 | AC | 159 ms
54,740 KB |
testcase_25 | AC | 159 ms
55,016 KB |
testcase_26 | AC | 157 ms
54,832 KB |
testcase_27 | AC | 159 ms
55,052 KB |
testcase_28 | AC | 157 ms
54,732 KB |
testcase_29 | AC | 157 ms
54,796 KB |
testcase_30 | AC | 159 ms
54,744 KB |
testcase_31 | AC | 158 ms
54,864 KB |
testcase_32 | AC | 157 ms
54,868 KB |
testcase_33 | AC | 157 ms
54,900 KB |
testcase_34 | AC | 160 ms
54,852 KB |
testcase_35 | AC | 157 ms
54,880 KB |
testcase_36 | AC | 156 ms
54,960 KB |
testcase_37 | AC | 155 ms
55,116 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; public class Main{ public static void main(String[] args) { new Main().solve(); } final long MOD=(long)1e9+7; int MAX=(int)3e5; long[] fac=new long[MAX]; long[] ifac=new long[MAX]; { fac[0]=1; for (int i=1;i<MAX;++i) fac[i]=fac[i-1]*i%MOD; for (int i=0;i<MAX;++i) ifac[i]=inv(fac[i]); } long pow(long a,long n) { return n!=0?pow(a*a%MOD,n/2)*(n%2==1?a:1)%MOD:1; } long inv(long a) { return pow(a,MOD-2); } long comb(int n,int k) { return fac[n]*ifac[k]%MOD*ifac[n-k]%MOD; } void solve() { FastScanner sc=new FastScanner(); long N=sc.nextLong(); long M=sc.nextLong(); long ans=0; for (int i=0;i<M;++i) { ans+=comb((int)M,i)*pow(M-i,N)%MOD*(i%2==0?1:(MOD-1))%MOD; ans%=MOD; } System.out.println(ans); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int)nextLong(); } }