#469123 (Java21) No.1035 Color Box

提出ソース

結果

問題	No.1035 Color Box
ユーザー	uwi
提出日時	2020-04-24 21:29:53
言語	Java21 (openjdk 21)
結果	AC
実行時間	113 ms / 2,000 ms
コード長	4,249 bytes
コンパイル時間	3,941 ms
コンパイル使用メモリ	88,880 KB
実行使用メモリ	38,548 KB
最終ジャッジ日時	2024-10-15 02:23:29
合計ジャッジ時間	7,735 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	113 ms 38,352 KB
testcase_01	AC	59 ms 37,704 KB
testcase_02	AC	59 ms 37,772 KB
testcase_03	AC	69 ms 38,512 KB
testcase_04	AC	69 ms 38,548 KB
testcase_05	AC	68 ms 38,228 KB
testcase_06	AC	62 ms 37,876 KB
testcase_07	AC	62 ms 37,800 KB
testcase_08	AC	106 ms 38,488 KB
testcase_09	AC	84 ms 38,360 KB
testcase_10	AC	59 ms 37,392 KB
testcase_11	AC	61 ms 37,784 KB
testcase_12	AC	61 ms 37,824 KB
testcase_13	AC	101 ms 38,284 KB
testcase_14	AC	109 ms 38,432 KB
testcase_15	AC	112 ms 38,260 KB
testcase_16	AC	59 ms 37,816 KB
testcase_17	AC	61 ms 37,836 KB
testcase_18	AC	61 ms 37,820 KB
testcase_19	AC	112 ms 38,204 KB
testcase_20	AC	60 ms 37,384 KB
testcase_21	AC	61 ms 37,564 KB
testcase_22	AC	61 ms 37,640 KB
testcase_23	AC	59 ms 37,548 KB
testcase_24	AC	60 ms 37,776 KB
testcase_25	AC	63 ms 37,792 KB
testcase_26	AC	58 ms 37,472 KB
testcase_27	AC	62 ms 37,504 KB
testcase_28	AC	62 ms 37,432 KB
testcase_29	AC	59 ms 37,476 KB
testcase_30	AC	60 ms 37,384 KB
testcase_31	AC	61 ms 37,580 KB
testcase_32	AC	60 ms 37,800 KB
testcase_33	AC	60 ms 37,688 KB
testcase_34	AC	60 ms 37,792 KB
testcase_35	AC	61 ms 37,612 KB
testcase_36	AC	61 ms 37,588 KB
testcase_37	AC	61 ms 37,616 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest200424;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int mod = 1000000007;
		int n = ni(), m = ni();
		long ans = 0;
		int[][] fif = enumFIF(100005, mod);
		for(int i = m, s = 1;i >= 0;i--, s = mod-s){
			ans += pow(i, n, mod) * C(m, i, mod, fif) % mod * s;
			ans %= mod;
		}
		out.println(ans);
	}
	
	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 };
	}

	
	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;
	}

	
	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 C().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)); }
}

yukicoder

結果

テストケース

ソースコード