結果

問題 No.503 配列コレクション
ユーザー uwiuwi
提出日時 2017-04-07 22:48:40
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,161 bytes
コンパイル時間 4,228 ms
コンパイル使用メモリ 88,616 KB
実行使用メモリ 57,268 KB
最終ジャッジ日時 2024-07-16 02:45:01
合計ジャッジ時間 6,746 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,288 KB
testcase_01 WA -
testcase_02 AC 54 ms
49,968 KB
testcase_03 AC 53 ms
50,424 KB
testcase_04 AC 53 ms
50,008 KB
testcase_05 AC 54 ms
50,420 KB
testcase_06 AC 54 ms
49,848 KB
testcase_07 AC 55 ms
49,900 KB
testcase_08 AC 55 ms
50,348 KB
testcase_09 AC 54 ms
50,364 KB
testcase_10 AC 58 ms
50,396 KB
testcase_11 AC 60 ms
49,888 KB
testcase_12 AC 77 ms
51,056 KB
testcase_13 AC 58 ms
50,396 KB
testcase_14 AC 72 ms
50,140 KB
testcase_15 AC 77 ms
51,276 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 80 ms
51,124 KB
testcase_19 AC 89 ms
57,268 KB
testcase_20 AC 90 ms
50,860 KB
testcase_21 AC 59 ms
50,364 KB
testcase_22 AC 63 ms
50,256 KB
testcase_23 AC 58 ms
49,880 KB
testcase_24 AC 60 ms
50,484 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170407;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni(), D = ni();
		int o = (n-1)/(K-1);
		int len = n - o * (K-1);
		int mod = 1000000007;
		long ret = 0;
		long[] a = new long[o+1];
		a[0] = 1;
		for(int i = 0;i < len-1;i++){
			for(int j = 0;j < o;j++){
				a[j+1] += a[j];
				if(a[j+1] >= mod)a[j+1] -= mod;
			}
		}
		for(int i = 0;i <= o;i++){
			ret = ret * D + a[i];
			ret %= mod;
		}
		ret = ret * len % mod;
		out.println(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 E().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