結果

問題 No.802 だいたい等差数列
ユーザー uwiuwi
提出日時 2019-03-18 22:14:21
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 4,551 bytes
コンパイル時間 4,464 ms
コンパイル使用メモリ 80,928 KB
実行使用メモリ 49,512 KB
最終ジャッジ日時 2024-07-19 06:29:01
合計ジャッジ時間 9,683 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 122 ms
48,776 KB
testcase_01 AC 124 ms
48,476 KB
testcase_02 AC 124 ms
48,516 KB
testcase_03 AC 54 ms
36,832 KB
testcase_04 AC 124 ms
48,728 KB
testcase_05 AC 55 ms
36,756 KB
testcase_06 AC 124 ms
48,516 KB
testcase_07 AC 125 ms
48,596 KB
testcase_08 AC 125 ms
48,476 KB
testcase_09 AC 124 ms
48,564 KB
testcase_10 AC 124 ms
48,708 KB
testcase_11 AC 123 ms
48,588 KB
testcase_12 AC 123 ms
48,632 KB
testcase_13 AC 124 ms
48,772 KB
testcase_14 AC 130 ms
48,864 KB
testcase_15 AC 147 ms
49,124 KB
testcase_16 AC 129 ms
48,680 KB
testcase_17 AC 54 ms
36,592 KB
testcase_18 AC 54 ms
36,888 KB
testcase_19 AC 132 ms
48,632 KB
testcase_20 AC 177 ms
49,364 KB
testcase_21 AC 168 ms
49,512 KB
testcase_22 AC 123 ms
48,660 KB
testcase_23 AC 139 ms
48,516 KB
testcase_24 RE -
testcase_25 AC 124 ms
48,660 KB
testcase_26 AC 124 ms
48,724 KB
testcase_27 AC 124 ms
48,844 KB
testcase_28 AC 158 ms
48,540 KB
testcase_29 AC 185 ms
49,452 KB
testcase_30 AC 122 ms
48,792 KB
testcase_31 AC 123 ms
48,520 KB
testcase_32 AC 52 ms
36,800 KB
testcase_33 AC 127 ms
48,644 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190317;
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 D4 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int m = ni();
		int d1 = ni(), d2 = ni();
		int mod = 1000000007;
		m -= (long)d1*(n-1);
		d2 -= d1;
		if(m < 0){
			out.println(0);
			return;
		}
		
		// (x^m-1)*(x^t-1)^{n-1}/(x-1)^n
		// k(d2+1)項目の寄与 : C(n-1,k)*(C(n-2,0)+C(n-1,1)+C(n,2)+...+C(n-2+(m-1-k(d2+1)),m-1-k(d2+1))+(C(n-2,0)+C(n-1,1)+C(n,2)+...+C(n-2+(m-2-k(d2+1)),m-2-k(d2+1))
		// k(d2+1)項目の寄与 : C(n-1,k)*(C(n-1+(m-1-k(d2+1)),m-1-k(d2+1))+C(n-1+(m-2-k(d2+1)),m-2-k(d2+1))+...
		// k(d2+1)項目の寄与 : C(n-1,k)*(C(n-1+(m-1-k(d2+1))+1,m-1-k(d2+1))
		
		int[][] fif = enumFIF(1300005, mod);
		long ans = 0;
		for(int i = (m-1)/(d2+1);i >= 0;i--) {
			ans = -ans + C(n+(m-1-i*(d2+1)), m-1-i*(d2+1), mod, fif)*C(n-1, i, mod, fif);
			ans %= mod;
		}
		if(ans < 0)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 D4().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