結果

問題 No.895 MESE
ユーザー uwiuwi
提出日時 2019-09-27 22:33:26
言語 Java21
(openjdk 21)
結果
AC  
実行時間 215 ms / 2,000 ms
コード長 5,454 bytes
コンパイル時間 4,075 ms
コンパイル使用メモリ 86,848 KB
実行使用メモリ 65,212 KB
最終ジャッジ日時 2024-09-24 23:10:44
合計ジャッジ時間 9,761 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 131 ms
63,088 KB
testcase_01 AC 132 ms
63,184 KB
testcase_02 AC 132 ms
63,168 KB
testcase_03 AC 130 ms
63,100 KB
testcase_04 AC 131 ms
63,168 KB
testcase_05 AC 131 ms
62,968 KB
testcase_06 AC 131 ms
62,948 KB
testcase_07 AC 132 ms
62,916 KB
testcase_08 AC 132 ms
63,108 KB
testcase_09 AC 134 ms
63,200 KB
testcase_10 AC 135 ms
62,976 KB
testcase_11 AC 133 ms
63,020 KB
testcase_12 AC 132 ms
63,152 KB
testcase_13 AC 202 ms
64,996 KB
testcase_14 AC 181 ms
64,776 KB
testcase_15 AC 187 ms
64,700 KB
testcase_16 AC 184 ms
64,876 KB
testcase_17 AC 181 ms
64,928 KB
testcase_18 AC 214 ms
65,148 KB
testcase_19 AC 215 ms
65,144 KB
testcase_20 AC 214 ms
65,212 KB
testcase_21 AC 212 ms
65,000 KB
testcase_22 AC 213 ms
65,124 KB
testcase_23 AC 212 ms
65,212 KB
testcase_24 AC 215 ms
65,208 KB
testcase_25 AC 213 ms
65,168 KB
testcase_26 AC 213 ms
65,004 KB
testcase_27 AC 213 ms
65,168 KB
testcase_28 AC 213 ms
65,124 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190927;
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 D2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int a = ni(), b = ni(), c = ni();
		int mod = 1000000007;
		// 0 ? t
		// a1+b1 = t-1
		// a2+b2+c2 = a+b+c-t-1, a2+b2=a+b-t
		// a1+a2+1 = a
		// b1 >= 1
		// b1+b2=b
		// c2+1=c
		//
		
		// C(a1+b1,a1)*2^(a+b+c-1-t)*
		
		
		// t 1 n-1-t
		
		// (C(a+b-1,b) - C(a+b-t,b)) * C(n-1-t,c-1)
		
		// (c-1)/(n-1-t) * (2^(n-1-t)-1) + 2^(n-1-t)
		int[][] fif = enumFIF(1000000, mod);
		
		long[] p2 = enumPows(2, 400000, mod);
		int[] is = enumInvs(400000, mod);
		long ans = 0;
		long A = C(a+b-1, b, mod, fif);
		for(int t = 2;t < a+b+c;t++) {
			long all = (A - C(a+b-t, b, mod, fif)) * C(a+b+c-1-t, c-1, mod, fif);
			all %= mod;
			ans += all * p2[a+b+c-1-t];
			ans += all * (c-1) % mod * is[a+b+c-1-t] % mod * (p2[a+b+c-1-t] - 1);
			ans %= mod;
		}
		if(ans < 0)ans += mod;
		out.println(ans);
	}
	
	public static int[] enumInvs(int n, int mod) {
		int[] inv = new int[n + 1];
		inv[1] = 1;
		for (int i = 2; i <= n; i++) {
			inv[i] = (int) (inv[mod % i] * (long) (mod - mod / i) % mod);
		}
		return inv;
	}

	
	public static long[] enumPows(int a, int n, int mod)
	{
		a %= mod;
		long[] pows = new long[n+1];
		pows[0] = 1;
		for(int i = 1;i <= n;i++)pows[i] = pows[i-1] * a % mod;
		return pows;
	}

	
	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 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 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 D2().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