結果

問題 No.940 ワープ　ε=ε=ε=ε=ε=│;p>д＜│
ユーザー uwiuwi
提出日時 2019-12-08 12:07:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 392 ms / 5,000 ms
コード長 4,467 bytes
コンパイル時間 4,476 ms
コンパイル使用メモリ 77,312 KB
実行使用メモリ 85,060 KB
最終ジャッジ日時 2023-08-28 17:30:06
合計ジャッジ時間 10,571 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 140 ms
69,916 KB
testcase_01 AC 138 ms
53,012 KB
testcase_02 AC 141 ms
53,332 KB
testcase_03 AC 145 ms
53,264 KB
testcase_04 AC 139 ms
53,208 KB
testcase_05 AC 141 ms
53,212 KB
testcase_06 AC 140 ms
53,172 KB
testcase_07 AC 141 ms
53,140 KB
testcase_08 AC 139 ms
53,076 KB
testcase_09 AC 143 ms
53,244 KB
testcase_10 AC 139 ms
53,128 KB
testcase_11 AC 139 ms
53,040 KB
testcase_12 AC 141 ms
53,384 KB
testcase_13 AC 140 ms
53,116 KB
testcase_14 AC 140 ms
53,396 KB
testcase_15 AC 179 ms
54,752 KB
testcase_16 AC 225 ms
57,348 KB
testcase_17 AC 274 ms
62,136 KB
testcase_18 AC 304 ms
77,364 KB
testcase_19 AC 271 ms
61,936 KB
testcase_20 AC 342 ms
80,156 KB
testcase_21 AC 240 ms
58,876 KB
testcase_22 AC 333 ms
79,752 KB
testcase_23 AC 225 ms
57,548 KB
testcase_24 AC 337 ms
67,300 KB
testcase_25 AC 370 ms
82,592 KB
testcase_26 AC 392 ms
85,060 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2019;
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 D03_3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	public static int mod = 1000000007;
	static int[][] fif = enumFIF(2200005, mod);
	
	// (-1)^i (n-k+i)! / (n-k)! / i!

	void solve()
	{
		int X = ni(), Y = ni(), Z = ni();
		int n = X+Y+Z;
		if(n == 0) {
			out.println(1);
			return;
		}
		long[] F = new long[n+1];
		for(int i = 0;i <= n;i++) {
			F[i] = C(X+i-1, i-1, mod, fif) * C(Y+i-1, i-1, mod, fif) % mod *
					C(Z+i-1, i-1, mod, fif) % mod;
		}
		
		long[] A = new long[n+2];
		for(int i = 0;i <= n+1;i++) {
			A[i] = C(n+1, i, mod, fif) * ((n+1-i) % 2 == 0 ? 1 : mod-1) % mod;
		}
		for(int i = n+1;i >= 1;i--) {
			A[i-1] += A[i] * 2;
			A[i-1] %= mod;
		}
		
		long ans = 0;
		for(int i = 0;i <= n;i++) {
			ans += A[i+1] * F[i];
			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 };
	}

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